Fixed-point theory in the varieties Dn

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The varieties of lattices Dn, n ≥ 0, were introduced in [Nat90] and studied later in [Sem05]. These varieties might be considered as generalizations of the variety of distributive lattices which, as a matter of fact, coincides with D0. It is well known that least and greatest fixed-points of terms are definable on distributive lattices; this is an immediate consequence of the fact that the equation φ2(⊥) = φ(⊥) holds on distributive lattices, for any lattice term φ(x). In this paper we propose a generalization of this fact by showing that the identity φn + 2(x) = φn + 1(x) holds in Dn, for any lattice term φ(χ) and for χ ∈ {⊤, ⊥}. Moreover, we prove that the equations φn + 1(χ) = φn (χ), χ = ⊥, ⊤, do not hold in the variety nor in the variety Dn ∩ Dnop, where Dnop is the variety containing the lattices Lop, for L ∈ D n. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Frittella, S., & Santocanale, L. (2014). Fixed-point theory in the varieties Dn. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8428 LNCS, pp. 446–462). Springer Verlag. https://doi.org/10.1007/978-3-319-06251-8_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free