Sequences of n-diagrams

DOI10.2178/jsl/1190150160zbMath1035.03015OpenAlexW2106044804MaRDI QIDQ4779662

Valentina S. Harizanov, Andrey S. Morozov, Julia F. Knight

Publication date: 2002

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

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

zbMATH Keywords

Turing reducibilitymodels of Peano arithmeticcountable structurescomputable languages

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (1)

Turing degrees of nonabelian groups

Cites Work

• Generic copies of countable structures
• Possible degrees in recursive copies. II
• Computable structures and the hyperarithmetical hierarchy
• Degrees coded in jumps of orderings
• An undecidable linear order that is \(n\)-decidable for all \(n\)
• Unnamed Item

This page was built for publication: Sequences of n-diagrams