Skip to main content
Log in

Swap structures semantics for Ivlev-like modal logics

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

In 1988, J. Ivlev proposed some (non-normal) modal systems which are semantically characterized by four-valued non-deterministic matrices in the sense of A. Avron and I. Lev. Swap structures are multialgebras (a.k.a. hyperalgebras) of a special kind, which were introduced in 2016 by W. Carnielli and M. Coniglio in order to give a non-deterministic semantical account for several paraconsistent logics known as logics of formal inconsistency, which are not algebraizable by means of the standard techniques. Each swap structure induces naturally a non-deterministic matrix. The aim of this paper is to obtain a swap structures semantics for some Ivlev-like modal systems proposed in 2015 by M. Coniglio, L. Fariñas del Cerro and N. Peron. Completeness results will be stated by means of the notion of Lindenbaum–Tarski swap structures, which constitute a natural generalization to multialgebras of the concept of Lindenbaum–Tarski algebras.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. This notation makes sense, provided that the set \(\varXi \) of generators will keep fixed along this paper.

  2. Avron and his collaborators use in Avron and Lev (2001), Avron (2005) and Avron and Zamansky (2011) the term legal valuation to refer to valuations over an Nmatrix.

  3. As observed in Sect. 1, Kearns restricts the valuations over the Nmatrices in order to deal with the necessitation rule.

  4. This terminology is inspired by its use in computer science to refer to states.

  5. Here \(\lnot \) represents the paraconsistent negation of a given LFI, while \({\circ }\) represents a consistency operator w.r.t. \(\lnot \). See, for instance, Carnielli and Coniglio 2016 for more information about LFIs.

  6. Recall that, in any Boolean algebra, \(a \supset b = 1\) iff \(a \le b\).

References

  • Avron A (2005) Non-deterministic matrices and modular semantics of rules. In: Beziau J-Y (ed) Logica universalis: towards a general theory of logic. Birkhäuser, Basel, pp 149–167

    Chapter  Google Scholar 

  • Avron A, Konikowska B (2005) Multi-valued calculi for logics based on non-determinism. Log J IGPL 13(4):365–387

    Article  MathSciNet  MATH  Google Scholar 

  • Avron A, Lev I (2001) Canonical propositional Gentzen-type systems. In: Goré R, Leitsch A, Nipkow T (eds) International joint conference on automated reasoning, IJCAR 2001. Lecture notes in computer science, vol 2083. Springer, Berlin, pp 529–544. https://doi.org/10.1007/3-540-45744-5_45

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Avron A, Zamansky A (2011) Non-deterministic semantics for logical systems. In: Gabbay DM, Guenthner F (eds) Handbook of philosophical logic. volume 16 of handbook of philosophical logic. Springer, Dordrecht, pp 227–304

    Google Scholar 

  • Carnielli W, Coniglio ME (2016) Paraconsistent logic: consistency, contradiction and negation. Logic, epistemology, and the unity of science, vol 40. Springer, Cham

    MATH  Google Scholar 

  • Coniglio ME, Fariñas del Cerro L, Peron NM (2015) Finite non-deterministic semantics for some modal systems. J Appl Non Class Log 25(1):20–45

    Article  MathSciNet  MATH  Google Scholar 

  • Coniglio ME, Fariñas del Cerro L, Peron NM (2016) Errata and addenda to “Finite non-deterministic semantics for some modal systems”. J Appl Non Class Log 26(4):336–345

    Article  MathSciNet  MATH  Google Scholar 

  • Coniglio ME, Figallo-Orellano A, Golzio AC (2018) Non-deterministic algebraization of logics by swap structures. Log J IGPL. https://doi.org/10.1093/jigpal/jzy072

  • Ivlev J (1988) A semantics for modal calculi. Bull Sect Log 17(3–4):114–121

    MathSciNet  MATH  Google Scholar 

  • Kearns JT (1981) Modal semantics without possible worlds. J Symb Log 46(1):77–86

    Article  MathSciNet  MATH  Google Scholar 

  • Marty F (1934) Sur une généralisation de la notion de groupe. In: Proceedings of 8th congress mathematiciens, Scandinaves, pp 45–49

  • Omori H, Skurt D (2016) More modal semantics without possible worlds. IfCoLog J Log Appl 3(5):815–846

    Google Scholar 

  • Rescher N (1962) Quasi-truth-functional systems of propositional logic. J Symb Log 27(1):1–10

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to thank to the anonymous referees for their insightful comments and suggestions, which helped us to improve the overall quality of the paper. Marcelo E. Coniglio was financially supported by an individual research Grant from CNPq, Brazil (308524/2014-4). Ana Claudia Golzio was financially supported by scholarship Grant from FAPESP, Brazil (2013/04568-1), and by a post-doctoral Grant from CNPq, Brazil (150064/2018-7).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marcelo E. Coniglio.

Ethics declarations

Conflict of interest

Marcelo E. Coniglio declares that he has no conflict of interest. Ana Claudia Golzio declares that she has no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by C. Noguera.

Dedicated to Lluis Godo, an outstanding scientist and an amazing person.

Publisher's Note

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

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Coniglio, M.E., Golzio, A.C. Swap structures semantics for Ivlev-like modal logics. Soft Comput 23, 2243–2254 (2019). https://doi.org/10.1007/s00500-018-03707-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-018-03707-4

Keywords

Navigation