Notes on the Jump of a Structure

DOI10.1007/978-3-642-03073-4_38MaRDI QIDQ3576069zbMATH OpenOpenAlexFDO

Authors 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

Computable structure theory, computable model theory (03C57)

Cites work

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

Cited in

(28)

• 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
• Degree spectra of relations on a cone
• On the notion of jump structure
• Jump inversions of algebraic structures and Σ‐definability
• CODING IN GRAPHS AND LINEAR ORDERINGS
• On processes and structures
• Computable functors and effective interpretability
• On the structure of Skipjack
• Punctual 1-linear orders
• EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER
• THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES
• Families of permutations and ideals of Turing degrees
• Cuts of linear orders
• Ivan Soskov: a life in computability
• On a computable presentation of low linear orderings
• Low scattered linear orders
• The coding theorems for linear orders
• Permutation groups and ideals of Turing degrees
• The structural complexity of models of arithmetic
• A low scattered linear order of rank 2 without computable copy

This page was built for publication: Notes on the Jump of a Structure

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