2011 North American Annual Meeting of the Association for Symbolic Logic
From MaRDI portal
Publication:2893284
DOI10.2178/bsl/1333560809zbMath1241.03002OpenAlexW2506463162MaRDI QIDQ2893284
No author found.
Publication date: 20 June 2012
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.bsl/1333560809
Collections of abstracts of lectures (00B05) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06)
Cites Work
- Unnamed Item
- Unnamed Item
- Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem
- The structure of countable Boolean algebras
- Real closed rings. II. Model theory
- The bounded proper forcing axiom and well orderings of the reals
- Passive induction and a solution to a Paris-Wilkie open question
- Numerical abstraction via the Frege quantifier
- Generic copies of countable structures
- Some Ramsey-type theorems
- Classifications for inconsistent theories
- A note on the axioms for differentially closed fields of characteristic zero
- Analysing inconsistent first-order knowledgebases
- Incomplete models
- Uniform test of algorithmic randomness over a general space
- Degrees of categoricity of computable structures
- Computable Boolean algebras
- Notions of Invariance for Abstraction Principles
- On the orbits of computably enumerable sets
- Algorithmic Randomness and Complexity
- On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency
- When are Two Algorithms the Same?
- Social processes, program verification and all that
- Randomness conservation inequalities; information and independence in mathematical theories
- Post's program and incomplete recursively enumerable sets.
- Happy families
- Codable sets and orbits of computably enumerable sets
- The Steel hierarchy of ordinal valued Borel mappings
- The completeness of the isomorphism relation for countable Boolean algebras
- How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q
- The effective Borel hierarchy
- Complete analytic equivalence relations
- An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency
- Language identification in the limit
- Categories, Structures, and the Frege-Hilbert Controversy: The Status of Meta-mathematics
- Effective model theory vs. recursive model theory
- An Unsolvable Problem of Elementary Number Theory
- A note on the Entscheidungsproblem
