Completeness proofs for propositional logic with polynomial-time connectives

DOI10.1016/0168-0072(89)90044-4MaRDI QIDQ1123883zbMATH OpenOpenAlexWikidataFDO

Authors John N. Crossley, Philip Scott

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

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

Recommendations

• Expressive completeness and decidability
• Complexity, decidability and completeness
• scientific article; zbMATH DE number 107724
• scientific article; zbMATH DE number 2072508
• scientific article; zbMATH DE number 1361516

Cites work

• scientific article; zbMATH DE number 3167150 (Why is no real title available?)
• scientific article; zbMATH DE number 4066875 (Why is no real title available?)
• scientific article; zbMATH DE number 1028819 (Why is no real title available?)
• scientific article; zbMATH DE number 3222098 (Why is no real title available?)
• scientific article; zbMATH DE number 3325547 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• Model theory
• On the Computational Complexity of Algorithms

Cited in

(3)

• scientific article; zbMATH DE number 1962835 (Why is no real title available?)
• scientific article; zbMATH DE number 1424054 (Why is no real title available?)
• Simple characterization of functionally complete one-element sets of propositional connectives

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

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