Skip to main content

Representing Formulas of Propositional Logic by Cographs, Permutations and Tables

  • Conference paper
  • First Online:
Diagrammatic Representation and Inference (Diagrams 2022)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 13462))

Included in the following conference series:

  • 659 Accesses

Abstract

The paper presents how formation trees, a type of syntax trees for a formula, can be used to represent semantic information about formulas of classical propositional logic in form of graphs, permutations and tables. The three representation types are discussed in terms of the construction process as well as their cognitive potentials and observational advantages.

My work was supported financially by National Science Centre in Poland, grant no 2017/26/E/HS1/00127.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    Proof of a formula, in this context, consists in finding a particular homomorphism between graphs, and so has been characterised by Hughes as a “graphical” [6].

  2. 2.

    In discrete mathematics, cographs are often represented by cotrees and parse trees, the latter corresponding to formation trees. Parse trees are binary trees, with inner nodes of types 1 and 0, corresponding to \(\alpha \)– and \(\beta \)–nodes of the formation tree. Their structure mirrors the recursive procedure of construction of cographs, with 1-nodes corresponding to join operation and 0-nodes to disjoint union. See [3, 7] for other properties of cographs.

  3. 3.

    A clique in a graph G is a complete induced subgraph H of G. A maximal clique is a clique that cannot be extended to a greater clique by adding new vertices. An independent set in a graph G is a subgraph H of G such that no \(v_{1}, v_{2} \in H\) are adjacent. Similarly, a maximal independent set in G is one that cannot be extended by adding new vertices to it.

  4. 4.

    Note that each horizontal path crosses each vertical path in exactly one point (occurrence of a literal). This is consistent with an interesting property of cographs: any maximal clique of a cograph intersects any maximal independent set in a single vertex.

References

  1. Leszczyńska-Jasion, D., Sochański, M.: Methods of construction of synthetic tableaux based on cographs and permutations (manuscript available on https://ddsuam.wordpress.com/publications/)

  2. Chlebowski, S., Jukiewicz, M., Leszczyńska-Jasion, D., Sochański, M., Tomczyk, A.: Synthetic tableaux: minimal tableau search heuristics. In: Proceedings of the 11th International Joint Conference on Automated Reasoning. Springer LNCS (2022). ISBN:978-3-031-10768-9

    Google Scholar 

  3. Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Ann. Disc. Math. 57 (2004)

    Google Scholar 

  4. Smullyan, R. M.: First-Order Logic. Springer-Verlag (1968). https://doi.org/10.1007/978-3-642-86718-7_4

  5. Ralph, B., Strassburger, L.: Towards a combinatorial proof theory. In: Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, pp. 259–276. Springer LNCS (2019). https://doi.org/10.1007/978-3-030-29026-9_15

  6. Hughes, D.: Proofs without syntax. Ann. Math. 164, 1065–1076 (2006)

    Article  MathSciNet  Google Scholar 

  7. Corneil, D.G., Lerchs, H., Burlingham, L.S.: Complement reducible graphs. Discret. Appl. Math. 3(3), 163–174 (1981)

    Article  MathSciNet  Google Scholar 

  8. Epple, D.A., Huang, J.: (k, l)-colourings and Ferrers diagram representations of cographs. Eur. J. Combinat. 91, 103208 (2021)

    Google Scholar 

  9. Shimojima, A.: Semantic Properties of Diagrams and Their Cognitive Potentials. Chapman and Hall/CRC (2015)

    Google Scholar 

  10. Jamnik, M., Shimojima, A., Stapleton, G.: What makes an effective representation of information: a formal account of observational advantages. J. Logic. Lang. Inf. 26(2), 143–177 (2017)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michał Sochański .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sochański, M. (2022). Representing Formulas of Propositional Logic by Cographs, Permutations and Tables. In: Giardino, V., Linker, S., Burns, R., Bellucci, F., Boucheix, JM., Viana, P. (eds) Diagrammatic Representation and Inference. Diagrams 2022. Lecture Notes in Computer Science(), vol 13462. Springer, Cham. https://doi.org/10.1007/978-3-031-15146-0_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-15146-0_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-15145-3

  • Online ISBN: 978-3-031-15146-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics