Skip to main content

Effective Finite-Valued Semantics for Labelled Calculi

  • Conference paper

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

Abstract

We provide a systematic and modular method to define non-deterministic finite-valued semantics for a natural and very general family of canonical labelled calculi, of which many previously studied sequent and labelled calculi are particular instances. This semantics is effective, in the sense that it naturally leads to a decision procedure for these calculi. It is then applied to provide simple decidable semantic criteria for crucial syntactic properties of these calculi, namely (strong) analyticity and cut-admissibility.

Keywords

  • Truth Table
  • Sequent Calculus
  • Logical Connective
  • Paraconsistent Logic
  • Introduction Rule

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.A.: Multi-valued Semantics: Why and How. Studia Logica 92, 163–182 (2009)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Avron, A., Lev, I.: Non-deterministic Multiple-valued Structures. Journal of Logic and Computation 15 (2005)

    Google Scholar 

  3. Avron, A., Zamansky, A.: Non-deterministic Semantics for Logical Systems. Handbook of Philosophical Logic 16, 227–304 (2011)

    CrossRef  Google Scholar 

  4. Avron, A., Zamansky, A.: Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 31–45. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  5. Avron, A., Konikowska, B., Zamansky, A.: Modular Construction of Cut-Free Sequent Calculi for Paraconsistent Logics. To Appear in Proceedings of Logic in Computer Science (LICS 2012) (2012)

    Google Scholar 

  6. Baaz, M., Fermüller, C.G., Salzer, G., Zach, R.: Labelled Calculi and Finite-valued Logics. Studia Logica 61, 7–33 (1998)

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Ciabattoni, A., Terui, K.: Towards a semantic characterization of cut elimination. Studia Logica 82(1), 95–119 (2006)

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Gabbay, D.M.: Labelled Deductive Systems, Volume 1. Oxford Logic Guides, vol. 33. Clarendon Press/Oxford Science Publications, Oxford (1996)

    Google Scholar 

  9. Lahav, O.: Non-deterministic Matrices for Semi-canonical Deduction Systems. To Appear in Proceedings of IEEE 42nd International Symposium on Multiple-Valued Logic (ISMVL 2012) (2012)

    Google Scholar 

  10. Sano, K.: Sound and Complete Tree-Sequent Calculus for Inquisitive Logic. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds.) WoLLIC 2009. LNCS, vol. 5514, pp. 365–378. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  11. Stachniak, Z.: Resolution Proof Systems: An Algebraic Theory. Kluwer Academic Publishers (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baaz, M., Lahav, O., Zamansky, A. (2012). Effective Finite-Valued Semantics for Labelled Calculi. In: Gramlich, B., Miller, D., Sattler, U. (eds) Automated Reasoning. IJCAR 2012. Lecture Notes in Computer Science(), vol 7364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31365-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31365-3_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31364-6

  • Online ISBN: 978-3-642-31365-3

  • eBook Packages: Computer ScienceComputer Science (R0)