Computing and dominating the Ryll-Nardzewski function

DOI10.1007/s10469-014-9280-yzbMath1323.03038OpenAlexW2011564546MaRDI QIDQ2342310

Yanyan Li

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-9280-y

zbMATH Keywords

countably categorical theoryRyll-Nardzewski functioncomplexity of function

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable structures and the hyperarithmetical hierarchy
• Countable retracing functions and \(\Pi_2^0\) predicates
• The degrees of categorical theories with recursive models
• Äquivalenzklassen von n‐Tupeln
• A computable ℵ₀-categorical structure whose theory computes true arithmetic
• Ulm's Theorem for Partially Ordered Structures Related to Simply Presented Abelian p-Groups
• A decidable $ℵ_0$-categorical theory with a non-recursive Ryll-Nardzewski function
• Nonarithmetical ℵ₀-categorical theories with recursive models

This page was built for publication: Computing and dominating the Ryll-Nardzewski function