Peter Jipsen Chapman University, Orange
Chapman University, Orange
Algebra, Logic and Foundations of Mathematics, Theory of Computation
Ph. D.
Publications
 [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.44 Impact Factor 
Conference Paper: 14th International Conference, RAMiCS 2014
Relational and Algebraic Methods in Computer Science; 01/2014  [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$.Algebra Universalis 09/2013; 74(34). DOI:10.1007/s000120150348x · 0.44 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 02/2013; 69(1). DOI:10.1007/s000120120215y · 0.44 Impact Factor  [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 residuatedTransactions of the American Mathematical Society 01/2013; 365(33):12191249. DOI:10.1090/S000299472012055735 · 1.12 Impact Factor 
Article: Special Issue: Recent Developments related to Residuated Lattices and Substructural Logics Preface
Studia Logica 12/2012; 100(6):10591062. DOI:10.1007/s1122501294614 · 0.60 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.44 Impact Factor 
Conference Paper: Categories of Algebraic Contexts Equivalent to Idempotent Semirings and Domain Semirings
[Show abstract] [Hide abstract]
ABSTRACT: A categorical equivalence between algebraic contexts with relational morphisms and joinsemilattices with homomorphisms is presented and extended to idempotent semirings and domain semirings. These contexts are the Kripke structures for idempotent semirings and allow more efficient computations on finite models because they can be logarithmically smaller than the original semiring. Some examples and constructions such as matrix semirings are also considered.Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science; 09/2012 
Article: Preface
Studia Logica 01/2012; 100(66). · 0.60 Impact Factor 
Chapter: Background Material
[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.Relational Methods in Computer Science, 07/2011: pages 121; 
Article: Varieties of Lattices
[Show abstract] [Hide abstract]
ABSTRACT: An interesting problem in universal algebra is the connection between the internal structure of an algebra and the identities which it satisfies. The study of varieties of algebras provides some insight into this problem. Here we are concerned mainly with lattice varieties, about which a wealth of information has been obtained in the last twenty years. We begin with some preliminary results from universal algebra and lattice theory. The second chapter presents some properties of the lattice of all lattice subvarieties. Here we also discuss the important notion of a splitting pair of varieties and give several characterizations of the associated splitting lattice. The more detailed study of lattice varieties splits naturally into the study of modular lattice varieties and nonmodular lattice varieties, dealt with in the third and fourth chapter respectively. Among the results discussed there are Freese's theorem that the variety of all modular lattices is not generated by its finite members, and several results concerning the question which varieties cover a given variety. The fifth chapter contains a proof of Baker's finite basis theorem and some results about the join of finitely based lattice varieties. Included in the final chapter is a characterization of the amalgamation classes of certain congruence distributive varieties and the result that  [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.47 Impact Factor  [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(2):228234. DOI:10.1016/j.apal.2009.05.005 · 0.55 Impact Factor  [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.44 Impact Factor 

Article: Topological duality and lattice expansions, I: A topological construction of canonical extensions
[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.44 Impact Factor  [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. 
Conference Paper: Domain and Antidomain Semigroups
[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 
Conference Paper: The Structure of the OneGenerated Free Domain Semiring.
[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 
 Questions & Answers
 Open Reviews
 Research Feedback