Constructive order types on cuts

Journal of Symbolic Logic 34 (2):285-289 (1969)
  Copy   BIBTEX

Abstract

If A and B are subsets of natural numbers we say that A is recursively equivalent to B (denoted A ≃ B) if there is a one-one partial recursive function which maps A onto B, and that A is recursively isomorphic to B (denoted A ≅ B) if there is a one-one total recursive function which maps A onto B and Ā (the complement of A) onto B#x00AF;.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Type two cuts, bad cuts and very bad cuts.Renling Jin - 1997 - Journal of Symbolic Logic 62 (4):1241-1252.
Constructive order types, II.John N. Crossley - 1966 - Journal of Symbolic Logic 31 (4):525-538.
Constructive order types.John N. Crossley - 1969 - London,: North-Holland Pub. Co..
Syntactic calculus with dependent types.Aarne Ranta - 1998 - Journal of Logic, Language and Information 7 (4):413-431.
Normal derivations and sequent derivations.Mirjana Borisavljevi - 2008 - Journal of Philosophical Logic 37 (6):521 - 548.
A problem in the theory of constructive order types.Robin O. Gandy & Robert I. Soare - 1970 - Journal of Symbolic Logic 35 (1):119-121.

Analytics

Added to PP
2009-01-28

Downloads
25 (#614,662)

6 months
11 (#226,803)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references