Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk)

DOI10.4230/LIPICS.CSL.2012.9zbMATH Open1252.03131OpenAlexW2244997347MaRDI QIDQ4649532

Stephen A. Cook

Publication date: 22 November 2012

Full work available at URL: https://doi.org/10.4230/LIPIcs.CSL.2012.9

zbMATH Keywords

propositional proof systemscomplexity classesweak formal theories

Mathematics Subject Classification ID

Could not fetch data.

Recommendations

• Propositional proof systems, the consistency of first order theories and the complexity of computations 👍 👎
• Complexity of Propositional Proofs 👍 👎
• On Complete Problems, Relativizations and Logics for Complexity Classes 👍 👎
• A Note on the Complexity of Classical and Intuitionistic Proofs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk)

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