scientific article; zbMATH DE number 1302870
From MaRDI portal
Publication:4249356
zbMath0952.03037MaRDI QIDQ4249356
Publication date: 7 January 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveydecidable theorycountable modelindiscerniblesdecidable saturated modeldecidable homogeneous modeldecidable prime modeleffective omitting types theorem
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Models with special properties (saturated, rigid, etc.) (03C50) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Model theory of denumerable and separable structures (03C15)
Related Items (39)
Degree spectra of relations on structures of finite computable dimension ⋮ Finite computable dimension and degrees of categoricity ⋮ Effective completeness theorems for modal logic ⋮ Turing degrees of nonabelian groups ⋮ Degrees that are not degrees of categoricity ⋮ A Note on the Computable Categoricity of $$\ell ^p$$ ℓ p Spaces ⋮ Degrees of categoricity of computable structures ⋮ Computable valued fields ⋮ Orders on magmas and computability theory ⋮ Effective algebraicity ⋮ Effective prime uniqueness ⋮ Model Theoretic Complexity of Automatic Structures (Extended Abstract) ⋮ Computable Heyting algebras with distinguished atoms and coatoms ⋮ Punctually presented structures I: Closure theorems ⋮ A note on decidable categoricity and index sets ⋮ Model-theoretic complexity of automatic structures ⋮ Effectiveness in RPL, with applications to continuous logic ⋮ Spaces of orders and their Turing degree spectra ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ Degrees of categoricity and the hyperarithmetic hierarchy ⋮ Strength and Weakness in Computable Structure Theory ⋮ Analytic computable structure theory and $L^p$ spaces ⋮ The Slaman-Wehner theorem in higher recursion theory ⋮ A computably categorical structure whose expansion by a constant has infinite computable dimension ⋮ Empiricism, probability, and knowledge of arithmetic: a preliminary defense ⋮ Metric structures and probabilistic computation ⋮ From automatic structures to automatic groups. ⋮ Partial automorphism semigroups ⋮ Categoricity spectra of computable structures ⋮ Computable trees, prime models, and relative decidability ⋮ Model completeness and relative decidability ⋮ Adapting Rabin’s Theorem for Differential Fields ⋮ FOUNDATIONS OF ONLINE STRUCTURE THEORY ⋮ The atomic model theorem and type omitting ⋮ Degree spectra and immunity properties ⋮ Computable isomorphisms, degree spectra of relations, and Scott families ⋮ Categoricity properties for computable algebraic fields ⋮ Enumerations in computable structure theory ⋮ \(\mathsf{WKL}_0\) and induction principles in model theory
This page was built for publication:
