Join-completions of partially ordered algebras

, , &
Annals of Pure and Applied Logic 171 (10):102842 (2020)
  Copy   BIBTEX

Abstract

We present a systematic study of join-extensions and join-completions of partially ordered algebras, which naturally leads to a refined and simplified treatment of fundamental results and constructions in the theory of ordered structures ranging from properties of the Dedekind–MacNeille completion to the proof of the finite embeddability property for a number of varieties of lattice-ordered algebras.

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2020.102842

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,475

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Non-commutative logical algebras and algebraic quantales.Wolfgang Rump & Yi Chuan Yang - 2014 - Annals of Pure and Applied Logic 165 (2):759-785.
Partially ordered connectives.Gabriel Sandu & Jouko Väänänen - 1992 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):361-372.
A simple construction of representable relation algebras with non‐representable completions.Tarek Sayed Ahmed - 2009 - Mathematical Logic Quarterly 55 (3):237-244.
Meet-completions and representations of ordered domain algebras.Robin Hirsch & R. Egrot - unknown
Meet-completions and ordered domain algebras.R. Egrot & Robin Hirsch - 2015 - Logic Journal of the IGPL 23 (4):584-600.
Advances in the theory of μŁΠ algebras.Enrico Marchioni & Luca Spada - 2011 - Logic Journal of the IGPL 19 (3):476-489.
Hierarchies of Partially Ordered Connectives and Quantifiers.Michał Krynicki - 1993 - Mathematical Logic Quarterly 39 (1):287-294.
Lattice Ordered O -Minimal Structures.Carlo Toffalori - 1998 - Notre Dame Journal of Formal Logic 39 (4):447-463.
Generalizations of Boolean products for lattice-ordered algebras.Peter Jipsen - 2010 - Annals of Pure and Applied Logic 161 (2):228-234.
On canonicity and completions of weakly representable relation algebras.Ian Hodkinson & Szabolcs Mikulás - 2012 - Journal of Symbolic Logic 77 (1):245-262.
Decidability and finite axiomatizability of theories of ℵ0-categorical partially ordered sets.James H. Schmerl - 1981 - Journal of Symbolic Logic 46 (1):101 - 120.
Definable sets in Stone algebras.Guohua Wu, Niandong Shi & Lei Chen - 2016 - Archive for Mathematical Logic 55 (5-6):749-757.
Constructive completions of ordered sets, groups and fields.Erik Palmgren - 2005 - Annals of Pure and Applied Logic 135 (1-3):243-262.
On Birkhoff’s Common Abstraction Problem.F. Paoli & C. Tsinakis - 2012 - Studia Logica 100 (6):1079-1105.
Semi-post algebras.Nguyen Cat Ho & Helena Rasiowa - 1987 - Studia Logica 46 (2):149 - 160.

Analytics

Added to PP
2020-05-24

Downloads
17 (#860,469)

6 months
9 (#299,476)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Protoalgebraic Logics.Janusz Czelakowski - 2003 - Studia Logica 74 (1):313-342.
The logic of bunched implications.Peter W. O'Hearn & David J. Pym - 1999 - Bulletin of Symbolic Logic 5 (2):215-244.

View all 12 references / Add more references