The complexity of countable categoricity in finite languages

DOI10.1002/malq.201110035zbMath1246.03058arXiv1101.3792OpenAlexW1969902453MaRDI QIDQ3117785

Alexandre A. Ivanov

Publication date: 29 February 2012

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.3792

zbMATH Keywords

index setscountable categoricityEhrenfeucht theories

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Categoricity and completeness of theories (03C35)

Cites Work

• A countably categorical theory which is not \(G\)-compact
• A decidable Ehrenfeucht theory with exactly two hyperarithmetic models
• On generic structures
• GALOIS GROUPS OF FIRST ORDER THEORIES
• On many-sorted ω-categorical theories
• A decidable $ℵ_0$-categorical theory with a non-recursive Ryll-Nardzewski function
• The diameter of a Lascar strong type

This page was built for publication: The complexity of countable categoricity in finite languages