2008 Annual Meeting of the Association for Symbolic Logic

DOI10.2178/BSL/1231081376zbMath1156.03302OpenAlexW2505803521MaRDI QIDQ3616439

No author found.

Publication date: 25 March 2009

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/bsl/1231081376

Mathematics Subject Classification ID

Collections of abstracts of lectures (00B05) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06)

Cites Work

• Unnamed Item
• Unnamed Item
• Passive induction and a solution to a Paris-Wilkie open question
• Exact functors and measurable cardinals
• Generic structures and simple theories
• \(^{\perp}N\) as an abstract elementary class
• Approximations and endomorphism algebras of modules.
• Effective categoricity of equivalence structures
• A generalization of the second incompleteness theorem and some exceptions to it
• Self-verifying axiom systems, the incompleteness theorem and related reflection principles
• A Borel reductibility theory for classes of countable structures
• On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency
• Typical ambiguity and the axiom of choice
• The Hanf number for complete L_ω1,ω-sentences (without GCH)
• Adjointness in Foundations
• Weakly o-minimal structures and real closed fields
• How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q
• KNIGHT'S MODEL, ITS AUTOMORPHISM GROUP, AND CHARACTERIZING THE UNCOUNTABLE CARDINALS
• The isomorphism relation on countable torsion free abelian groups
• Complexity of Categorical Theories with Computable Models
• Computable trees of Scott rank ω₁^CK, and computable approximation
• An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency

This page was built for publication: 2008 Annual Meeting of the Association for Symbolic Logic