scientific article; zbMATH DE number 1302870
From MaRDI portal
Publication:4249356
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)
Recommendations
Cited in
(51)- 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
- Model-theoretic complexity of automatic structures
- Finite computable dimension and degrees of categoricity
- A computable structure with non-standard computability
- A Note on the Computable Categoricity of $$\ell ^p$$ ℓ p Spaces
- Model Theoretic Complexity of Automatic Structures (Extended Abstract)
- Punctually presented structures I: Closure theorems
- Effective completeness theorems for modal logic
- Strength and weakness in computable structure theory
- Effective algebraicity
- Analytic computable structure theory and \(L^p\) spaces
- Categoricity spectra of computable structures
- New Computational Paradigms
- A note on decidable categoricity and index sets
- Computable Heyting algebras with distinguished atoms and coatoms
- Partial automorphism semigroups
- \(\mathsf{WKL}_0\) and induction principles in model theory
- Adapting Rabin's theorem for differential fields
- Degrees that are not degrees of categoricity
- Categoricity properties for computable algebraic fields
- Empiricism, probability, and knowledge of arithmetic: a preliminary defense
- Effective prime uniqueness
- Computable isomorphisms, degree spectra of relations, and Scott families
- On decidable and computable models of theories
- scientific article; zbMATH DE number 1534487 (Why is no real title available?)
- Degree spectra of relations on structures of finite computable dimension
- Computable valued fields
- Computability and computable models
- Model completeness and relative decidability
- From automatic structures to automatic groups.
- The atomic model theorem and type omitting
- Computable Models
- Degree spectra and immunity properties
- Effectiveness in RPL, with applications to continuous logic
- Effective metric model theory
- The Slaman-Wehner theorem in higher recursion theory
- Degrees of categoricity and the hyperarithmetic hierarchy
- Turing degrees of nonabelian groups
- A computably categorical structure whose expansion by a constant has infinite computable dimension
- Orders on magmas and computability theory
- Principal numerations of functionals on admissible sets
- Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
- Computable embeddings and strongly minimal theories
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Degrees of categoricity of computable structures
- scientific article; zbMATH DE number 1390025 (Why is no real title available?)
- scientific article; zbMATH DE number 1405578 (Why is no real title available?)
- Spectra of computable models for Ehrenfeucht theories
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)
