2009 North American Annual Meeting of the Association for Symbolic Logic
type: Item
instance of: scholarly article
title: 2009 North American Annual Meeting of the Association for Symbolic Logic
zbMATH Open document ID: 1177.03012
published in: The Bulletin of Symbolic Logic
publication date: 2010-01-07T00:00:00Z
Mathematics Subject Classification ID: 03-06
Mathematics Subject Classification ID: 00B05
zbMATH DE Number: 5654343
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.2178/bsl/1255526083
OpenAlex ID: W2496987941
cites work: Self-verifying axiom systems, the incompleteness theorem and related reflection principles
cites work: Lowness properties and randomness
cites work: Lowness for the class of random sets
cites work: Model-theoretic consequences of a theorem of Campana and Fujiki
cites work: Vaught's conjecture for superstable theories of finite rank
cites work: Strong jump-traceability. I: The computably enumerable case
cites work: There may be infinitely many near-coherence classes underu< ∂
cites work: Quantifier elimination for a class of intuitionistic theories
cites work: Ultrafilters with small generating sets
cites work: Kripke submodels and universal sentences
cites work: Generalized Galois logics. Relational semantics of nonclassical logical calculi
cites work: Mathematical thought and its objects
cites work: A Brief Introduction to Algebraic Set Theory
cites work: Definable types in -minimal theories
cites work: Forking and independence in o-minimal theories
cites work: Every real closed field has an integer part
cites work: Combinatorial principles weaker than Ramsey's Theorem for pairs
cites work: Σ_{𝑛}-bounding and Δ_{𝑛}-induction
cites work: A computably categorical structure whose expansion by a constant has infinite computable dimension
cites work: Set theory. An introduction to independence proofs
cites work: Computability and randomness
DOI: 10.2178/BSL/1255526083
description: scientific article; zbMATH DE number 5654343