Notes on the Jump of a Structure

DOI10.1007/978-3-642-03073-4_38zbMath1268.03043MaRDI QIDQ3576069

Antonio Montalbán

Publication date: 28 July 2010

Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_38

Mathematics Subject Classification ID

03C57: Computable structure theory, computable model theory

Related Items

Degree Spectra of Relations on a Cone, Unnamed Item, Jump inversions of algebraic structures and Σ‐definability, CODING IN GRAPHS AND LINEAR ORDERINGS, On Processes and Structures, COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY, Punctual 1-linear orders, EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER, Cuts of linear orders, On a computable presentation of low linear orderings, Jump inversions of algebraic structures and the \({\Sigma}\)-definability, Computable linear orders and the Ershov hierarchy, Coding and definability in computable structures, Computable presentability of countable linear orders, Computable linear orders and the ershov hierarchy, Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders, Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey, Enumeration Reducibility and Computable Structure Theory, Boolean algebra approximations

Cites Work

• Cuts of linear orders
• Generic copies of countable structures
• Computable structures and the hyperarithmetical hierarchy
• Enumerations in computable structure theory
• Computable Boolean algebras
• On the $n$-back-and-forth types of Boolean algebras
• Intrinsic bounds on complexity and definability at limit levels
• A construction for recursive linear orderings
• Orderings with αth Jump Degree 0 (α)
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• Every Low 2 Boolean Algebra has a Recursive Copy
• Effective model theory vs. recursive model theory