2004 Annual Meeting of the Association for Symbolic Logic

DOI10.1017/S1079898600003553zbMATH Open1080.03500OpenAlexW2014121905MaRDI QIDQ3370628FDOQ3370628

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

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

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)