Completeness proofs for propositional logic with polynomial-time connectives

DOI10.1016/0168-0072(89)90044-4zbMath0678.03004OpenAlexW1980622348WikidataQ126436871 ScholiaQ126436871MaRDI QIDQ1123883

Philip J. Scott, John N. Crossley

Publication date: 1989

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(89)90044-4

zbMATH Keywords

completenessdecidabilityextensions of propositional calculuspolynomial-time connectives

Mathematics Subject Classification ID

Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Classical propositional logic (03B05)

Cites Work

• Model theory
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• On the Computational Complexity of Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Completeness proofs for propositional logic with polynomial-time connectives