Coding and definability in computable structures

DOI10.1215/00294527-2017-0032zbMATH Open1455.03056OpenAlexW2800744666WikidataQ129898768 ScholiaQ129898768MaRDI QIDQ1782235FDOQ1782235

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

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

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)

Cites Work

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

Cited In (6)

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

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)