Skip to main content
SpringerLink
Log in

Computational Properties of Partial Non-deterministic Matrices and Their Logics

  • Conference paper
  • First Online:
Logical Foundations of Computer Science (LFCS 2022)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 13137))

Included in the following conference series:

Abstract

Incorporating non-determinism and partiality in the traditional notion of logical matrix semantics has proven to be decisive in a myriad of recent compositionality results in logic. However, several important properties which are known to be computable for finite matrices have not been studied in this wider context of partial non-deterministic matrices (PNmatrices).

This paper is dedicated to understanding how this generalization of the considered semantical structures affects the computational properties of basic problems regarding their induced logics, in particular their sets of theorems.

We will show that the landscape is quite rich, as some problems keep their computational status, for others the complexity increases, and for a few decidability is lost. Namely, we show that checking if the logics defined by two finite PNmatrices have the same theorems is undecidable. This latter result is obtained by reduction from the undecidable problem of checking universality of term-DAG-automata.

Research funded by FCT/MCTES through national funds and when applicable co-funded by EU under the project UIDB/50008/2020. The third author acknowledges the grant PD/BD/135513/2018 by FCT, under the LisMath Ph.D. programme.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Anantharaman, S., Narendran, P., Rusinowitch, M.: Closure properties and decision problems of dag automata. Inf. Process. Lett. 94(5), 231–240 (2005). https://doi.org/10.1016/j.ipl.2005.02.004

    Article  MathSciNet  MATH  Google Scholar 

  2. Avron, A.: Non-deterministic semantics for families of paraconsistent logics. In: Handbook of Paraconsistency, Studies in Logic, vol. 9. College Publications (2007)

    Google Scholar 

  3. Avron, A., Lev, I.: Non-deterministic multiple-valued structures. J. Log. Comput. 15(3), 241–261 (2005). https://doi.org/10.1093/logcom/exi001

    Article  MathSciNet  MATH  Google Scholar 

  4. Avron, A., Zamansky, A.: Non-deterministic semantics for logical systems. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic. Handbook of Philosophical Logic, vol. 16. Springer, Dordrecht (2011). https://doi.org/10.1007/978-94-007-0479-4_4

  5. Avron, A., Zohar, Y.: Rexpansions of non-deterministic matrices and their applications. Rev. Symb. Log. 12(1), 173–200 (2019). https://doi.org/10.1017/S1755020318000321

    Article  MathSciNet  MATH  Google Scholar 

  6. Baaz, M., Lahav, O., Zamansky, A.: Finite-valued semantics for canonical labelled calculi. J. Autom. Reason. 51(4), 401–430 (2013). https://doi.org/10.1007/s10817-013-9273-x

    Article  MathSciNet  MATH  Google Scholar 

  7. Caleiro, C., Marcelino, S.: Analytic calculi for monadic PNmatrices. In: Iemhoff, R., Moortgat, M., de Queiroz, R. (eds.) WoLLIC 2019. LNCS, vol. 11541, pp. 84–98. Springer, Heidelberg (2019). https://doi.org/10.1007/978-3-662-59533-6_6

    Chapter  Google Scholar 

  8. Caleiro, C., Marcelino, S.: Modular semantics for combined many-valued logics (2021, submitted)

    Google Scholar 

  9. Caleiro, C., Marcelino, S.: On axioms and rexpansions. In: Arieli, O., Zamansky, A. (eds.) Arnon Avron on Semantics and Proof Theory of Non-Classical Logics. OCL, vol. 21, pp. 39–69. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-71258-7_3

    Chapter  Google Scholar 

  10. Caleiro, C., Marcelino, S., Filipe, P.: Infectious semantics and analytic calculi for even more inclusion logics. In: 2020 IEEE 50th International Symposium on Multiple-Valued Logic, pp. 224–229 (2020). https://doi.org/10.1109/ISMVL49045.2020.000-1

  11. Charatonik, W.: Automata on DAG representations of finite trees. Technical report, MPI-I-1999-2-001, Max-Planck-Institut für Informatik, Saarbrücken, Germany (1999)

    Google Scholar 

  12. Ciabattoni, A., Lahav, O., Spendier, L., Zamansky, A.: Taming paraconsistent (and other) logics: an algorithmic approach. ACM Trans. Comput. Log. 16(1), 5:1–5:16 (2014). https://doi.org/10.1145/2661636

  13. Cook, S.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, STOC 1971, pp. 151–158. Association for Computing Machinery (1971). https://doi.org/10.1145/800157.805047

  14. Font, J.: Abstract Algebraic Logic. Mathematical Logic and Foundations, vol. 60. College Publications (2016)

    Google Scholar 

  15. Jorge, J.P., Holik, F.: Non-deterministic semantics for quantum states. Entropy 22(2), 156 (2020). https://doi.org/10.3390/e22020156

    Article  MathSciNet  Google Scholar 

  16. Kalicki, J.: A test for the existence of tautologies according to many-valued truth-tables. J. Symb. Log. 15(3), 182–184 (1950). https://doi.org/10.2307/2266783

    Article  MathSciNet  MATH  Google Scholar 

  17. Kalicki, J.: A test for the equality of truth-tables. J. Symb. Log. 17(3), 161–163 (1952). https://doi.org/10.2307/2267687

    Article  MathSciNet  MATH  Google Scholar 

  18. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series. Springer, Boston, MA (1972). https://doi.org/10.1007/978-1-4684-2001-2_9

  19. Lau, D.: Function Algebras on Finite Sets. A Basic Course on Many-Valued Logic and Clone Theory. Springer Monographs in Mathematics. Springer, Heidelberg (2006). https://doi.org/10.1007/3-540-36023-9

  20. Marcelino, S.: An unexpected Boolean connective. Logica Universalis (2021). https://doi.org/10.1007/s11787-021-00280-7

  21. Marcelino, S., Caleiro, C.: Disjoint fibring of non-deterministic matrices. In: Kennedy, J., de Queiroz, R.J.G.B. (eds.) WoLLIC 2017. LNCS, vol. 10388, pp. 242–255. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-662-55386-2_17

    Chapter  MATH  Google Scholar 

  22. Marcelino, S., Caleiro, C.: Axiomatizing non-deterministic many-valued generalized consequence relations. Synthese 198(22), 5373–5390 (2019). https://doi.org/10.1007/s11229-019-02142-8

    Article  MathSciNet  Google Scholar 

  23. Marcos, J.: What is a non-truth-functional Logic? Stud. Logica. 92(2), 215–240 (2009). https://doi.org/10.1007/s11225-009-9196-z

    Article  MathSciNet  MATH  Google Scholar 

  24. Omori, H., Skurt, D.: Untruth, falsity and non-deterministic semantics. In: 2021 IEEE 51th International Symposium on Multiple-Valued Logic, pp. 74–80 (2021). https://doi.org/10.1109/ISMVL51352.2021.00022

  25. Scott, D.: Completeness and axiomatizability in many-valued logic. In: Henkin, L., Addison, J., Chang, C., Craig, W., Scott, D., Vaught, R. (eds.) Proceedings of the Tarski Symposium. Proceedings of Symposia in Pure Mathematics, vol. XXV, pp. 411–435. American Mathematical Society (1974). https://doi.org/10.1007/978-3-0346-0145-0_24

  26. Shoesmith, D., Smiley, T.: Multiple-Conclusion Logic. Cambridge University Press (1978). https://doi.org/10.1017/CBO9780511565687

  27. Wójcicki, R.: Theory of Logical Calculi. Basic Theory of Consequence Operations. Synthese Library, vol. 199. Kluwer (1998). https://doi.org/10.1007/978-94-015-6942-2

Download references

Author information

Authors and Affiliations

  1. SQIG - Instituto de Telecomunicações, Departamento de Matemática, Instituto Superior Técnico, Universidade de Lisboa, Lisbon, Portugal

    Sérgio Marcelino, Carlos Caleiro & Pedro Filipe

Authors
  1. Sérgio Marcelino
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carlos Caleiro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pedro Filipe
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pedro Filipe .

Editor information

Editors and Affiliations

  1. CUNY Graduate Center, New York, NY, USA

    Sergei Artemov

  2. Cornell University, Ithaca, NY, USA

    Anil Nerode

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

Marcelino, S., Caleiro, C., Filipe, P. (2022). Computational Properties of Partial Non-deterministic Matrices and Their Logics. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2022. Lecture Notes in Computer Science(), vol 13137. Springer, Cham. https://doi.org/10.1007/978-3-030-93100-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-93100-1_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-93099-8

  • Online ISBN: 978-3-030-93100-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation