Nonarithmetical ℵ0-categorical theories with recursive models

DOI10.2307/2275253zbMath0804.03021OpenAlexW1980621400MaRDI QIDQ4292596

Julia F. Knight

Publication date: 22 January 1995

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

Full work available at URL: https://doi.org/10.2307/2275253

zbMATH Keywords

approximationsrecursive model\(\aleph_ 0\)-categorical first-order theory

Mathematics Subject Classification ID

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

Related Items (7)

Autostability of prime models under strong constructivizations ⋮ Complexity of Ehrenfeucht models ⋮ A computable ℵ₀-categorical structure whose theory computes true arithmetic ⋮ Recursive models and the divisibility poset ⋮ Building models of strongly minimal theories ⋮ The degrees of categorical theories with recursive models ⋮ Computing and dominating the Ryll-Nardzewski function

This page was built for publication: Nonarithmetical ℵ₀-categorical theories with recursive models