Least fixed points in monoidal categories with cartesian structure on objects

Authors

  • Jordan Zashev

Abstract

The paper contains a generalization of the recursion theory in iterative operative spaces. The generalization consists in replacin the partial order in an operative space with arrows in a category. For that purpose the notion of a DM-category is introduced. An example of a DM-category is described which deals with some kind of idealized nontederministic programs together with proofs of the correctness of their work. A theory of fixed points of definable functors in DMcategories is developed which contains categorial analogues of all principal results of the abstract recursion theory in iterative operative spaces.

Downloads

Published

1993-12-12

How to Cite

Zashev, J. (1993). Least fixed points in monoidal categories with cartesian structure on objects. Ann. Sofia Univ. Fac. Math. And Inf., 84, 23–42. Retrieved from https://annual.uni-sofia.bg/index.php/fmi/article/view/465