Skip to main content

Advertisement

SpringerLink
  1. Home
  2. Studia Logica
  3. Article
Kripke Semantics for Intuitionistic Łukasiewicz Logic
Download PDF
Your article has downloaded

Similar articles being viewed by others

Slider with three articles shown per slide. Use the Previous and Next buttons to navigate the slides or the slide controller buttons at the end to navigate through each slide.

Simplified Kripke Semantics for K45-Like Gödel Modal Logics and Its Axiomatic Extensions

08 April 2022

Ricardo Oscar Rodriguez, Olim Frits Tuyt, … Lluís Godo

Double Negation Semantics for Generalisations of Heyting Algebras

25 May 2020

Rob Arthan & Paulo Oliva

Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter

17 July 2018

Mikhail Rybakov & Dmitry Shkatov

Games and Bisimulations for Intuitionistic First-Order Kripke Models

18 January 2021

Małgorzata Kruszelnicka

Non-distributive Relatives of ETL and NFL

10 March 2020

Daniil Kozhemiachenko

Intuitionistic Propositional Logic with Galois Negations

26 September 2022

Minghui Ma & Guiying Li

From Semantic Games to Provability: The Case of Gödel Logic

25 October 2021

Alexandra Pavlova, Robert Freiman & Timo Lang

Wright’s Strict Finitistic Logic in the Classical Metatheory: The Propositional Case

21 January 2023

Takahiro Yamada

Kripke-Completeness and Cut-elimination Theorems for Intuitionistic Paradefinite Logics With and Without Quasi-Explosion

18 April 2020

Norihiro Kamide

Download PDF
  • Open Access
  • Published: 21 April 2020

Kripke Semantics for Intuitionistic Łukasiewicz Logic

  • A. Lewis-Smith1,
  • P. Oliva1 &
  • E. Robinson1 

Studia Logica volume 109, pages 313–339 (2021)Cite this article

  • 558 Accesses

  • 1 Citations

  • 3 Altmetric

  • Metrics details

Abstract

This paper proposes a generalization of the Kripke semantics of intuitionistic logic IL appropriate for intuitionistic Łukasiewicz logic IŁL —a logic in the intersection between IL and (classical) Łukasiewicz logic. This generalised Kripke semantics is based on the poset sum construction, used in Bova and Montagna (Theoret Comput Sci 410(12):1143–1158, 2009). to show the decidability (and PSPACE completeness) of the quasiequational theory of commutative, integral and bounded GBL algebras. The main idea is that \(w \Vdash \psi \)—which for ILis a relation between worlds w and formulas \(\psi \), and can be seen as a function taking values in the booleans \((w \Vdash \psi ) \in {{\mathbb {B}}}\)—becomes a function taking values in the unit interval \((w \Vdash \psi ) \in [0,1]\). An appropriate monotonicity restriction (which we call sloping functions) needs to be put on such functions in order to ensure soundness and completeness of the semantics.

Download to read the full article text

Working on a manuscript?

Avoid the most common mistakes and prepare your manuscript for journal editors.

Learn more

References

  1. Bova, S., and F. Montagna, Proof search in Hájek’s Basic Logic. ACM Trans. Comput. Log. 9:21:1–21:26, 2008.

  2. Bova, S., and F. Montagna, The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete. Theoretical Computer Science 410(12):1143–1158, 2009.

    Article  Google Scholar 

  3. Ciabattoni, A., On Urquhart’s C logic. In 30th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2000, Portland, Oregon, USA, May 23-25, 2000, Proceedings IEEE Computer Society, 2000, pp. 113–120.

  4. Ciabattoni, A., and C. G. Fermüller, Hypersequents as a uniform framework for Urquhart’s C, MTL and related logics. In 31st IEEE International Symposium on Multiple-Valued Logic, ISMVL 2001, Warsaw, Poland, May 22-24, 2001, Proceedings IEEE Computer Society, 2001, pp. 227–232.

  5. Cignoli, R., F. Esteva, L. Godo, and A. Torrens. Basic fuzzy logic is the logic of continuous t-norms and their residua. Soft Computing 4(2):106–112, 2000.

    Article  Google Scholar 

  6. Hájek, P., Basic fuzzy logic and BL-algebras. Soft Computing 2(3):124–128, 1998.

    Article  Google Scholar 

  7. Jipsen, P., and F. Montagna, On the structure of generalized BL-algebras. Algebra Universalis 55(2):227–238, 2006.

    Article  Google Scholar 

  8. Kripke, S. A., Semantical analysis of intuitionistic logic I. In J.N. Crossley and M.A.E. Dummett, (eds.), Formal Systems and Recursive Functions, volume 40 of Studies in Logic and the Foundations of Mathematics, Elsevier, 1965, pp. 92–130.

  9. Kułacka, A., Tableau calculus for basic fuzzy logic BL. In A. Laurent, O. Strauss, A. Bouchon-Meunier, and R. R. Yager, (eds.), Information Processing and Management of Uncertainty in Knowledge-Based Systems. Springer International Publishing, Cham, 2014, pp. 325–334.

  10. Kułacka, A., Propositional Fuzzy Logics: Tableaux and Strong Completeness. PhD thesis, Imperial College London, London, UK, 2017.

  11. Kułacka, A., D. Pattinson, and L. Schröder, Syntactic labelled tableaux for Łukasiewicz fuzzy ALC. In IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013, pp. 962–968.

  12. Méndez, J. M., and F. Salto, Urquhart’s C with intuitionistic negation: Dummett’s LC without the contraction axiom. Notre Dame J. Formal Logic 36(3):407–413, 07 1995.

  13. Negri, S., Proof analysis in modal logic. Journal of Philosophical Logic 34(5-6):507–544, 2005.

    Article  Google Scholar 

  14. Negri, S., and J. von Plato, Proof Analysis: A Contribution to Hilbert’s Last Problem. Cambridge University Press, 2011.

  15. Olivetti, N., Tableaux for Łukasiewicz infinite-valued logic. Studia Logica 73(1):81–111, 2003.

    Article  Google Scholar 

Download references

Acknowledgements

We would like to thank Rob Arthan for several interesting and useful discussions about Łukasiewicz logic and Kripke semantics, the anonymous referee various helpful comments and suggestions, and for pointing out that in an earlier version of this paper we were not careful enough in distinguishing our logic IŁL from the logic \({\mathbf{GBL}}_{\text {ewf}}\), and Reuben Rowe for a careful proofreading and several comments. Edmund Robinson acknowledges the support of UK EPRSC Research Grant EP/R006865/1: Interface Reasoning for Interacting Systems (IRIS).

Author information

Authors and Affiliations

  1. School of Electronic Engineering and Computer Science, Queen Mary University of London, Mile End Road, London, E1 4NS, UK

    A. Lewis-Smith, P. Oliva & E. Robinson

Authors
  1. A. Lewis-Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Oliva
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. Robinson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to P. Oliva.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Presented by Daniele Mundici

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Lewis-Smith, A., Oliva, P. & Robinson, E. Kripke Semantics for Intuitionistic Łukasiewicz Logic. Stud Logica 109, 313–339 (2021). https://doi.org/10.1007/s11225-020-09908-z

Download citation

  • Received: 18 June 2019

  • Published: 21 April 2020

  • Issue Date: April 2021

  • DOI: https://doi.org/10.1007/s11225-020-09908-z

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Keywords

  • Łukasiewicz logic
  • Intuitionistic Łukasiewicz logic
  • Kripke semantics
  • GBL algebras
Download PDF

Working on a manuscript?

Avoid the most common mistakes and prepare your manuscript for journal editors.

Learn more

Advertisement

Over 10 million scientific documents at your fingertips

Switch Edition
  • Academic Edition
  • Corporate Edition
  • Home
  • Impressum
  • Legal information
  • Privacy statement
  • California Privacy Statement
  • How we use cookies
  • Manage cookies/Do not sell my data
  • Accessibility
  • FAQ
  • Contact us
  • Affiliate program

Not affiliated

Springer Nature

© 2023 Springer Nature Switzerland AG. Part of Springer Nature.