Recursive categoricity and persistence

DOI10.2307/2274066zbMath0631.03018OpenAlexW2068530698MaRDI QIDQ3767330

Terrence Millar

Publication date: 1986

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

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

zbMATH Keywords

recursive modelsrecursively categorical modelrecursively persistent model

Mathematics Subject Classification ID

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

Related Items

Degree spectra and computable dimensions in algebraic structures, The index set of the groups autostable relative to strong constructivizations, A computably categorical structure whose expansion by a constant has infinite computable dimension, Computable isomorphisms of Boolean algebras with operators, Effective categoricity of equivalence structures, Computable isomorphisms, degree spectra of relations, and Scott families, Degree Spectra of Relations on Computable Structures