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

DOI10.4064/FM-98-2-121-125MaRDI QIDQ4149751zbMATH OpenOpenAlexFDO

Authors 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) Categoricity and completeness of theories (03C35) Other degrees and reducibilities in computability and recursion theory (03D30) Other classical first-order model theory (03C68)

Cited in

(6)

• Degrees of Indiscernibles in Decidable Models
• Computing and dominating the Ryll-Nardzewski function
• The complexity of countable categoricity in finite languages
• Autostability of prime models under strong constructivizations
• Bidimensional linear recursive sequences and universality of unambiguous register automata
• Turing degrees of complete formulas of almost prime models

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4149751)