Foundations of recursive model theory
From MaRDI portal
Cited in
(29)- Recursive categoricity and recursive stability
- A totally transcendental decidable theory without constructivizable homogeneous models
- On the effective content of asymptotic verifications of Edgeworth's Conjecture
- Some effects of Ash-Nerode and other decidability conditions on degree spectra
- \(\mathsf{WKL}_0\) and induction principles in model theory
- Degrees of autostability relative to strong constructivizations
- Decidable models of small theories
- Some Questions in Computable Mathematics
- Persistently Finite Theories with Hyperarithmetic Models
- Persistently Finite, Persistently Arithmetic Theories
- Degrees of Recursively Saturated Models
- Computable trees, prime models, and relative decidability
- A computable ℵ0-categorical structure whose theory computes true arithmetic
- The degree spectra of homogeneous models
- The atomic model theorem and type omitting
- Omitting types, type spectrums, and decidability
- Bad models in nice neighborhoods
- Tame Theories with Hyperarithmetic Homogeneous Models
- A complete, decidable theory with two decidable models
- Theories with recursive models
- Type Structure Complexity and Decidability
- Autostability of prime models under strong constructivizations
- A characterization of the \(0\)-basis homogeneous bounding degrees
- Degree spectra of prime models
- On decidable and computable models of theories
- Metric structures and probabilistic computation
- Generalized effective completeness for continuous logic
- A decidable Ehrenfeucht theory with exactly two hyperarithmetic models
- Generalizing classical and effective model theory in theories of operations and classes
This page was built for publication: Foundations of recursive model theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3869329)
