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;.

Categories

Keywords

Reprint years

DOI

10.2307/2271106

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,667

External links

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

Through your library

My notes

Similar books and articles

A note on universal sets.A. H. Lachlan - 1966 - Journal of Symbolic Logic 31 (4):573-574.
A non-splitting theorem for d.r.e. sets.Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (1):17-96.
On the complexity-relativized strong reducibilities.Jari Talja - 1982 - Bulletin of the Section of Logic 11 (1-2):77-78.
Combinatorial and recursive aspects of the automorphism group of the countable atomless Boolean algebra.E. W. Madison & B. Zimmermann-Huisgen - 1986 - Journal of Symbolic Logic 51 (2):292-301.
is a set B with Boolean operations a∨ b (join), a∧ b (meet) and− a (complement), partial ordering a≤ b defined by a∧ b= a and the smallest and greatest element, 0 and 1. By Stone's Representation Theorem, every Boolean algebra is isomorphic to an algebra of subsets of some nonempty set S, under operations a∪ b, a∩ b, S− a, ordered by inclusion, with 0=∅. [REVIEW]Mystery Of Measurability - 2006 - Bulletin of Symbolic Logic 12 (2).
Every polynomial-time 1-degree collapses if and only if P = PSPACE.Stephen A. Fenner, Stuart A. Kurtz & James S. Royer - 2004 - Journal of Symbolic Logic 69 (3):713-741.
On primitive recursive permutations and their inverses.Frank B. Cannonito & Mark Finkelstein - 1969 - Journal of Symbolic Logic 34 (4):634-638.
Myhill's work in recursion theory.J. C. E. Dekker & E. Ellentuck - 1992 - Annals of Pure and Applied Logic 56 (1-3):43-71.
Uniform Density in Lindenbaum Algebras.V. Yu Shavrukov & Albert Visser - 2014 - Notre Dame Journal of Formal Logic 55 (4):569-582.
On the logic of conscious belief.Marek Tokarz - 1990 - Studia Logica 49 (3):321 - 332.

Analytics

Added to PP
2009-01-28

Downloads
32 (#711,554)

6 months
6 (#879,768)

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