scientific article; zbMATH DE number 1302870
countable modeldecidable homogeneous modeldecidable prime modeldecidable saturated modeldecidable theoryeffective omitting types theoremindiscerniblessurvey
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Model theory of denumerable and separable structures (03C15) Models with special properties (saturated, rigid, etc.) (03C50) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Model-theoretic notions and theorems are discussed from the point of view of computability theory. The author deals with effective omitting types theorem; decidable theories with decidable prime models, with decidable saturated and with decidable homogeneous models; decidable theories with only finitely many and with only countably many, non-isomorphic countable models; indiscernibles. A survey of the computability-theoretic and model-theoretic background is given, thus making the exposition self-contained. For the entire collection see [Zbl 0905.03001].
- Computable isomorphisms, degree spectra of relations, and Scott families
- Degree spectra of relations on structures of finite computable dimension
- Finite computable dimension and degrees of categoricity
- Computable valued fields
- Effective completeness theorems for modal logic
- Effective algebraicity
- Degrees of categoricity and the hyperarithmetic hierarchy
- From automatic structures to automatic groups.
- Categoricity spectra of computable structures
- Model completeness and relative decidability
- A note on decidable categoricity and index sets
- Empiricism, probability, and knowledge of arithmetic: a preliminary defense
- \(\mathsf{WKL}_0\) and induction principles in model theory
- Enumerations in computable structure theory
- Degrees of categoricity of computable structures
- Strength and weakness in computable structure theory
- The Slaman-Wehner theorem in higher recursion theory
- Degrees that are not degrees of categoricity
- Adapting Rabin's theorem for differential fields
- A Note on the Computable Categoricity of \ell ^p ℓ p Spaces
- Computable trees, prime models, and relative decidability
- Degree spectra and immunity properties
- Computability and computable models
- Model Theoretic Complexity of Automatic Structures (Extended Abstract)
- Spectra of computable models for Ehrenfeucht theories
- The atomic model theorem and type omitting
- scientific article; zbMATH DE number 1534487 (Why is no real title available?)
- Orders on magmas and computability theory
- Effective prime uniqueness
- Analytic computable structure theory and L^p spaces
- A computably categorical structure whose expansion by a constant has infinite computable dimension
- scientific article; zbMATH DE number 1390025 (Why is no real title available?)
- scientific article; zbMATH DE number 1405578 (Why is no real title available?)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- A computable structure with non-standard computability
- Categoricity properties for computable algebraic fields
- Turing degrees of nonabelian groups
- On decidable and computable models of theories
- Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
- Computable Models
- Metric structures and probabilistic computation
- Computable embeddings and strongly minimal theories
- New Computational Paradigms
- Effective metric model theory
- Computable Heyting algebras with distinguished atoms and coatoms
- Punctually presented structures I: Closure theorems
- Model-theoretic complexity of automatic structures
- Effectiveness in RPL, with applications to continuous logic
- Spaces of orders and their Turing degree spectra
- Complexity estimates for theories of some classes of prime models
- The Tarski-Lindenbaum algebra of the class of strongly constructivizable models with -stable theories
- Universal Boolean algebras with applications to semantic classes of models
- On a computability-theoretic approach to Boolean-valued models
- Weihrauch complexity for elementary embeddings into countable saturated models
- On computability-theoretic universality of Boolean-valued models
- Principal numerations of functionals on admissible sets
- Partial automorphism semigroups
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)
