scientific article; zbMATH DE number 877753

MaRDI QIDQ4877446zbMATH OpenFDO

Authors Norman D. Megill, Martin W. Bunder

Publication date 12 May 1996

zbMATH Keywords

\(D\)-completenesscondensed detachmentimplicational logic

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Other nonclassical logic (03B60)

Recommendations

• scientific article; zbMATH DE number 6538188
• Note on D-completeness and prelinearity
• Condensed detachment is complete for relevance logic: A computer-aided proof
• \textbf{D}-complete axioms for the classical equivalential calculus
• Deduction theorems for weak implicational logics

Cited in

(10)

• Condensed detachment is complete for relevance logic: A computer-aided proof
• A finitely axiomatized formalization of predicate calculus with equality
• Countably many weakenings of Belnap-Dunn logic
• A deterministic weakening of Belnap-Dunn logic
• Deciding whether a relation defined in Presburger logic can be defined in weaker logics
• Logical Weak Completions of Paraconsistent Logics
• scientific article; zbMATH DE number 6131419 (Why is no real title available?)
• Finite-Variable Logics Do Not Have Weak Beth Definability Property
• Note on D-completeness and prelinearity
• scientific article; zbMATH DE number 7695589 (Why is no real title available?)

This page was built for publication:

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