Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007

zbMath1157.03302MaRDI QIDQ1005921

No author found.

Publication date: 17 March 2009

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://rd.springer.com/journal/153/48/1/page/1

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Model theory (03Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmic properties of branching models
• Model completeness for trivial, uncountably categorical theories of Morley rank \(1\)
• Atomic models higher up
• Every recursive Boolean algebra is isomorphic to one with incomplete atoms
• Diophantine definability and decidability in extensions of degree 2 of totally real fields
• Effective categoricity of equivalence structures
• Infinite chains and antichains in computable partial Orderings
• Recursive isomorphism types of recursive Boolean algebras
• Non Σ_n axiomatizable almost strongly minimal theories
• Diophantine relationships between algebraic number fields
• Recursively Categorical Linear Orderings
• Recursive Linear Orders with Incomplete Successivities
• Diophantine Sets over Some Rings of Algebraic Integers
• Computably categorical structures and expansions by constants
• Trivial, strongly minimal theories are model complete after naming constants
• Model Theory
• Corps et chirurgie
• On the computability-theoretic complexity of trivial, strongly minimal models
• Computable trees of Scott rank ω₁^CK, and computable approximation
• Ramsey's theorem and recursion theory

This page was built for publication: Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007