OpenFrontiersBeta

The index

Explore the frontier

2 entries matching the current filters. Sorted by recently added.

Full hierarchy →

MSC 03F×Clear all

OP-0903Logic and foundationsOpen

Logic and complexity Independence results and the complexity of propositional calculus · 1994-logic-12

Proof Theory and Constructive Mathematics · ICM 1994: Logic and complexity Independence results and the complexity of propositional calculus

ICM Conjectures· Source assessment · not reviewed· 1994

OP-10108Logic and foundationsStatus unassessed

Existence of a p-optimal propositional proof system

A question from Bulletin of Symbolic Logic (2007). Section 7.2, journal p. 443; inspected PDF p. 27.

Nathan Segerlind — The complexity of propositional proofs· Journal question · editorial summary