Conceptio › Archive › arXiv (All)
arXiv (All)open access

Quantified propositional calculi and narrow implicit proofs

Pudlák, Pavel et al.
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
computational-complexitylogiclogic-in-computer-science
logic in computer science, computational complexity, logic
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 820505
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.