Effective model theory vs. recursive model theory
From MaRDI portal
Recommendations
- Effective λ-models versus recursively enumerable λ-theories
- scientific article; zbMATH DE number 1136113
- Publication:4938557
- scientific article; zbMATH DE number 6536312
- Publication:4934290
- The reasonable effectiveness of model theory in mathematics
- scientific article; zbMATH DE number 7594250
- Effective choice of constructivizations and recursive consistency of problems on constructive models
- Generalizing classical and effective model theory in theories of operations and classes
- Strongly minimal theories with recursive models
Cites work
Cited in
(59)- Effective categoricity of abelian p-groups
- Degrees of autostability for prime Boolean algebras
- Computability-theoretic categoricity and Scott families
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- Categoricity spectra of computable structures
- On bi-embeddable categoricity of algebraic structures
- Relatively intrinsically computable relations on Boolean algebras with a distinguished set of atoms
- Strong degrees of categoricity and weak density
- Degrees of autostability relative to strong constructivizations for Boolean algebras
- Effective choice of constructivizations and recursive consistency of problems on constructive models
- Generalized hyperarithmetical computability over structures
- On functors enumerating structures
- Effective categoricity for distributive lattices and Heyting algebras
- Effective categoricity of equivalence structures
- A computably stable structure with no Scott family of finitary formulas
- Degrees of autostability relative to strong constructivizations
- Enumerations in computable structure theory
- Degrees of relative computable categoricity
- 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000. La Sorbonne, Paris, France, July 23-31, 2000
- Computable dimension for ordered fields
- 2011 North American Annual Meeting of the Association for Symbolic Logic, University of California at Berkeley, Berkeley, CA, USA, March 24--27, 2011
- Rice sequences of relations
- Effectively existentially-atomic structures
- Enumeration reducibility and computable structure theory
- A note on effective categoricity for linear orderings
- Conservative extensions of abstract structures
- Computable structures of rank \(\omega _1^{\mathrm{CK}}\)
- A robuster Scott rank
- Notes on the Jump of a Structure
- Computably categorical structures and expansions by constants
- scientific article; zbMATH DE number 1507232 (Why is no real title available?)
- There is no classification of the decidably presentable structures
- Degree spectra of relations on a cone
- scientific article; zbMATH DE number 1390025 (Why is no real title available?)
- scientific article; zbMATH DE number 1405578 (Why is no real title available?)
- Independence in computable algebra
- On the notion of jump structure
- Relativizing computable categoricity
- An introduction to the Scott complexity of countable structures and a survey of recent results
- On -definable functions on ordinals
- Another jump inversion theorem for structures
- 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06
- Computable functors and effective interpretability
- Degrees of categoricity on a cone via -systems
- scientific article; zbMATH DE number 7594250 (Why is no real title available?)
- Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension
- Categoricity and complexity of relations over algebraic structures
- On the complexity of the theory of a computably presented metric structure
- Complexity profiles and generic Muchnik reducibility
- Computable ideals in \(I\)-algebras
- Degrees of selector functions and relative computable categoricity
- Syntactic characterization of learnability of structures with mind changes
- Computable categoricity relative to a C.E. degree
- Relations enumerable from positive information
- A Lopez-Escobar theorem for continuous domains
- On categoricity of scattered linear orders of constructive ranks
- The structural complexity of models of arithmetic
- Generalizing classical and effective model theory in theories of operations and classes
- Preserving categoricity and complexity of relations
This page was built for publication: Effective model theory vs. recursive model theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5753942)
