The logic of recursive equations

Journal of Symbolic Logic

Volumn 63, Issue 2, 1998, Pages 451-478

  Hurkens, A J C ^a   McArthur, Monica ^b   Moschovakis, Yiannis N ^c   Moss, Lawrence S ^b   Whitney, Glen T ^d  

^a Indiana University ^*  (Netherlands)

^b INDIANA UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032222029     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2586843     Document Type: Article

References (23)

1. STEPHEN L. BLOOM and ZOLTÁN ÉSIK, Iteration theories: The equational logic of iterative processes, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1993.
2. _, Solving polynomial fixed-point equations, Mathematical foundations of computer science '94, Lecture Notes in Computer Science, no. 841, Springer-Verlag, Berlin, 1994.
3. _, Some quasi-varieties of iteration theories, Mathematical foundations of programming semantics '93, Lecture Notes in Computer Science, no. 802, Springer-Verlag, Berlin, 1994.
4. B. COURCELLE, G. KAHN, and J. VUILLEMIN, Algorithmes d'equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples, Automata, languages, and programming, 2nd colloquium (J. Loeckx, editor), Lecture Notes in Computer Science, no. 14, Springer-Verlag, Berlin, 1974.
5. J. W. DE BARKER, Recursive procedures, Mathematical Centre Tracts 24, Mathematisch Centrum Amsterdam, Amsterdam, 1971.
6. J. W. DE BARKER and W. P. DE ROEVER, A calculus for recursive program schemes, Automata, languages, and programming (M. Nivat, editor), North-Holland, Amsterdam, 1973.
7. C. C. ELGOT, Monadic computation and iterative algebraic theories, Logic colloquium 1973 (J. C. Shepherdson, editor), Studies in Logic, no. 80, North-Holland, Amsterdam, 1975.
8. Z. ÉSIK and L. BERNÁTSKY, Scott induction and equational proofs, Mathematical foundations of programming semantics '95, Electronic Notes in Theoretical Computer Science, no. 1, 1995.
9. ZOLTÁN ÉSIK, Completeness of park induction, Theoretical Computer Science, to appear.
10. _, Identities in iterative and rational algebraic theories, Comptational Linguistics and Computer Languages, vol. 14 (1980), pp. 183-207.
11. L. L. IVANOV, Algebraic recursion theory, Ellis Horwood Limited, Chichester, 1986.
12. _, Categorial generalization of algebraic recursion theory, Journal of Pure and Applied Algebra, vol. 101 (1995), pp. 91-128.
13. G. KAHN, The semantics of a simple language for parallel programming, Information processing 74 (J. L. Rosenfeld, editor), North-Holland, Amsterdam, 1974.
14. F. W. LAWVERE, Functorial semantics of algebraic theories, Proceedings of the National Academy of Sciences of the United States of America, vol. 50 (1963), pp. 869-872.
15. Z. MANNA and J. VUILLEMIN, Fixpoint approach to the theory of computation, Automata, languages, and programming (M. Nivat, editor), North-Holland, Amsterdam, 1973.
16. R. MILNER, Communication and concurrency, Prentice-Hall, 1989.
17. Y. N. MOSCHOVAKIS, The logic of functional recursion, to appear in Proceedings of the 10th International Congress of Logic, Methodology and the Philosophy of Science, held in Florence, 1995.
18. _, The formal language of recursion, this JOURNAL, vol. 54 (1989), pp. 1216-1252.
19. _, A model of concurrency with fair merge and full recursion, Information and Computation, vol. 93 (1991), pp. 114-171.
20. Y. N. MOSCHOVAKIS and G. T. WHITNEY, Powerdomains, powerstructures, and fairness, Proceedings of computer science logic '94, Kasimierz, Poland (L. Pacholski and J. Tiuryn, editors), Lecture Notes in Computer Science, no. 933, Springer-Verlag, Berlin, 1995, pp. 382-396.
21. D. G. SKORDEV, Computability in combinatory spaces, Kluwer Academic Publishers, Dordrecht, 1992.
22. J. E. STOY, Denotational semantics: The Scott-Strachey approach to programming language theory, MIT Press, Cambridge, MA, 1977.
23. G. T. WHITNEY, Recursion structures for non-determinism and concurrency, Ph.D. thesis, University of California, Los Angeles, 1994.