Complexity of proofs
2 mapped entries · Browse and filter all →
Counts include all statuses and descendants. Classifications are editorial or inferred from community fields, not an AMS assessment of the problem.
Proof Theory and Constructive Mathematics · ICM 1994: Logic and complexity Independence results and the complexity of propositional calculus
A question from Bulletin of Symbolic Logic (2007). Section 7.2, journal p. 443; inspected PDF p. 27.
These are selected sources for the parent class. Article coverage is a first reviewed selection, and may not cover this exact subcategory.
Association for Symbolic Logic / Cambridge
Logic and foundations
2007 · 2 questions extracted
MSC2020 © Mathematical Reviews (AMS) and zbMATH · CC BY-NC-SA 4.0 · Official PDF, page 10