Computability-theoretic properties of injection structures

DOI10.1007/s10469-014-9270-0zbMath1323.03045OpenAlexW2039358839MaRDI QIDQ2342300

Douglas Cenzer, Jeffery B. Remmel, Valentina S. Harizanov

Publication date: 11 May 2015

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-014-9270-0

zbMATH Keywords

permutationscomputability theorycomputable model theoryinjectionseffective categoricity

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28) Categoricity and completeness of theories (03C35)

Related Items

Generically and coarsely computable isomorphisms, The isomorphism problem for FST injection structures, Computable isomorphisms for certain classes of infinite graphs, Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting), On decidable categoricity and almost prime models, Injection Structures Specified by Finite State Transducers, Computability-theoretic categoricity and Scott families, Categoricity spectra of computable structures, Classifications of definable subsets, Complexity and categoricity of injection structures induced by finite state transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures
• Computable structures and the hyperarithmetical hierarchy
• Degrees of categoricity and the hyperarithmetic hierarchy
• Effective categoricity of equivalence structures
• Degrees of categoricity of computable structures
• Equivalence structures and isomorphisms in the difference hierarchy
• d-computable categoricity for algebraic fields