2009 North American Annual Meeting of the Association for Symbolic Logic
From MaRDI portal
Publication:3655269
DOI10.2178/bsl/1255526083zbMath1177.03012OpenAlexW2496987941MaRDI QIDQ3655269
No author found.
Publication date: 7 January 2010
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/bsl/1255526083
Collections of abstracts of lectures (00B05) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantifier elimination for a class of intuitionistic theories
- Vaught's conjecture for superstable theories of finite rank
- Set theory. An introduction to independence proofs
- Ultrafilters with small generating sets
- Strong jump-traceability. I: The computably enumerable case
- Lowness properties and randomness
- Self-verifying axiom systems, the incompleteness theorem and related reflection principles
- Every real closed field has an integer part
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- A Brief Introduction to Algebraic Set Theory
- Definable types in -minimal theories
- Model-theoretic consequences of a theorem of Campana and Fujiki
- A computably categorical structure whose expansion by a constant has infinite computable dimension
- Σ_{𝑛}-bounding and Δ_{𝑛}-induction
- Lowness for the class of random sets
- Kripke submodels and universal sentences
- Forking and independence in o-minimal theories
- There may be infinitely many near-coherence classes underu< ∂
This page was built for publication: 2009 North American Annual Meeting of the Association for Symbolic Logic
