Quasi-Nelson; Or, Non-involutive Nelson Algebras

  • Chapter
  • First Online:
Algebraic Perspectives on Substructural Logics

Part of the book series: Trends in Logic ((TREN,volume 55))

  • 168 Accesses

Abstract

We introduce a generalisation of Nelson algebras having a not necessarily involutive negation. We suggest dubbing this class quasi-Nelson algebras, in analogy with quasi-De Morgan lattices, which are a non-involutive generalisation of De Morgan lattices due to Sankappanavar. We show that, similarly to the involutive case, our new class of algebras can be equivalently presented as (1) quasi-Nelson residuated lattices, i.e. models of the well-known Full Lambek calculus with exchange and weakening, extended with the Nelson axiom; (2) non-involutive twist-structures, i.e. special binary products of Heyting algebras, which generalise a well-known construction for representing algebraic models of Nelson’s constructive logic with strong negation; (3) quasi-Nelson algebras, i.e. models of non-involutive Nelson logic, viewed as an axiomatic expansion of the negation-free fragment of intuitionistic logic; (4) the class of bounded commutative integral residuated lattices which satisfy a universal algebraic property introduced in a previous paper, and called \((\mathbf {0}, \mathbf {1})\)-congruence orderability therein. The equivalence of the four presentations, and in particular the extension of the twist-structure representation to the non-involutive case, is the main technical result of the paper. We hope, however, that the main impact of the paper will lie in the possibility of opening new ways to: (1) obtain deeper insights into the distinguishing feature of Nelson’s logic (i.e. the Nelson axiom) and its algebraic counterpart (the Nelson identity); and (2) be able to investigate certain purely algebraic properties (such as 3-potency and \((\mathbf {0}, \mathbf {1})\)-congruence orderability) in a more general setting.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info
Hardcover Book
USD 119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free ship** 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.

    By an extension (of a given logic) we mean a stronger logic over the same language; by an expansion we mean a logic obtained by adding new connectives.

  2. 2.

    In the sense of this paper, the algebraic counterpart of a finitary and finitely (Blok-Pigozzi) algebraisable deductive system \(\mathbf {S}\) is the equivalent quasivariety semantics of \(\mathbf {S}\). All deductive systems considered in this paper, including \(\mathbf {N3}\), are Blok-Pigozzi algebraisable.

  3. 3.

    Formally, by ‘quasi-Nelson logic’ we mean the (necessarily unique) deductive system whose algebraic counterpart is the class of quasi-Nelson algebras. For a finite (Hilbert-style) presentation of this deductive system, see [24]. See also Remark 3.

  4. 4.

    Loosely speaking, by this we mean that the three definitions can be seen as alternative presentations of the “same” class of algebras in a different algebraic language, analogous to the presentation of Boolean algebras as Boolean rings or that of MV-algebras as certain lattice-ordered groups.

  5. 5.

    It is also useful to keep in mind that, since we are dealing with algebraisable logics, the most relevant features of logical systems are reflected by (and can therefore be derived from) their algebraic models.

  6. 6.

    Throughout the paper it will be useful for the reader to bear in mind that Nelson residuated lattices are term equivalent to the above-mentioned classes of Nelson algebras and to \(\mathbf {N3}\)-lattices.

  7. 7.

    Bounded implicative meet-semilattices are the \(\langle \wedge , \rightarrow , 0 \rangle \)-subreducts of Heyting algebras, corresponding to the conjunction-implication-negation fragment of intuitionistic logic. Thus, in particular, the \(\langle \wedge , \rightarrow , 0 \rangle \)-reduct of every Heyting algebra is a bounded implicative meet-semilattice.

  8. 8.

    This and the other unexplained terms are from Sankappanavar’s terminology: see  [37, Definition 2.1] and  [37, Definition 2.6].

References

  1. R. Balbes, P. Dwinger, Distributive Lattices (University of Missouri Press, Columbia, 1974)

    Google Scholar 

  2. W.J. Blok, D. Pigozzi, On the structure of varieties with equationally definable principal congruences II. Algebr. Univers. 18, 334–379 (1984)

    Article  Google Scholar 

  3. W.J. Blok, D. Pigozzi, Algebraizable logics. Mem. Am. Math. Soc. 77(396) (1989)

    Google Scholar 

  4. W.J. Blok, J.G. Raftery, Assertionally equivalent quasivarieties. Int. J. Algebr. Comput. 18, 589–681 (2008)

    Article  Google Scholar 

  5. F. Bou, U. Rivieccio, The logic of distributive bilattices. Log. J. IGPL Interes. Group Pure Appl. Log. 19, 183–216 (2011)

    Google Scholar 

  6. S. Burris, H.P. Sankappanavar, A Course in Universal Algebra, vol. 78, Graduate Texts in Mathematics (Springer, New York, 1981)

    Google Scholar 

  7. M. Busaniche, R. Cignoli, Constructive logic with strong negation as a substructural logic. J. Log. Comput. 20, 761–793 (2010)

    Article  Google Scholar 

  8. L. Cabrer, H. Priestley, A general framework for product representations: bilattices and beyond. Log. J. IGPL, Interes. Group Pure Appl. Log. 23, 816–841 (2015)

    Google Scholar 

  9. R. Cignoli, The class of Kleene algebras satisfying an interpolation property and Nelson algebras. Algebr. Univers. 23, 262–292 (1986)

    Article  Google Scholar 

  10. J. Czelakowski, D. Pigozzi, Fregean logics. Ann. Pure Appl. Log. 127, 17–76 (2004)

    Article  Google Scholar 

  11. N. Galatos, P. Jipsen, T. Kowalski, H. Ono, Residuated Lattices: An Algebraic Glimpse at Substructural Logics (Elsevier, 2007)

    Google Scholar 

  12. G. Grätzer, Universal Algebra, 2nd edn. (Springer, New York, 2008)

    Google Scholar 

  13. F. Greco, F. Liang, A. Moshier, A. Palmigiano, Multi-type display calculus for semi De Morgan logic, in Logic, Language, Information, and Computation. Proceedings of  WoLLIC 2017, ed. by J. Kennedy, R. de Queiroz. Lecture Notes in Computer Science, vol. 10388 (Springer, Berlin, Heidelberg, 2017), pp. 199–215

    Google Scholar 

  14. M.M. Fidel, An algebraic study of a propositional system of Nelson, in Mathematical Logic, Proceedings of the First Brazilian Conference, ed. by A.I. Arruda, N.C.A. Da Costa, R. Chaqui. Lecture Notes in Pure and Applied Mathematics, vol. 39 (Marcel Dekker, New York and Basel, 1978) pp. 99–117

    Google Scholar 

  15. N. Galatos, J.G. Raftery, Adding involution to residuated structures. Stud. Log. 77, 181–207 (2004)

    Article  Google Scholar 

  16. H.P. Gumm, A. Ursini, Ideals in universal algebras. Algebr. Univers. 19, 45–54 (1984)

    Article  Google Scholar 

  17. J.B. Hart, L. Rafter, C. Tsinakis, The structure of commutative residuated lattices. Int. J. Algebr. Comput. 12, 509–523 (2002)

    Article  Google Scholar 

  18. A.-N. Hsieh, J.G. Raftery, Conserving involution in residuated structures. Math. Log. Q. 53, 583–609 (2007)

    Article  Google Scholar 

  19. P.M. Idziak, K. Słomczyńska, A. Wroński, Fregean varieties. Int. J. Algebr. Comput. 19, 595–645 (2009)

    Article  Google Scholar 

  20. T. Jakl, A. Jung, A. Pultr, Bitopology and four-valued logic. Electron. Notes Theor. Comput. Sci. 325, 201–219 (2016)

    Article  Google Scholar 

  21. U. Rivieccio, P. Maia, A. Jung, Non-involutive twist-structures. Log. J. IGPL. Interes. Group Pure Appl. Log. https://doi.org/10.1093/jigpal/jzy070

  22. J.A. Kalman, Lattices with involution. Trans. Am. Math. Soc. 87, 458–491 (1958)

    Article  Google Scholar 

  23. A. Ledda, F. Paoli, M. Pra Baldi, Algebraic analysis of demodalised analytic implication. J. Philos. Log. 48, 957–979 (2019)

    Google Scholar 

  24. F. Liang, T. Nascimento, Algebraic semantics for quasi-Nelson logic, in Logic, Language, Information, and Computation. Proceedings of WoLLIC 2019, ed. by R. Iemhoff, M. Moortgat, R. de Queiroz. Lecture Notes in Computer Science, vol. 11541 (Springer, Berlin, Heidelberg, 2019), pp. 450–466

    Google Scholar 

  25. R.N. McKenzie, G.F. McNulty, W.F. Taylor, Algebras, Lattices, Varieties, vol. 1, The Wadsworth & Brooks/Cole Mathematics Series. (Wadsworth & Brooks/Cole Advanced Books & Software, Monterey, 1987)

    Google Scholar 

  26. T. Moraschini, J.G. Raftery, On prevarieties of logic. Algebr. Univers. 80(3), Article 30, 11 (2019)

    Google Scholar 

  27. T. Nascimento, U. Rivieccio, J. Marcos, M. Spinks, Nelson’s logic \(\cal{S}\). Log. J. IGPL. Interes. Group Pure Appl. Log. https://doi.org/10.1093/jigpal/jzaa015

  28. T. Nascimento, U. Rivieccio, J. Marcos, M. Spinks, Algebraic semantics for Nelson’s logic \(\cal{S} \), in Logic, Language, Information, and Computation. Proceedings of WoLLIC 2018, ed. by L. Moss, R. de Queiroz, M. Martinez. Lecture Notes in Computer Science, vol. 10944 (Springer, Berlin, Heidelberg, 2018), pp. 271–288

    Google Scholar 

  29. D. Nelson, Constructible falsity. J. Symb. Log. 14, 16–26 (1949)

    Article  Google Scholar 

  30. D. Nelson, Negation and separation of concepts in constructive systems, in Constructivity in Mathematics, vol. 39, Studies in Logic and the Foundations of Mathematics, ed. by A. Heyting (North-Holland, Amsterdam, 1959), pp. 205–225

    Google Scholar 

  31. S.P. Odintsov, Algebraic semantics for paraconsistent Nelson’s logic. J. Log. Comput. 13, 453–468 (2003)

    Google Scholar 

  32. S.P. Odintsov, On the representation of N4-lattices. Stud. Log. 76, 385–405 (2004)

    Article  Google Scholar 

  33. S.P. Odintsov, Constructive Negations and Paraconsistency, vol. 26, Trends in Logic \(\cdot \) Studia Logica Library (Springer Science+Business Media B.V., 2008)

    Google Scholar 

  34. H. Rasiowa, An Algebraic Approach to Non-Classical Logics, vol. 78, Studies in Logic and the Foundations of Mathematics (North-Holland Publishing Company, Amsterdam, 1974)

    Google Scholar 

  35. U. Rivieccio, Representation of De Morgan and (semi-)Kleene lattices. Soft Comput. 24(12), 8685–8716 (2020)

    Google Scholar 

  36. U. Rivieccio, M. Spinks, Quasi-Nelson algebras. Electron. Notes Theor. Comput. Sci. 344, 169–188 (2019)

    Google Scholar 

  37. H.P. Sankappanavar, Semi-De Morgan algebras. J. Symb. Log. 52, 712–724 (1987)

    Article  Google Scholar 

  38. A. Sendlewski, Some investigations of varieties of \(\cal{N}\)-lattices. Stud. Log. 43, 257–280 (1984)

    Google Scholar 

  39. A. Sendlewski, Nelson algebras through Heyting ones, I. Stud. Log. 49, 105–126 (1990)

    Google Scholar 

  40. M. Spinks, U. Rivieccio, T. Nascimento, Compatibly involutive residuated lattices and the Nelson identity. Soft Comput. 23, 2297–2320 (2019)

    Google Scholar 

  41. M. Spinks, R. Veroff, Constructive logic with strong negation is a substructural logic, I. Stud. Log. 88, 325–348 (2008)

    Google Scholar 

  42. M. Spinks, R. Veroff, Constructive logic with strong negation is a substructural logic, II. Stud. Log. 89, 401–425 (2008)

    Google Scholar 

  43. M. Spinks, R. Veroff, Paraconsistent constructive logic with strong negation as a contraction-free relevant logic, in Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, ed. by J. Czelakowski. Outstanding Contributions to Logic, vol. 16 (Springer International Publishing AG, Cham, 2018), pp. 323–379

    Google Scholar 

  44. D. Vakarelov, Notes on \(\cal{N}\)-lattices and constructive logic with strong negation. Stud. Log. 36, 109–125 (1977)

    Article  Google Scholar 

  45. R. Wójcicki, Theory of Logical Calculi, vol. 199, Synthese Library (Kluwer Academic Publishers, Dordrecht, 1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Umberto Rivieccio .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Rivieccio, U., Spinks, M. (2021). Quasi-Nelson; Or, Non-involutive Nelson Algebras. In: Fazio, D., Ledda, A., Paoli, F. (eds) Algebraic Perspectives on Substructural Logics. Trends in Logic, vol 55. Springer, Cham. https://doi.org/10.1007/978-3-030-52163-9_8

Download citation

Publish with us

Policies and ethics

Navigation