A decidable $ℵ_0$-categorical theory with a non-recursive Ryll-Nardzewski function

DOI10.4064/FM-98-2-121-125zbMath0372.02025OpenAlexW888331534MaRDI QIDQ4149751

James H. Schmerl

Publication date: 1978

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/215097

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Other degrees and reducibilities in computability and recursion theory (03D30) Categoricity and completeness of theories (03C35) Other classical first-order model theory (03C68)

Related Items (5)

Autostability of prime models under strong constructivizations ⋮ Degrees of Indiscernibles in Decidable Models ⋮ Turing degrees of complete formulas of almost prime models ⋮ The complexity of countable categoricity in finite languages ⋮ Computing and dominating the Ryll-Nardzewski function

This page was built for publication: A decidable $ℵ_0$-categorical theory with a non-recursive Ryll-Nardzewski function