2004 Annual Meeting of the Association for Symbolic Logic

DOI10.1017/S1079898600003553MaRDI QIDQ3370628zbMATH OpenOpenAlexFDO

Authors

Publication date 8 February 2006

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

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

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3873291 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 1523417 (Why is no real title available?)
• Carnap, completeness, and categoricity: The Gabelbarkeitssatz of 1928
• Computable structures and the hyperarithmetical hierarchy
• Explicit provability and constructive semantics
• Model Theory
• Randomness and reducibility
• Refined program extraction from classical proofs
• Simple and immune relations on countable structures
• TPS: A theorem-proving system for classical type theory
• The relative efficiency of propositional proof systems
• Unification in intuitionistic logic
• Weakly computable real numbers

Cited in

(5)

• Lower complexity bounds in justification logic
• 2001 Annual Meeting of the Association for Symbolic Logic. University of Pennsylvania, Philadelphia, PA, March 10-13, 2001
• 2007 Annual Meeting of the Association for Symbolic Logic
• 2004 Spring Meeting of the Association for Symbolic Logic
• 2005 Annual Meeting of the Association for Symbolic Logic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3370628)