Notes on the Jump of a Structure
From MaRDI portal
Publication:3576069
DOI10.1007/978-3-642-03073-4_38zbMath1268.03043OpenAlexW1578826550MaRDI QIDQ3576069
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
Related Items
Jump inversions of algebraic structures and the \({\Sigma}\)-definability, Boolean algebra approximations, On Processes and Structures, Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders, Punctual 1-linear orders, Unnamed Item, EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER, Jump inversions of algebraic structures and Σ‐definability, THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES, Families of permutations and ideals of Turing degrees, Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey, Enumeration Reducibility and Computable Structure Theory, Cuts of linear orders, CODING IN GRAPHS AND LINEAR ORDERINGS, On a computable presentation of low linear orderings, Computable linear orders and the Ershov hierarchy, Degree Spectra of Relations on a Cone, COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY, Coding and definability in computable structures, Computable presentability of countable linear orders, Computable linear orders and the ershov hierarchy
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
