Skip to main content
SpringerLink
Log in

Finite-valued Semantics for Canonical Labelled Calculi

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We define a general family of canonical labelled calculi, of which many previously studied sequent and labelled calculi are particular instances. We then provide a uniform and modular method to obtain finite-valued semantics for every canonical labelled calculus by introducing the notion of partial non-deterministic matrices. The semantics is applied to provide simple decidable semantic criteria for two crucial syntactic properties of these calculi: (strong) analyticity and cut-admissibility. Finally, we demonstrate an application of this framework for a large family of paraconsistent logics.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Baaz, M., Fermüller, C.G., Salzer, G., Zach, R.: Labeled calculi and finite-valued logics. Stud. Log. 61(1), 7–33 (1998)

    Article  MATH  Google Scholar 

  2. Avron, A., Zamansky, A.: Canonical signed calculi, non-deterministic matrices and cut-elimination. In: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science, LFCS ’09, pp. 31–45. Springer, Berlin, Heidelberg (2009)

    Google Scholar 

  3. Gabbay, D.: Labelled Deductive Systems, Vol. 1. Oxford Logic Guides, Clarendon Press (1996)

  4. Avron, A., Lev, I.: Non-deterministic multiple-valued structures. J. Log. Comput. 15(3), 241–261 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Baaz, M., Lahav, O., Zamansky, A.: Effective finite-valued semantics for labelled calculi. In: Gramlich, B., Miller, D., Sattler, U. (eds.) Automated Reasoning. Lecture Notes in Computer Science, vol. 7364, pp. 52–66. Springer Berlin/Heidelberg (2012)

    Chapter  Google Scholar 

  6. Lahav, O.: Non-deterministic matrices for semi-canonical deduction systems. In: 2012 42nd IEEE International Symposium on Multiple-Valued Logic (ISMVL), pp. 79–84 (2012)

  7. Avron, A., Konikowska, B., Zamansky, A.: Cut-free sequent calculi for C-systems with generalized finite-valued semantics. J. Log. Comput. (2012). doi:10.1093/logcom/exs039

  8. Avron, A.: Multi-valued semantics: why and how. Stud. Log. 92, 163–182 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Urquhart, A.: Basic many-valued logic. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, 2nd edn, vol. 2, pp. 249–295. Springer (2001)

  10. Prior, A.N.: The runabout inference-ticket. Analysis 21(2), 38–39 (1960)

    Article  Google Scholar 

  11. Avron, A., Lev, I.: Canonical propositional Gentzen-type systems. In: Gor, R., Leitsch, A., Nipkow, T. (eds.) Automated Reasoning. Lecture Notes in Computer Science, vol. 2083, pp. 529–544. Springer Berlin/Heidelberg (2001)

    Chapter  Google Scholar 

  12. Avron, A.: Non-deterministic semantics for families of paraconsistent logics. In: Beziau, J.Y., Carnielli, W.A., Gabbay, D.M. (eds.) Studies in Logic. Handbook of Paraconsistency, vol. 9, pp. 285–320. College Publications (2007)

  13. Carnielli, W.A., Coniglio, M.E., Marcos, J.: Logics of formal inconsistency. In: Gabbay, M.A., Guenthner, F. (eds.) Handbook of Philosophical Logic, 2nd edn, vol. 14, pp. 15–107. Springer (2007)

  14. Ciabattoni, A., Terui, K.: Towards a semantic characterization of cut-elimination. Stud. Log. 82, 95–119 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  15. Ciabattoni, A., Galatos, N., Terui, K.: Algebraic proof theory for substructural logics: cut-elimination and completions. Ann. Pure Appl. Logic 163(3), 266–290 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  16. Avron, A., Lahav, O.: On constructive connectives and systems. Log. Methods Comput. Sci. 6(4) (2010)

  17. Miller, D., Pimentel, E.: Using linear logic to reason about sequent systems. In: Proceedings of TABLEAUX 2002, LNAI 2381, pp. 2–23. Springer (2002)

  18. Nigam, V., Pimentel, E., Reis, G.: Specifying proof systems in linear logic with subexponentials. Electron Notes Theor. Comput. Sci. 269, 109–123 (2011)

    Article  MathSciNet  Google Scholar 

  19. Sano, K.: Sound and complete tree-sequent calculus for inquisitive logic. In: Ono, H., Kanazawa, M., Queiroz, R. (eds.) Logic, Language, Information and Computation. Lecture Notes in Computer Science, vol. 5514, pp. 365–378. Springer Berlin/Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Vienna University of Technology, Wien, Austria

    Matthias Baaz & Anna Zamansky

  2. Tel Aviv University, Tel Aviv, Israel

    Ori Lahav

Authors
  1. Matthias Baaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ori Lahav
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anna Zamansky
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ori Lahav.

Additional information

The second author is supported by The Israel Science Foundation (grant no. 280-10) and by FWF START Y544-N23.

The third author is supported by The European Community’s Seventh Framework Programme (FP7/2007-2013) under grant agreement no. 252314.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baaz, M., Lahav, O. & Zamansky, A. Finite-valued Semantics for Canonical Labelled Calculi. J Autom Reasoning 51, 401–430 (2013). https://doi.org/10.1007/s10817-013-9273-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-013-9273-x

Keywords

Search

Navigation