Completeness of the generalized propositional calculus

DOI10.1305/NDJFL/1093894075MaRDI QIDQ2531279zbMATH OpenOpenAlexFDO

Authors Alexander Abian

Publication date 1970

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1305/ndjfl/1093894075

zbMATH Keywords

model theoryalgebraic logic

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cited in

(6)

• Completeness and counter-example generations of a basic protocol logic (extended abstract)
• scientific article; zbMATH DE number 553883 (Why is no real title available?)
• Criterion for propositional calculi to be finitely generated
• Compilability of propositional abduction
• scientific article; zbMATH DE number 4059375 (Why is no real title available?)
• Some Completeness Results for Propositional Conditional Logics

This page was built for publication: Completeness of the generalized propositional calculus

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