Authors
Kevin Davey
University of Chicago
Abstract
In [7] and [8], it is established that given any abstract countable structure S and a relation R on S, then as long as S has a recursive copy satisfying extra decidability conditions, R will be ∑0α on every recursive copy of S iff R is definable in S by a special type of infinitary formula, a ∑rα() formula. We generalize the typ e of constructions of these papers to produce conditions under which, given two disjoint relations R1 and R2 on S, there is a recursive copy of S in which R1 and R2 are 0α inseparable. We then apply these theorems to specific everyday structures such as linear orderings, boolean algebras andvector spaces
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/0168-0072(94)90046-9
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 69,114
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Pairs of Recursive Structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Stability of Recursive Structures in Arithmetical Degrees.C. J. Ash - 1986 - Annals of Pure and Applied Logic 32:113-135.
Categoricity in Hyperarithmetical Degrees.C. J. Ash - 1987 - Annals of Pure and Applied Logic 34 (1):1-14.
Intrinsically Gs;0alpha; Relations.E. Barker - 1988 - Annals of Pure and Applied Logic 39 (2):105-130.
Pairs of Computable Structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.

View all 9 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Undecidability and Recursive Inseparability.Raymond M. Smullyan - 1958 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 4 (7-11):143-147.
Possible Degrees in Recursive Copies.C. J. Ash & J. F. Knight - 1995 - Annals of Pure and Applied Logic 75 (3):215-221.
Possible Degrees in Recursive Copies II.C. J. Ash & J. F. Knight - 1997 - Annals of Pure and Applied Logic 87 (2):151-165.
Thought Insertion and the Inseparability Thesis.Paul J. Gibbs - 2000 - Philosophy, Psychiatry, and Psychology 7 (3):195-202.
Graph Coloring and Reverse Mathematics.James H. Schmerl - 2000 - Mathematical Logic Quarterly 46 (4):543-548.
Recursive Inseparability for Residual Bounds of Finite Algebras.Ralph McKenzie - 2000 - Journal of Symbolic Logic 65 (4):1863-1880.
Effective Coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.

Analytics

Added to PP index
2014-01-16

Total views
9 ( #947,503 of 2,499,269 )

Recent downloads (6 months)
1 ( #418,195 of 2,499,269 )

How can I increase my downloads?

Downloads

My notes