Precomplete equivalence relations in dominical categories-Reference-Cited by-同舟云学术

Precomplete equivalence relations in dominical categories

Published:1986 Issue:1 Volume:98 Page:124-134
ISSN:0002-9939
Container-title:Proceedings of the American Mathematical Society
language:en
Short-container-title:Proc. Amer. Math. Soc.

Author:

Bernardi Claudio

Abstract

In this paper precomplete equivalence relations are introduced in dominical and recursion categories. After recalling definitions in § 2 \S 2 , in § 3 \S 3 an analogue of Eršov’s Fixed Point Theorem is proved, as well as the recursive inseparability of two disjoint (unions of) equivalence classes. In § 4 \S 4 "morphisms" between equivalence relations are discussed, while § 5 \S 5 is devoted to the construction of an example (a new characterization of precomplete equivalence relations is also supplied in Lemma 5).

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/proc/1986-098-01/S0002-9939-1986-0848889-9/S0002-9939-1986-0848889-9.pdf

Reference8 articles.

1. Equivalence relations induced by extensional formulae: classification by means of a new fixed point property;Bernardi, Claudio;Fund. Math.,1984

2. Classifying positive equivalence relations;Bernardi, Claudio;J. Symbolic Logic,1983

3. Creativity and effective inseparability in dominical categories;Di Paola, Robert,1985

4. R. A. Di Paola and A. Heller, Dominical categories, J. Symbolic Logic (to appear).

5. Dominical categories and recursion theory;Heller, Alex,1985

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An existence theorem for recursion categories;Journal of Symbolic Logic;1990-09