Related papers: Formal Concept Analysis and Homotopical Combinator…
By an $\ell$-group $G$ we mean a lattice-ordered abelian group. This paper is concerned with the category $\FP$ of finitely presented {\it unital} $\ell$-groups, those $\ell$-groups having a distinguished order-unit $u$. Using the duality…
We consider a family U of finite universes. The second order quantifier Q_R, means for each u in U quantifying over a set of n(R)-place relations isomorphic to a given relation. We define a natural partial order on such quantifiers called…
We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables. They transform a given structure into…
It is known that a (concept) lattice contains an n-dimensional Boolean suborder if and only if the context contains an n-dimensional contra-nominal scale as subcontext. In this work, we investigate more closely the interplay between the…
Relation algebra and its reducts provide us with a strong tool for reasoning about nondeterministic programs and their partial correctness. Demonic calculus, introduced to model the behaviour of a machine where the demon is in control of…
In this work, we present a brief but insightful overview of the gauge theories, which are defined on $ n $-dimensional lattices by using finite gauge groups, in order to show how they can be interpreted as a Hamiltonian system with…
We provide conditions under which a modular function defined on a semilattice $X$ and with values in a commutative group is homomorphic to a modular function on a lattice $L$ for any embedding $X\hookrightarrow L$.
We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as an interpreted vocabulary over an infinite domain. This formalism was denoted embedded finite model theory in the past.…
We introduce the logic $\sf ITL^e$, an intuitionistic temporal logic based on structures $(W,\preccurlyeq,S)$, where $\preccurlyeq$ is used to interpret intuitionistic implication and $S$ is a $\preccurlyeq$-monotone function used to…
In this paper we initiate the study of racks from the combined perspective of combinatorics and finite group theory. A rack R is a set with a self-distributive binary operation. We study the combinatorics of the partially ordered set {\cal…
For every semilattice $\mathcal{A}=(A,+)$, the set $\mathrm{End}(\mathcal{A})$ of its endomorphisms forms a semiring under pointwise addition and composition. We prove that that if $\mathcal{A}$ is finite, then the endomorphism semiring…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
In two papers we noted that in common practice many algebraic constructions are defined only `up to isomorphism' rather than explicitly. We mentioned some questions raised by this fact, and we gave some partial answers. The present paper…
We investigate the theory of finite observables, i.e., resolutions of the finite-dimensional identity by means of positive operators, that have a physical interpretation in terms of measurement schemes. We focus on extremal and rank-one…
It is a deep fact that the homotopy classification of topological manifolds is convariantly functorial. In other words, a map from a topological manifold M to another N naturally induces a map from the structure set S(M) to S(N). We extend…
We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…
We develop team semantics for Linear Temporal Logic (LTL) to express hyperproperties, which have recently been identified as a key concept in the verification of information flow properties. Conceptually, we consider an asynchronous and a…
The main theorem shows that if M is an irreducible compact connected orientable 3-manifold with non-empty boundary, then the classifying space BDiff(M rel dM) of the space of diffeomorphisms of M which restrict to the identity map on…
Let G be an unramified reductive group over a non archimedian local field F. The so-called "Langlands Fundamental Lemma" is a family of conjectural identities between orbital integrals for G(F) and orbital integrals for endoscopic groups of…