Effective model theory vs. recursive model theory
From MaRDI portal
Publication:5753942
DOI10.2307/2274481zbMath0722.03030OpenAlexW2039687554MaRDI QIDQ5753942
Publication date: 1990
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274481
algorithmic complexityeffective stabilityeffective model theoryeffective categoricitycomplexity of modelsrecursive model theoryrecursive categoricityrecursive stabilityeffectiveness in model theory
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Model-theoretic forcing (03C25)
Related Items (45)
Degrees of autostability for prime Boolean algebras ⋮ Degrees of autostability relative to strong constructivizations for Boolean algebras ⋮ Computable dimension for ordered fields ⋮ 2011 North American Annual Meeting of the Association for Symbolic Logic ⋮ A robuster Scott rank ⋮ AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ There is no classification of the decidably presentable structures ⋮ Generalized hyperarithmetical computability over structures ⋮ On functors enumerating structures ⋮ On λ-Definable Functions on Ordinals ⋮ Another Jump Inversion Theorem for Structures ⋮ Effective categoricity for distributive lattices and Heyting algebras ⋮ Rice sequences of relations ⋮ Preserving categoricity and complexity of relations ⋮ Computable ideals in \(I\)-algebras ⋮ Unnamed Item ⋮ On the complexity of the theory of a computably presented metric structure ⋮ Degrees of relative computable categoricity ⋮ Relatively intrinsically computable relations on Boolean algebras with a distinguished set of atoms ⋮ Complexity profiles and generic Muchnik reducibility ⋮ Effectively Existentially-Atomic Structures ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Strong degrees of categoricity and weak density ⋮ A Note on Effective Categoricity for Linear Orderings ⋮ 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000 ⋮ Independence in computable algebra ⋮ Computability-theoretic categoricity and Scott families ⋮ Degree Spectra of Relations on a Cone ⋮ Notes on the Jump of a Structure ⋮ COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY ⋮ DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS ⋮ 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06 ⋮ Effective categoricity of equivalence structures ⋮ A computably stable structure with no Scott family of finitary formulas ⋮ Degrees of autostability relative to strong constructivizations ⋮ Categoricity spectra of computable structures ⋮ Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension ⋮ Categoricity and complexity of relations over algebraic structures ⋮ Conservative Extensions of Abstract Structures ⋮ Effective categoricity of abelian \(p\)-groups ⋮ COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$ ⋮ On bi-embeddable categoricity of algebraic structures ⋮ Relativizing computable categoricity ⋮ Enumerations in computable structure theory ⋮ \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
Cites Work
This page was built for publication: Effective model theory vs. recursive model theory
