Invariant Constructions of Simple and Maximal Sets

Mathematical Logic Quarterly 41 (2):143-160 (1995)
  Copy   BIBTEX

Abstract

The main results of the present paper are the following theorems: 1. There is no e ∈ ω such that for any A, B ⊆ ω, SA = Wmath image is simple in A, and if A′ [TRIPLE BOND]TB′, then SA =* SB. 2 There is an e ∈ ω such that for any A, B ⊆ ω, MA = We is incomplete maximal in A, and if A =* B, then MA [TRIPLE BOND]TMB

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

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

On Some Complexity Characteristics of Immune Sets.Valeriy K. Bulitko - 1995 - Mathematical Logic Quarterly 41 (3):307-313.
Computing maximal chains.Alberto Marcone, Antonio Montalbán & Richard A. Shore - 2012 - Archive for Mathematical Logic 51 (5-6):651-660.
A cohesive set which is not high.Carl Jockusch & Frank Stephan - 1993 - Mathematical Logic Quarterly 39 (1):515-530.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Automorphisms with only infinite orbits on non-algebraic elements.Grégory Duby - 2003 - Archive for Mathematical Logic 42 (5):435-447.
The dense simple sets are orbit complete with respect to the simple sets.Peter Cholak - 1998 - Annals of Pure and Applied Logic 94 (1-3):37-44.
Some New Lattice Constructions in High R. E. Degrees.Heinrich Rolletschek - 1995 - Mathematical Logic Quarterly 41 (3):395-430.
Promptness Does Not Imply Superlow Cuppability.David Diamondstone - 2009 - Journal of Symbolic Logic 74 (4):1264 - 1272.

Analytics

Added to PP
2013-12-01

Downloads
7 (#1,201,127)

6 months
1 (#1,040,386)

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

Add more references