37 research outputs found
Canonical formulas for k-potent commutative, integral, residuated lattices
Canonical formulas are a powerful tool for studying intuitionistic and modal
logics. Actually, they provide a uniform and semantic way to axiomatise all
extensions of intuitionistic logic and all modal logics above K4. Although the
method originally hinged on the relational semantics of those logics, recently
it has been completely recast in algebraic terms. In this new perspective
canonical formulas are built from a finite subdirectly irreducible algebra by
describing completely the behaviour of some operations and only partially the
behaviour of some others. In this paper we export the machinery of canonical
formulas to substructural logics by introducing canonical formulas for
-potent, commutative, integral, residuated lattices (-).
We show that any subvariety of - is axiomatised by canonical
formulas. The paper ends with some applications and examples.Comment: Some typo corrected and additional comments adde
Closure algebras of depth two with extremal relations: Their frames, logics, and structural completeness
We consider varieties generated by finite closure algebras whose canonical
relations have two levels, and whose restriction to a level is an "extremal"
relation, i.e. the identity or the universal relation. The corresponding logics
have frames of depth two, in which a level consists of a set of simple clusters
or of one cluster with one or more elements
Relational lattices via duality
The natural join and the inner union combine in different ways tables of a
relational database. Tropashko [18] observed that these two operations are the
meet and join in a class of lattices-called the relational lattices- and
proposed lattice theory as an alternative algebraic approach to databases.
Aiming at query optimization, Litak et al. [12] initiated the study of the
equational theory of these lattices. We carry on with this project, making use
of the duality theory developed in [16]. The contributions of this paper are as
follows. Let A be a set of column's names and D be a set of cell values; we
characterize the dual space of the relational lattice R(D, A) by means of a
generalized ultrametric space, whose elements are the functions from A to D,
with the P (A)-valued distance being the Hamming one but lifted to subsets of
A. We use the dual space to present an equational axiomatization of these
lattices that reflects the combinatorial properties of these generalized
ultrametric spaces: symmetry and pairwise completeness. Finally, we argue that
these equations correspond to combinatorial properties of the dual spaces of
lattices, in a technical sense analogous of correspondence theory in modal
logic. In particular, this leads to an exact characterization of the finite
lattices satisfying these equations.Comment: Coalgebraic Methods in Computer Science 2016, Apr 2016, Eindhoven,
Netherland
Changing a semantics: opportunism or courage?
The generalized models for higher-order logics introduced by Leon Henkin, and
their multiple offspring over the years, have become a standard tool in many
areas of logic. Even so, discussion has persisted about their technical status,
and perhaps even their conceptual legitimacy. This paper gives a systematic
view of generalized model techniques, discusses what they mean in mathematical
and philosophical terms, and presents a few technical themes and results about
their role in algebraic representation, calibrating provability, lowering
complexity, understanding fixed-point logics, and achieving set-theoretic
absoluteness. We also show how thinking about Henkin's approach to semantics of
logical systems in this generality can yield new results, dispelling the
impression of adhocness. This paper is dedicated to Leon Henkin, a deep
logician who has changed the way we all work, while also being an always open,
modest, and encouraging colleague and friend.Comment: 27 pages. To appear in: The life and work of Leon Henkin: Essays on
his contributions (Studies in Universal Logic) eds: Manzano, M., Sain, I. and
Alonso, E., 201