Representing formulas of propositional logic by cographs, permutations and tables

DOI10.1007/978-3-031-15146-0_26zbMath1524.03012OpenAlexW4294837700MaRDI QIDQ6108756

Michał Sochański

Publication date: 26 July 2023

Published in: Diagrammatic Representation and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-15146-0_26

Mathematics Subject Classification ID

Classical propositional logic (03B05)

Cites Work

• Unnamed Item
• Complement reducible graphs
• Algorithmic graph theory and perfect graphs
• Synthetic tableaux: Minimal tableau search heuristics
• Towards a combinatorial proof theory
• \((k,l)\)-colourings and Ferrers diagram representations of cographs
• What makes an effective representation of information: a formal account of observational advantages
• Proofs without syntax

This page was built for publication: Representing formulas of propositional logic by cographs, permutations and tables