2004 Annual Meeting of the Association for Symbolic Logic

DOI10.1017/S1079898600003553zbMath1080.03500OpenAlexW2014121905MaRDI QIDQ3370628

No author found.

Publication date: 8 February 2006

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

Full work available at URL: https://doi.org/10.1017/s1079898600003553

Mathematics Subject Classification ID

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

Related Items

Lower complexity bounds in justification logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simple and immune relations on countable structures
• Computable structures and the hyperarithmetical hierarchy
• Randomness and reducibility
• TPS: A theorem-proving system for classical type theory
• Explicit Provability and Constructive Semantics
• The relative efficiency of propositional proof systems
• Unification in intuitionistic logic
• Model Theory
• Weakly computable real numbers
• Carnap, completeness, and categoricity: The Gabelbarkeitssatz of 1928
• Refined program extraction from classical proofs