Skip to main content
Top
Published in: Soft Computing 2/2021

05-01-2021 | Foundations

A duality for two-sorted lattices

Authors: Umberto Rivieccio, Achim Jung

Published in: Soft Computing | Issue 2/2021

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

A series of representation theorems (some of which discovered very recently) present an alternative view of many classes of algebras related to non-classical logics (e.g. bilattices, semi-De Morgan, Nelson and quasi-Nelson algebras) as two-sorted algebras in the sense of many-sorted universal algebra. In all the above-mentioned examples, we are in fact dealing with a pair of lattices related by two meet-preserving maps. We use this insight to develop a Priestley-style duality for such structures, mainly building on the duality for meet-semilattices of G. Bezhanishvili and R. Jansana. Our approach simplifies all the existing dualities for these algebras and is applicable more generally; in particular, we show how it specialises to the class of quasi-Nelson algebras, which has not yet been studied from a duality point of view.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Footnotes
1
The notation \(\langle \mathbf {L} _+, \mathbf {L} _-, n, p \rangle \) originates in the literature on bilattices and bitopology (Jakl et al. 2016), in which \(\mathbf {L} _+\) and \(\mathbf {L} _-\) are viewed as truth value spaces corresponding to (resp.) positive and negative information concerning, say, a proposition. Thus, the map n (which has the lattice \(L_+\) as source and \(L_-\) as target) allows one to “translate” positive information into negative, and likewise, p provides a translation the other way round.
 
2
In classical propositional logic, \(\lnot (\lnot x \rightarrow \lnot y)\) is equivalent to \(\lnot (y\rightarrow x)\), hence our notation \(x \not \leftarrow y\).
 
3
Notice that \(\mathbf {B} _-\) has \(\vee \) as meet (whose residuum is \(\not \leftarrow \)) and \(\wedge \) as join.
 
4
As observed in Rivieccio and Spinks (2019) and Rivieccio and Spinks (2020), conditions (i)–(iii) entail that p also preserves the Heyting implication.
 
5
Abstractly, a Priestley space is defined as a compact ordered topological space \(\langle X, \tau , \le \rangle \) such that, for all \(x,y \in X\), if \(x \not \le y\), then there is a clopen up-set \(U \subseteq X\) with \(x \in U\) and \(y \notin U\). It follows that \(\langle X, \tau \rangle \) is a Stone space.
 
6
This is nevertheless a choice, different, for example, from the one made in Jakl et al. (2016, Definition 3.3).
 
7
Our formulation of (ii).1 is different from the one in Bezhanishvili and Jansana (2011, Definition 6.2), but the two are easily seen to be equivalent in our context. Also, we always require \(R_n\) and \(R_p\) to be total (Bezhanishvili and Jansana 2011, Definition 6.11) because our maps np preserve all lattice bounds.
 
Literature
go back to reference Balbes R, Dwinger P (1974) Distributive lattices. University of Missouri Press, ColumbiaMATH Balbes R, Dwinger P (1974) Distributive lattices. University of Missouri Press, ColumbiaMATH
go back to reference Blackburn P, de Rijke M, Venema Y (2001) Modal logic. Number 53 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge Blackburn P, de Rijke M, Venema Y (2001) Modal logic. Number 53 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge
go back to reference Cignoli R (1986) The class of Kleene algebras satisfying an interpolation property and Nelson algebras. Algebra Univ 23(3):262–292MathSciNetMATHCrossRef Cignoli R (1986) The class of Kleene algebras satisfying an interpolation property and Nelson algebras. Algebra Univ 23(3):262–292MathSciNetMATHCrossRef
go back to reference Davey BA (2013) The product representation theorem for interlaced pre-bilattices: some historical remarks. Algebra Univers 70(4):403–409MathSciNetMATHCrossRef Davey BA (2013) The product representation theorem for interlaced pre-bilattices: some historical remarks. Algebra Univers 70(4):403–409MathSciNetMATHCrossRef
go back to reference Esakia LL (1974) Topological Kripke models. Sov Math Dokl 15:147–151MATH Esakia LL (1974) Topological Kripke models. Sov Math Dokl 15:147–151MATH
go back to reference Frittella S, Greco G, Kurz A, Palmigiano A (2016) Multi-type display calculus for propositional dynamic logic. J Log Comput 26(6):2067–2104MathSciNetMATHCrossRef Frittella S, Greco G, Kurz A, Palmigiano A (2016) Multi-type display calculus for propositional dynamic logic. J Log Comput 26(6):2067–2104MathSciNetMATHCrossRef
go back to reference Frittella S, Greco G, Kurz A, Palmigiano A, Sikimić V (2014) Multi-type sequent calculi. In: Zawidski M, Indrzejczak A, Kaczmarek J (eds) Proceedings of trends in logic XIII (Lodz, Poland, 2–5 July 2014), volume 13. Lodz University Press, Lodz, pp 81–93 Frittella S, Greco G, Kurz A, Palmigiano A, Sikimić V (2014) Multi-type sequent calculi. In: Zawidski M, Indrzejczak A, Kaczmarek J (eds) Proceedings of trends in logic XIII (Lodz, Poland, 2–5 July 2014), volume 13. Lodz University Press, Lodz, pp 81–93
go back to reference Frittella S, Greco G, Kurz A, Palmigiano A, Sikimić V (2016) Multi-type display calculus for dynamic epistemic logic. J Log Comput 26(6):2067–2104MathSciNetMATHCrossRef Frittella S, Greco G, Kurz A, Palmigiano A, Sikimić V (2016) Multi-type display calculus for dynamic epistemic logic. J Log Comput 26(6):2067–2104MathSciNetMATHCrossRef
go back to reference Galatos N, Jipsen P, Kowalski T, Ono H (2007) Residuated Lattices: an algebraic glimpse at substructural logics, Studies in Logic and the Foundations of Mathematics, vol 151. Elsevier, AmsterdamMATH Galatos N, Jipsen P, Kowalski T, Ono H (2007) Residuated Lattices: an algebraic glimpse at substructural logics, Studies in Logic and the Foundations of Mathematics, vol 151. Elsevier, AmsterdamMATH
go back to reference Gehrke M, Van Gool SJ (2014) Distributive envelopes and topological duality for lattices via canonical extensions. Order 31(3):435–461MathSciNetMATHCrossRef Gehrke M, Van Gool SJ (2014) Distributive envelopes and topological duality for lattices via canonical extensions. Order 31(3):435–461MathSciNetMATHCrossRef
go back to reference Ginsberg ML (1988) Multivalued logics: a uniform approach to inference in artificial intelligence. Comput Intell 4:265–316CrossRef Ginsberg ML (1988) Multivalued logics: a uniform approach to inference in artificial intelligence. Comput Intell 4:265–316CrossRef
go back to reference Greco G, Palmigiano A (2017) Lattice logic properly displayed. In: Kennedy J, de Queiroz R (eds) Proceedings of the 24th workshop on logic language, information and computation (WoLLIC), volume LNCS 10388. Springer, Berlin, pp 153–169CrossRef Greco G, Palmigiano A (2017) Lattice logic properly displayed. In: Kennedy J, de Queiroz R (eds) Proceedings of the 24th workshop on logic language, information and computation (WoLLIC), volume LNCS 10388. Springer, Berlin, pp 153–169CrossRef
go back to reference Greco G, Liang F, Moshier MA, Palmigiano A (2017) Multi-type display calculus for semi De Morgan logic. In: WoLLIC, logic, language, information, and computation, pp 199–215 Greco G, Liang F, Moshier MA, Palmigiano A (2017) Multi-type display calculus for semi De Morgan logic. In: WoLLIC, logic, language, information, and computation, pp 199–215
go back to reference Halmos PR (1962) Algebraic logic. Chelsea Publ. Co., New YorkMATH Halmos PR (1962) Algebraic logic. Chelsea Publ. Co., New YorkMATH
go back to reference Jung A, Rivieccio U (2013) Kripke semantics for modal bilattice logic. In: 28th annual ACM/IEEE symposium on logic in computer science, LICS 2013, New Orleans, LA, USA, June 25–28, 2013, pp 438–447 Jung A, Rivieccio U (2013) Kripke semantics for modal bilattice logic. In: 28th annual ACM/IEEE symposium on logic in computer science, LICS 2013, New Orleans, LA, USA, June 25–28, 2013, pp 438–447
go back to reference Meinke K, Tucker JV (1992) Universal algebra. In: Abramsky S, Gabbay D, Maibaum T (eds) Handbook of logic in computer science, vol 1. Oxford University Press, Oxford, pp 189–411 Meinke K, Tucker JV (1992) Universal algebra. In: Abramsky S, Gabbay D, Maibaum T (eds) Handbook of logic in computer science, vol 1. Oxford University Press, Oxford, pp 189–411
go back to reference Rasiowa H (1974) An algebraic approach to non-classical logics, Studies in Logic and the Foundations of Mathematics, vol 78. North-Holland, AmsterdamMATH Rasiowa H (1974) An algebraic approach to non-classical logics, Studies in Logic and the Foundations of Mathematics, vol 78. North-Holland, AmsterdamMATH
go back to reference Rivieccio U (2020) Fragments of quasi-Nelson: two negations. J Appl Log 7(4):499–559 Rivieccio U (2020) Fragments of quasi-Nelson: two negations. J Appl Log 7(4):499–559
go back to reference Rivieccio U (2020) Representation of De Morgan and (semi-)Kleene lattices. Soft Comput 24(12):8685–8716CrossRef Rivieccio U (2020) Representation of De Morgan and (semi-)Kleene lattices. Soft Comput 24(12):8685–8716CrossRef
go back to reference Rivieccio U, Jansana R, Nascimento T (2020) Two dualities for weakly pseudo-complemented quasi-Kleene algebras. In: Lesot MJ et al (eds) Information processing and management of uncertainty in knowledge-based systems. IPMU 2020. Communications in Computer and Information Science, vol. 1239. Springer, Berlin, pp 634–653 Rivieccio U, Jansana R, Nascimento T (2020) Two dualities for weakly pseudo-complemented quasi-Kleene algebras. In: Lesot MJ et al (eds) Information processing and management of uncertainty in knowledge-based systems. IPMU 2020. Communications in Computer and Information Science, vol. 1239. Springer, Berlin, pp 634–653
go back to reference Rivieccio U, Spinks M (2020) Quasi-Nelson; or, non-involutive Nelson algebras. In: Fazio D, Ledda A, Paoli F (eds) Algebraic perspectives on substructural logics (Trends in Logic, 55). Springer, pp 133–168 Rivieccio U, Spinks M (2020) Quasi-Nelson; or, non-involutive Nelson algebras. In: Fazio D, Ledda A, Paoli F (eds) Algebraic perspectives on substructural logics (Trends in Logic, 55). Springer, pp 133–168
go back to reference Spinks M, Rivieccio U, Nascimento T (2019) Compatibly involutive residuated lattices and the Nelson identity. Soft Comput 23:2297–2320MATHCrossRef Spinks M, Rivieccio U, Nascimento T (2019) Compatibly involutive residuated lattices and the Nelson identity. Soft Comput 23:2297–2320MATHCrossRef
Metadata
Title
A duality for two-sorted lattices
Authors
Umberto Rivieccio
Achim Jung
Publication date
05-01-2021
Publisher
Springer Berlin Heidelberg
Published in
Soft Computing / Issue 2/2021
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-020-05482-7

Other articles of this Issue 2/2021

Soft Computing 2/2021 Go to the issue

Premium Partner