2011 North American Annual Meeting of the Association for Symbolic Logic, University of California at Berkeley, Berkeley, CA, USA, March 24--27, 2011
type: Item
instance of: scholarly article
zbMATH Open document ID: 1241.03002
published in: The Bulletin of Symbolic Logic
publication date: 2012-06-20T00:00:00Z
full work available at URL: https://projecteuclid.org/euclid.bsl/1333560809
Mathematics Subject Classification ID: 03-06
Mathematics Subject Classification ID: 00B05
zbMATH DE Number: 6048108
MaRDI profile type: Publication
OpenAlex ID: W2506463162
cites work: Social processes, program verification and all that
cites work: Computable Boolean algebras
cites work: Q4820368
cites work: The Steel hierarchy of ordinal valued Borel mappings
cites work: The structure of countable Boolean algebras
cites work: The completeness of the isomorphism relation for countable Boolean algebras
cites work: Categories, Structures, and the Frege-Hilbert Controversy: The Status of Meta-mathematics
cites work: Happy families
cites work: Some Ramsey-type theorems
cites work: Codable sets and orbits of computably enumerable sets
cites work: Real closed rings. II. Model theory
cites work: Analysing inconsistent first-order knowledgebases
cites work: Classifications for inconsistent theories
cites work: On the orbits of computably enumerable sets
cites work: Q3611832
cites work: Randomness conservation inequalities; information and independence in mathematical theories
cites work: Uniform test of algorithmic randomness over a general space
cites work: Algorithmic Randomness and Complexity
cites work: Incomplete models
cites work: Numerical abstraction via the Frege quantifier
cites work: Notions of Invariance for Abstraction Principles
cites work: Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem
cites work: Passive induction and a solution to a Paris-Wilkie open question
cites work: On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency
cites work: An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency
cites work: How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q
cites work: A note on the axioms for differentially closed fields of characteristic zero
cites work: Post's program and incomplete recursively enumerable sets.
cites work: The effective Borel hierarchy
cites work: Effective model theory vs. recursive model theory
cites work: Generic copies of countable structures
cites work: Language identification in the limit
cites work: A note on the Entscheidungsproblem
cites work: An Unsolvable Problem of Elementary Number Theory
cites work: When are Two Algorithms the Same?
cites work: Degrees of categoricity of computable structures
cites work: The bounded proper forcing axiom and well orderings of the reals
cites work: Complete analytic equivalence relations
DOI: 10.2178/BSL/1333560809
title: 2011 North American Annual Meeting of the Association for Symbolic Logic, University of California at Berkeley, Berkeley, CA, USA, March 24--27, 2011
description: scientific article; zbMATH DE number 6048108