Skip to main content
Conference Proceedings

Propositional proofs in frege and extended frege systems (Abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9139 1-6
DOI: 10.1007/978-3-319-20297-6_1
2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We discuss recent results on the propositional proof complexity of Frege proof systems, including some recently discovered quasipolynomial size proofs for the pigeonhole principle and the Kneser-Lovász theorem. These are closely related to formalizability in bounded arithmetic.

Author supplied keywords

Cite

CITATION STYLE

APA

Buss, S. R. (2015). Propositional proofs in frege and extended frege systems (Abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9139, pp. 1–6). Springer Verlag. https://doi.org/10.1007/978-3-319-20297-6_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free