
Source
Available from: staff.science.uva.nl
[Show abstract]
[Hide abstract]
ABSTRACT:
Lattices have many applications in mathematics and logic, in which they occur together with additional operations. For example, in applications of Hilbert spaces, one is often con cerned with the lattice of closed subspaces of a fixed space. This lattice is not distributive, but there is an operation taking a given subspace to its orthogonal subspace. More gen erally, ortholattices are lattices with a unary operation ( )y that is involutive (a = ayy), sends finite joins to meets and for which a and ay are complements. Bounded modal lat tices (L;_;^; 0; 1; ;2) are models of (not necessarily distributive) modal logic, where and 2 are unary operations that preserve finite join and finite meet, respectively, and represent possible and necessary. Bounded latticeordered monoids are bounded lattices with an associative binary operation and an identity element 1. In these examples it is postulated that the additional operations "preserve structure" in various different senses. Orthocomplementation sends finite joins to meets (and finite meets to joins). The modal operators preserve finite joins and finite meets, respectively. Similarly, the monoid oper ation distribute over finite joins. Bounded residuated lattices are bounded latticeordered monoids with two further operationsn, = that interact with via the universally quantified residuation law:
Algebra Universalis 05/2014; 71(3). DOI:10.1007/s0001201402752 · 0.55 Impact Factor

Source
Available from: de.arxiv.org
[Show abstract]
[Hide abstract]
ABSTRACT:
Modular lattices, introduced by R. Dedekind, are an important subvariety of
lattices that includes all distributive lattices. Heitzig and Reinhold
developed an algorithm to enumerate, up to isomorphism, all finite lattices up
to size 18. Here we adapt and improve this algorithm to construct and count
modular lattices up to size 23, semimodular lattices up to size 22, and
lattices of size 19. We also show that $2^{n3}$ is a lower bound for the
number of nonisomorphic modular lattices of size $n$.

[Show abstract]
[Hide abstract]
ABSTRACT:
Residuated frames provide relational semantics for substructural logics and are a natural generalization of Kripke frames in intuitionistic and modal logic, and of phase spaces in linear logic. We explore the connection between Gentzen systems and residuated frames and illustrate how,frames provide a uniform treatment for semantic proofs of cutelimination, the finite model property and the finite embeddability property. We use our results to prove the decidability of the equational and/or universal theory of several vari eties of residuated latticeordered groupoids, including the variety of involutive FLalgebras. Substructural logics and their algebraic formulation as varieties of residuated
Transactions of the American Mathematical Society 01/2013; 365(3):12191249. DOI:10.1090/S000299472012055735 · 1.10 Impact Factor

[Show abstract]
[Hide abstract]
ABSTRACT:
This paper studies generalizations of relation algebras to residuated lattices with a unary De Morgan operation. Several new examples of such algebras are presented, and it is shown that many basic results on relation algebras hold in this wider setting. The variety qRA of quasi relation algebras is defined and shown to be a conservative expansion of involutive FLalgebras. Our main result is that equations in qRA and several of its subvarieties can be decided by a Gentzen system, and that these varieties are generated by their finite members.
Algebra Universalis 01/2013; 69(1). DOI:10.1007/s000120120215y · 0.55 Impact Factor

[Show abstract]
[Hide abstract]
ABSTRACT:
It is proved that any latticeordered pregroup that satisfies an identity of the form x
ll···l
= x
rr···r
(for the same number of l,r
operations on each side) has a lattice reduct that is distributive. It follows that every such ℓpregroup is embedded in an ℓpregroup of residuated and dually residuated maps on a chain.
Algebra Universalis 10/2012; 68(12). DOI:10.1007/s0001201201997 · 0.55 Impact Factor

Studia Logica 01/2012; 100(66). · 0.33 Impact Factor

[Show abstract]
[Hide abstract]
ABSTRACT:
This chapter serves the rest of the book: all later chapters presuppose it. It introduces the calculus of binary relations,
and relates it to basic concepts and results from lattice theory, universal algebra, category theory and logic. It also fixes
the notation and terminology to be used in the rest of the book. Our aim here is to write in a way accessible to readers who
desire a gentle introduction to the subject of relational methods. Other readers may prefer to go on to further chapters,
only referring back to Chapt. 1 as needed.
07/2011: pages 121;

Source
Available from: Peter Jipsen
[Show abstract]
[Hide abstract]
ABSTRACT:
The poset product construction is used to derive embedding theorems for several classes of generalized basic logic algebras (GBLalgebras). In particular it is shown that every npotent GBLalgebra is embedded in a poset product of finite npotent MVchains, and every normal GBLalgebra is embedded in a poset product of totally ordered GMValgebras. Representable normal GBLalgebras have poset product embeddings where the poset is a root system. We also give a Conrad–Harvey–Hollandstyle embedding theorem for commutative GBLalgebras, where the poset factors are the real numbers extended with −∞. Finally, an explicit construction of a generic commutative GBLalgebra is given, and it is shown that every normal GBLalgebra embeds in the conucleus image of a GMValgebra.
Journal of Pure and Applied Algebra 09/2010; 214(9):15591575. DOI:10.1016/j.jpaa.2009.11.015 · 0.58 Impact Factor

Source
Available from: Peter Jipsen
Peter Jipsen
[Show abstract]
[Hide abstract]
ABSTRACT:
It is shown that the Boolean center of complemented elements in a bounded in tegral residuated lattice characterizes direct decompositions. Generalizing both Boolean products and poset sums of residuated lattices, the concepts of poset product, Priestley product and Esakia product of algebras are defined and used to prove decomposition theorems for various ordered algebras. In particular, we show that FLwalgebras decompose as a poset product over any finite set of join irreducible strongly central elements, and that bounded npotent GBLalgebras are represented as Esakia products of simple npotent MValgebras.
Annals of Pure and Applied Logic 11/2009; 161:228234. DOI:10.1016/j.apal.2009.05.005 · 0.45 Impact Factor

Source
Available from: Peter Jipsen
[Show abstract]
[Hide abstract]
ABSTRACT:
Generalized basic logic algebras (GBLalgebras for short) have been introduced in [JT02] as a generalization of Hájek’s BLalgebras,
and constitute a bridge between algebraic logic and ℓgroups. In this paper we investigate normal GBLalgebras, that is, integral
GBLalgebras in which every filter is normal. For these structures we prove an analogue of Blok and Ferreirim’s [BF00] ordinal
sum decomposition theorem. This result allows us to derive many interesting consequences, such as the decidability of the
universal theory of commutative GBLalgebras, the fact that npotent GBLalgebras are commutative, and a representation theorem for finite GBLalgebras as poset sums of GMValgebras,
a result which generalizes Di Nola and Lettieri’s [DL03] representation of finite BLalgebras.
Algebra Universalis 05/2009; 60(4):381404. DOI:10.1007/s0001200921064 · 0.55 Impact Factor

Source
Available from: Peter Jipsen
[Show abstract]
[Hide abstract]
ABSTRACT:
We axiomatise and study operations for relational domain and antidomain on semigroups and monoids. We relate this approach with previous axiomatisations for semirings, partial transformation semi groups and dynamic predicate logic.
Relations and Kleene Algebra in Computer Science, 11th International Conference on Relational Methods in Computer Science, RelMiCS 2009, and 6th International Conference on Applications of Kleene Algebra, AKA 2009, Doha, Qatar, November 15, 2009. Proceedings; 01/2009

Source
Available from: math.chapman.edu
Peter Jipsen

Source
Available from: Peter Jipsen
[Show abstract]
[Hide abstract]
ABSTRACT:
Petr Hajek identified the logic BL, that was later shown to be the logic of continuous tnorms on the unit interval, and defined the corresponding algebraic models, BLalgebras, in the context of residuated lattices. The defining characteristics of BLalgebras are representability and divisibility. In this short note we survey re cent developments in the study of divisible residuated lattices and attribute the inspiration for this investigation to Petr Hajek.
Witnessed yearsessays in honour of Petr Hájek, 01/2009: pages 303327; Coll. Publ., London.

Source
Available from: www1.chapman.edu
[Show abstract]
[Hide abstract]
ABSTRACT:
The two main objectives of this paper are (a) to prove purely topological duality theorems for semilattices and bounded lattices, and (b) to show that the topological duality from (a) provides a construction of canonical extensions of bounded lattices. In previously known dualities for semilattices and bounded lattices, the dual spaces are compact 0dimensional spaces with additional algebraic structure. For example, semilattices are dual to 0dimensional compact semilattices. Here we establish dual categories in which the spaces are characterized purely in topological terms, with no additional algebraic structure. Thus the results can be seen as generalizing Stone's duality for distributive lattices rather than Priestley's. The paper is the first of two parts. The main objective of the sequel is to establish a characterization of lattice expansions, i.e., lattices with additional operations, in the topological setting built in this paper.
Algebra Universalis 01/2009; 71(2). DOI:10.1007/s0001201402672 · 0.55 Impact Factor

Source
Available from: Peter Jipsen
[Show abstract]
[Hide abstract]
ABSTRACT:
This note gives an explicit construction of the onegenerated free domain semiring. In particular it is proved that the elements can be represented uniquely by finite antichains in the poset of finite strictly decreasing sequences of nonnegative integers. It is also shown that this domain semiring can be represented by sets of binary relations with union, composition and relational domain as operations.
Relations and Kleene Algebra in Computer Science, 10th International Conference on Relational Methods in Computer Science, and 5th International Conference on Applications of Kleene Algebra, RelMiCS/AKA 2008, Frauenwörth, Germany, April 711, 2008. Proceedings; 01/2008

Source
Available from: math.chapman.edu
Peter Jipsen

Source
Available from: compstat2004.cuni.cz
01/2007: pages xxii+509; Elsevier B. V., Amsterdam., ISBN: 9780444521415

Source
Available from: Peter Jipsen
[Show abstract]
[Hide abstract]
ABSTRACT:
A generalized BL  algebra (or GBLalgebra for short) is a residuated lattice that satisfies the identities
xL y = ((xL y)/y)y = y(y\(xL y)) x\Lambda y = ((x\Lambda y)/y)y = y(y\backslash (x\Lambda y))
. It is shown that all finite GBLalgebras are commutative, hence they can be constructed by iterating ordinal sums and direct
products of Wajsberg hoops. We also observe that the idempotents in a GBLalgebra form a subalgebra of elements that commute
with all other elements.
Subsequently we construct subdirectly irreducible noncommutative integral GBLalgebras that are not ordinal sums of generalized
MValgebras. We also give equational bases for the varieties generated by such algebras. The construction provides a new way
of orderembedding the lattice of
l {\ell }
group varieties into the lattice of varieties of integral GBLalgebras.
The results of this paper also apply to pseudoBL algebras.
Algebra Universalis 01/2006; 55(2):227238. DOI:10.1007/s0001200619606 · 0.55 Impact Factor

Source
Available from: Peter Jipsen
[Show abstract]
[Hide abstract]
ABSTRACT:
We determine the minimal extension of the sequence h0,1,1,...,1,2i. This completes and extends the work of K. M. Koh, started in 1970, and solves Problem 15 in the survey on pn sequences and free spectra (GK92). The results involve the inves tigation of some minimal expansions of semilattices.
International Journal of Algebra and Computation 08/2004; 14(4):465477. DOI:10.1142/S0218196704001852 · 0.44 Impact Factor

Source
Available from: Peter Jipsen
[Show abstract]
[Hide abstract]
ABSTRACT:
We will give here a purely algebraic proof of the cut elimination theorem for various sequent systems. Our basic idea is to introduce mathematical structures, called Gentzen structures, for a given sequent system without cut, and then to show the completeness of the sequent system without cut with respect to the class of algebras for the sequent system with cut, by using the quasicompletion of these Gentzen structures. It is shown that the quasicompletion is a generalization of the MacNeille completion. Moreover, the finite model property is obtained for many cases, by modifying our completeness proof. This is an algebraic presentation of the proof of the finite model property discussed by Lafont [12] and OkadaTerui [17].
Studia Logica 07/2004; DOI:10.1023/B:STUD.0000037127.15182.2a · 0.33 Impact Factor