Computability of Fraïssé limits

DOI10.2178/jsl/1294170990zbMath1215.03053OpenAlexW2009212476MaRDI QIDQ3083128

Antonio Montalbán, Russell G. Miller, Barbara F. Csima, Valentina S. Harizanov

Publication date: 18 March 2011

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1294170990

zbMATH Keywords

ageamalgamation propertiescomputable model theoryFraïssé limitsdegree spectra

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (6)

Scott ranks of models of a theory ⋮ Countably categorical theories ⋮ Martin-Löf randomness, invariant measures and countable homogeneous structures ⋮ Some new computable structures of high rank ⋮ Hanf number for Scott sentences of computable structures ⋮ Effective metric model theory

Cites Work

• Unnamed Item
• Degrees of orderings not isomorphic to recursive linear orderings
• Uncountable degree spectra
• Computable isomorphisms, degree spectra of relations, and Scott families
• Computable structures and the hyperarithmetical hierarchy
• Degree spectra and computable dimensions in algebraic structures
• Enumerations in computable structure theory
• Relations Intrinsically Recursive in Linear Orders
• Degrees coded in jumps of orderings
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees
• The Complexity of intrinsically r.e. subsets of existentially decidable models

This page was built for publication: Computability of Fraïssé limits