First-order theory of the degrees of recursive unsolvability

DOI10.2307/1971028zbMATH Open0349.02035OpenAlexW2016487828WikidataQ56430704 ScholiaQ56430704MaRDI QIDQ1234682FDOQ1234682

Authors: Stephen G. Simpson 

Publication date: 1977

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1971028

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (29)

• Undecidability and initial segments of the (r.e.) tt-degrees
• Forcing and reductibilities. II. Forcing in fragments of analysis
• MASS PROBLEMS AND HYPERARITHMETICITY
• ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS
• Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes
• Definable degrees and automorphisms of 𝒟
• Not every finite lattice is embeddable in the recursively enumerable degrees
• The relationship between local and global structure in the enumeration degrees
• Embedding and coding below a 1-generic degree
• Fragments of the theory of the enumeration degrees
• Interpreting true arithmetic in the \(\Delta_2^0\)-enumeration degrees
• The theory of the \(\alpha \) degrees is undecidable
• The enumeration degrees: local and global structural interactions
• The \(\Delta ^0_2\) Turing degrees: automorphisms and definability
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
• Coding true arithmetic in the Medvedev and Muchnik degrees
• Degree Structures: Local and Global Investigations
• The First Order Theories of the Medvedev and Muchnik Lattices
• Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond
• Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\)
• On homogeneity and definability in the first-order theory of the Turing degrees
• Degrees of unsolvability of continuous functions
• Initial segments of the degrees of size \(\aleph _ 1\)
• The theory of ceers computes true arithmetic
• The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures
• The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility
• The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
• The jump is definable in the structure of the degrees of unsolvability

This page was built for publication: First-order theory of the degrees of recursive unsolvability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1234682)