Coding and definability in computable structures

DOI10.1215/00294527-2017-0032MaRDI QIDQ1782235zbMATH OpenOpenAlexWikidataFDO

Authors Antonio Montalbán

Publication date 19 September 2018

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

Full work available at URL https://projecteuclid.org/euclid.ndjfl/1525140052, https://semanticscholar.org/paper/151e20e67d079c4a2cfed33831802140afaf3ec7

zbMATH Keywords

computable structure theoryback-and-forth relations

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Recommendations

• scientific article; zbMATH DE number 2063217
• Isomorphisms and definable relations on computable models
• scientific article; zbMATH DE number 2047478
• A journey to computably enumerable structures (tutorial lectures)
• Enumeration reducibility and computable structure theory

Cites work

• scientific article; zbMATH DE number 1302876 (Why is no real title available?)
• scientific article; zbMATH DE number 5049507 (Why is no real title available?)
• A Jump Inversion Theorem for the Degree Spectra
• A certain reducibility on admissible sets
• Arithmetical Reducibilities I
• Boolean algebras, Stone spaces, and the iterated Turing jump
• Computable Boolean algebras
• Computable structures and the hyperarithmetical hierarchy
• Counting the back-and-forth types
• Counting the number of equivalence classes of Borel and coanalytic equivalence relations
• Degrees coded in jumps of orderings
• Degrees of Structures
• Descriptive set theory
• Every Low 2 Boolean Algebra has a Recursive Copy
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• Notes on the Jump of a Structure
• On the $n$-back-and-forth types of Boolean algebras
• The jump operation for structure degrees
• Δ 2 0 -copies of linear orderings

Cited in

(6)

• scientific article; zbMATH DE number 1998343 (Why is no real title available?)
• On propositional coding techniques for the distinguishability of objects in finite sets
• Codes and sofic constraints
• A modal Θ-valent approach of the notion of code
• Measuring complexities of classes of structures
• scientific article; zbMATH DE number 5000345 (Why is no real title available?)

This page was built for publication: Coding and definability in computable structures

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