Book contents
- Frontmatter
- Contents
- Introduction
- Colloquium Program
- TUTORIAL
- RESEARCH ARTICLES
- Indestructibility and strong compactness
- Some applications of regularmarkers
- Has the continuumhypothesis been settled?
- Geometry of interaction IV: the feedback equation
- On local modularity in homogeneous structures
- Descriptive set theory and uncountable model theory
- Decidable properties of logical calculi and of varieties of algebras
- Stabilization — an alternative to double-negation translation for classical natural deduction
- Definability and reducibility in higher types over the reals
- Predicativity problems in point-free topology
- Rank inequalities in the theory of differentially closed fields
- Consistency and games— in search of new combinatorial principles
- Realizability for constructive Zermelo-Fraenkel set theory
- On long EF-equivalence in non-isomorphic models
- The theory of is undecidable
- Cocovering and set forcing
- References
The theory of is undecidable
from RESEARCH ARTICLES
Published online by Cambridge University Press: 30 March 2017
Book contents
- Frontmatter
- Contents
- Introduction
- Colloquium Program
- TUTORIAL
- RESEARCH ARTICLES
- Indestructibility and strong compactness
- Some applications of regularmarkers
- Has the continuumhypothesis been settled?
- Geometry of interaction IV: the feedback equation
- On local modularity in homogeneous structures
- Descriptive set theory and uncountable model theory
- Decidable properties of logical calculi and of varieties of algebras
- Stabilization — an alternative to double-negation translation for classical natural deduction
- Definability and reducibility in higher types over the reals
- Predicativity problems in point-free topology
- Rank inequalities in the theory of differentially closed fields
- Consistency and games— in search of new combinatorial principles
- Realizability for constructive Zermelo-Fraenkel set theory
- On long EF-equivalence in non-isomorphic models
- The theory of is undecidable
- Cocovering and set forcing
- References
- Type
- Chapter
- Information
- Logic Colloquium '03 , pp. 326 - 344Publisher: Cambridge University PressPrint publication year: 2006
References
and (editors) [1999], Recursion theory and complexity, proceedings of the Kazan '97 workshop, Walter de Gruyter, Berlin.
and [1928], Zum Entscheidungsproblem der mathematischen Logik, Mathematische Annalen, vol. 99, pp. 342–372.Google Scholar
, , and [1997], The classical decision problem, Springer, Berlin.
[1979], Degrees of unsolvability: Structure and theory, Lecture Notes in Mathematics, vol. 759, Springer-Verlag, Berlin.
[1957], Two recursively enumerable sets of incomparable degrees of unsolvability, Proceedings of the National Academy of Sciences, vol. 43, pp. 236–238.Google Scholar
and [1982], The undecidability of the recursively enumerable degrees (research announcement), American Mathematical Society. Bulletin. New Series, vol. 6, pp. 79–80.Google Scholar
and [1991], Jump embeddings in the Turing degrees, The Journal of Symbolic Logic, vol. 56, pp. 563–591.Google Scholar
, Jr. and [1983], Pseudojump operators. I. The r.e. case, Transactions of the American Mathematical Society, vol. 275, pp. 599–609.Google Scholar
, Jr. and [1993], On the theory of the upper semilattice of Turing degrees, The Journal of Symbolic Logic, vol. 58, pp. 193–204.Google Scholar
, Jr. and [1972], π classes and degrees of theories, Transactions of the American Mathematical Society, vol. 173, pp. 33–56.Google Scholar
and [1954], The upper semi-lattice of degrees of recursive unsolvability, Annals of Mathematics. Second Series, vol. 59, pp. 379–407.Google Scholar
[1966], The impossibility of finding relative complements for recursively enumerable degrees, The Journal of Symbolic Logic, vol. 31, pp. 434–454.Google Scholar
[1968], Distributive initial segments of the degrees of unsolvability, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 14, pp. 457–472.Google Scholar
and [1996], The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations, Advances in Mathematics, vol. 120, pp. 1–142.Google Scholar
, , and [1998], The π3-theory of the computably enumerable Turing degrees is undecidable, Transactions of the American Mathematical Society, vol. 350, pp. 2719–2736.Google Scholar
[1971], Initial segments of the degrees of unsolvability, Annals of Mathematics. Second Series, vol. 93, pp. 365–389.Google Scholar
[1983], Degrees of unsolvability, Springer-Verlag, Berlin.
[1985], On the ordering of classes in high/low hierarchies,Recursion theory week (Oberwolfach, 1984) (,, editors), Lecture Notes in Mathematics, vol. 1141, Springer, Berlin, pp. 260–270.
[2000], Anecessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees, Annals of Pure and Applied Logic, vol. 101, pp. 275–297.Google Scholar
and [1988], Decidability and invariant classes for degree structures, Transactions of the American Mathematical Society, vol. 310, pp. 669–692.Google Scholar
, , and [1984], The elementary theory of the recursively enumerable degrees is not N0-categorical, Advances in Mathematics, vol. 53, pp. 301–320.Google Scholar
, , and [2004], The ∀ ∃ theory of R(∠, ∨, ∧) is undecidable, Transactions of the American Mathematical Society, vol. 356, pp. 3025–3067.Google Scholar
[1961], Recursive unsolvability of Post's problem of tag and other topics in the theory of Turing machines, Annals of Mathematics, vol. 74, pp. 437–454.Google Scholar
[2003], Embedding jump upper semilattices into the Turing degrees, The Journal of Symbolic Logic, vol. 68, pp. 989–1014.Google Scholar
[2004], There is no ordering on the classes in the generalized high/low hierarchy, Archive for Mathematical Logic, to appear.
[1956], On the unsolvability of the problem of reducibility in the theory of algorithms, Doklady Akademii Nauk SSSR. New Series, vol. 108, pp. 29–32.Google Scholar
and [1997], Logic for applications, 2nd ed., Springer, New York.
, , and [1998], Interpretability and definability in the recursively enumerable degrees, Proceedings of the London Mathematical Society. Third Series, vol. 77, pp. 241–291.Google Scholar
[1977], High degrees, Ph.D. thesis, Univeristy of California, Berkeley.
[1930], On a problem of formal logic, Proceedings of the London Mathematical Society. Second Series, vol. 30, pp. 338–384.Google Scholar
[1963], Recursive enumerability and the jump operator, Transactions of the American Mathematical Society, vol. 108, pp. 223–239.Google Scholar
[1964], The recursively enumerable degrees are dense, Annals of Mathematics. Second Series, vol. 80, pp. 300–312.Google Scholar
and [1963], Computability of recursive functions, Journal of the Association for Computing Machinery, vol. 10, pp. 217–255.Google Scholar
[1978], On the ∀ ∃ sentences of ∝recursion theory,Generalized recursion theory II (, , and , editors), Studies in Logic and the Foundations of Mathematics, vol. 94, North-Holland, Amsterdam, pp. 331–354.
[1981], The theory of the degrees below 0, Journal of the London Mathematical Society, vol. 24, pp. 1–14.Google Scholar
[1999], The recursively enumerable degrees,Handbook of computability theory (, editor), Studies in Logic and the Foundations of Mathematics, vol. 140, North- Holland, Amsterdam, pp. 169–197.
and [1999], Defining the Turing jump,Mathematical Research Letters, vol. 6, pp. 711–722.Google Scholar
[1977], First order theory of the degrees of recursive unsolvability, Annals of Mathematics. Second Series, vol. 105, pp. 121–139.Google Scholar
and [2001], Extension of embeddings in the computably enumerable degrees, Annals of Mathematics, vol. 153, pp. 1–43.Google Scholar
and [1989], Complementation in the Turing degrees, The Journal of Symbolic Logic, vol. 54, pp. 160–176.Google Scholar
[1987], Recursively enumerable sets and degrees, Springer-Verlag, Berlin.
[1956], Ondegrees of recursive unsolvability, Annals ofMathematics. Second Series, vol. 64, pp. 581–592.Google Scholar