Skip to main content

Proof Search on Bilateralist Judgments over Non-deterministic Semantics

  • Conference paper
  • First Online:
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2021)

Abstract

The bilateralist approach to logical consequence maintains that judgments of different qualities should be taken into account in determining what-follows-from-what. We argue that such an approach may be actualized by a two-dimensional notion of entailment induced by semantic structures that also accommodate non-deterministic and partial interpretations, and propose a proof-theoretical apparatus to reason over bilateralist judgments using symmetrical two-dimensional analytical Hilbert-style calculi. We also provide a proof-search algorithm for finite analytic calculi that runs in at most exponential time, in general, and in polynomial time when only rules having at most one formula in the succedent are present in the concerned calculus.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Similar content being viewed by others

Notes

  1. 1.

    Whether monadicity of a –matrix is decidable is still an open problem.

References

  1. Avron, A.: 5-valued non-deterministic semantics for the basic paraconsistent logic mCi. In: Studies in Logic, Grammar and Rhetoric, pp. 127–136 (2008)

    Google Scholar 

  2. Avron, A.: Multi-valued semantics: why and how. Stud. Logica. 92(2), 163–182 (2009). https://doi.org/10.1007/s11225-009-9193-2

    Article  MathSciNet  MATH  Google Scholar 

  3. Avron, A., Ben-Naim, J., Konikowska, B.: Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics. Log. Univers. 1, 41–70 (2007). https://doi.org/10.1007/s11787-006-0003-6

    Article  MathSciNet  MATH  Google Scholar 

  4. Avron, A., Konikowska, B.: Multi-valued calculi for logics based on non-determinism. Logic J. IGPL 13(4), 365–387 (2005). https://doi.org/10.1093/jigpal/jzi030

    Article  MathSciNet  MATH  Google Scholar 

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

    Chapter  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. Blasio, C.: Revisitando a lógica de Dunn-Belnap. Manuscrito 40, 99–126 (2017). https://doi.org/10.1590/0100-6045.2017.v40n2.cb

    Article  Google Scholar 

  8. Blasio, C., Caleiro, C., Marcos, J.: What is a logical theory? On theories containing assertions and denials. Synthese (2019). https://doi.org/10.1007/s11229-019-02183-z

  9. Blasio, C., Marcos, J., Wansing, H.: An inferentially many-valued two-dimensional notion of entailment. Bull. Sect. Logic 46(9), 233–262 (2017). https://doi.org/10.18778/0138-0680.46.3.4.05

    Article  MathSciNet  MATH  Google Scholar 

  10. 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 

  11. 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 

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

  13. Caleiro, C., Marcos, J., Volpe, M.: Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics. Theoret. Comput. Sci. 603, 84–110 (2015). https://doi.org/10.1016/j.tcs.2015.07.016

    Article  MathSciNet  MATH  Google Scholar 

  14. Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. J. Symb. Log. 44(1), 36–50 (1979). https://doi.org/10.2307/2273702

    Article  MathSciNet  MATH  Google Scholar 

  15. Drobyshevich, S.: Tarskian consequence relations bilaterally: some familiar notions. Synthese (2019). https://doi.org/10.1007/s11229-019-02267-w

  16. Hjortland, O.T.: Speech acts, categoricity, and the meanings of logical connectives. Notre Dame J. Form. Logic 55(4), 445–467 (2014). https://doi.org/10.1215/00294527-2798700

    Article  MathSciNet  MATH  Google Scholar 

  17. Humberstone, L.: Heterogeneous logic. Erkenntnis 29(3), 395–435 (1988). https://doi.org/10.1007/BF00183072

    Article  MATH  Google Scholar 

  18. Marcelino, S., Caleiro, C.: Decidability and complexity of fibred logics without shared connectives. Logic J. IGPL 24(5), 673–707 (2016). https://doi.org/10.1093/jigpal/jzw033

    Article  MathSciNet  MATH  Google Scholar 

  19. 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 

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

  21. Marcos, J.: Possible-translations semantics for some weak classically-based paraconsistent logics. J. Appl. Non-Class. Logics 18(1), 7–28 (2008). https://doi.org/10.3166/jancl.18.7-28

    Article  MathSciNet  MATH  Google Scholar 

  22. Rumfitt, I.: “Yes’’ and “No’’. Mind 109(436), 781–823 (2000). https://doi.org/10.1093/mind/109.436.781

    Article  MathSciNet  Google Scholar 

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

    Book  MATH  Google Scholar 

Download references

Acknowledgements

V. Greati and J. Marcos acknowledge support from CAPES (Brasil)—Finance Code 001 and CNPq (Brasil), respectively. S. Marcelino’s research was done under the scope of Project UIDB/50008/2020 of Instituto de Telecomunicações (IT), financed by the applicable framework (FCT/MEC through national funds and cofunded by FEDER-PT2020).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vitor Greati .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Greati, V., Marcelino, S., Marcos, J. (2021). Proof Search on Bilateralist Judgments over Non-deterministic Semantics. In: Das, A., Negri, S. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2021. Lecture Notes in Computer Science(), vol 12842. Springer, Cham. https://doi.org/10.1007/978-3-030-86059-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-86059-2_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-86058-5

  • Online ISBN: 978-3-030-86059-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics