scientific article; zbMATH DE number 1302870
zbMATH Open0952.03037MaRDI QIDQ4249356FDOQ4249356
Publication date: 7 January 2001
Title of this publication is not available (Why is that?)
Recommendations
surveycountable modeldecidable theoryindiscerniblesdecidable 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)
Cited In (45)
- Spaces of orders and their Turing degree spectra
- Enumerations in computable structure theory
- Computable trees, prime models, and relative decidability
- Metric structures and probabilistic computation
- Finite computable dimension and degrees of categoricity
- Model-theoretic complexity of automatic structures
- Punctually presented structures I: Closure theorems
- A Note on the Computable Categoricity of $$\ell ^p$$ ℓ p Spaces
- Model Theoretic Complexity of Automatic Structures (Extended Abstract)
- Effective completeness theorems for modal logic
- Effective algebraicity
- New Computational Paradigms
- Computable Heyting algebras with distinguished atoms and coatoms
- Categoricity spectra of computable structures
- A note on decidable categoricity and index sets
- Partial automorphism semigroups
- \(\mathsf{WKL}_0\) and induction principles in model theory
- Categoricity properties for computable algebraic fields
- Degrees that are not degrees of categoricity
- Effective prime uniqueness
- Empiricism, probability, and knowledge of arithmetic: a preliminary defense
- Computable isomorphisms, degree spectra of relations, and Scott families
- Title not available (Why is that?)
- Strength and Weakness in Computable Structure Theory
- Degree spectra of relations on structures of finite computable dimension
- Model completeness and relative decidability
- Computable valued fields
- Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem
- From automatic structures to automatic groups.
- The atomic model theorem and type omitting
- Degree spectra and immunity properties
- Adapting Rabin’s Theorem for Differential Fields
- Effectiveness in RPL, with applications to continuous logic
- The Slaman-Wehner theorem in higher recursion theory
- Degrees of categoricity and the hyperarithmetic hierarchy
- Analytic computable structure theory and $L^p$ spaces
- Turing degrees of nonabelian groups
- A computably categorical structure whose expansion by a constant has infinite computable dimension
- Orders on magmas and computability theory
- Computable embeddings and strongly minimal theories
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Principal numerations of functionals on admissible sets
- Degrees of categoricity of computable structures
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249356)
