scientific article; zbMATH DE number 638367

MaRDI QIDQ4305341zbMATH OpenFDO

Authors Adam Kolany

Publication date 13 September 1994

zbMATH Keywords

completeness theoremhypergraphsintuitionistic propositional calculus

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Hypergraphs (05C65)

Recommendations

• scientific article; zbMATH DE number 517080
• Propositional intuitionistic multiple-conclusion calculus via proof graphs
• scientific article; zbMATH DE number 6970800
• Hybrid logics and NP graph properties
• Recognizability, hypergraph operations, and logical types
• scientific article; zbMATH DE number 179052
• Hypergraph acyclicity and propositional model counting
• scientific article; zbMATH DE number 5762364
• On graphs for intuitionistic modal logics

Cited in

(9)

• Relative definability of boolean functions via hypergraphs
• Hypergraphs, local reasoning, and weakly aggregative modal logic
• Recognizability, hypergraph operations, and logical types
• Equivalence proof for intuitionistic existential alpha graphs
• scientific article; zbMATH DE number 517080 (Why is no real title available?)
• scientific article; zbMATH DE number 6970800 (Why is no real title available?)
• Product of Graphs and Hybrid Logic
• Intuitionistic N-graphs
• scientific article; zbMATH DE number 6747949 (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 Q4305341)