Implicit definability in arithmetic

DOI10.1215/00294527-3507386zbMath1401.03082OpenAlexW2189427865MaRDI QIDQ306821

Stephen G. Simpson

Publication date: 1 September 2016

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1459343729

zbMATH Keywords

arithmetical hierarchyarithmetical singletonshyperarithmetical setsimplicit definabilityTuring jump

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Other degrees and reducibilities in computability and recursion theory (03D30) Interpolation, preservation, definability (03C40) Other Turing degree structures (03D28) Hierarchies of computability and definability (03D55)

Related Items (2)

Classes of Polish spaces under effective Borel isomorphism ⋮ Computability of Subsets of Metric Spaces

Cites Work

• Unnamed Item
• Unnamed Item
• The effective theory of Borel equivalence relations
• There is no ordering on the classes in the generalized high/low hierarchies
• Computable structures and the hyperarithmetical hierarchy
• MASS PROBLEMS AND HYPERARITHMETICITY
• Jump embeddings in the Turing degrees
• Some applications of the notions of forcing and generic sets
• On a Theorem of Lachlan and Martin
• A Property of Arithmetic Sets

This page was built for publication: Implicit definability in arithmetic