Related papers: Adding an Implication to Logics of Perfect Paradef…
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…
Separation Logic with inductive definitions is a well-known approach for deductive verification of programs that manipulate dynamic data structures. Deciding verification conditions in this context is usually based on user-provided lemmas…
This paper considers an idempotent and symmetrical algebraic structure as well as some closely related concept. A special notion of determinant is introduced and a Cramer formula is derived for a class of limit systems derived from the…
We say that a Lie (super)algebra is ''symmetric'' if with every root (with respect to the maximal torus) it has the opposite root of the same multiplicity. Over algebraically closed fields of positive characteristics (up to 7 or 11, enough…
Given an evolution algebra associated to a connected finite graph $\Gamma$, we exhibit a free action of the group of symmetries of $\Gamma$ on the set of automorphisms of the algebra. This allows us to explicitly describe this set and we…
We show that the theories of partially ordered sets, lattices, semilattices, Boolean algebras, Heyting algebras with a further coarser partial order, or a linearization, or an auxiliary relation have the strong amalgamation property,…
We show that the class of Metropolis-Rota implication algebras can be given a universal axiomatization using an operation closely related to composition in oriented matroids. Lastly we describe the role of our new operation in the collapse…
In an impressive series of papers, Krivine showed at the edge of the last decade how classical realizability provides a surprising technique to build models for classical theories. In particular, he proved that classical realizability…
We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…
We define the formal affine Demazure algebra and formal affine Hecke algebra associated to a Kac-Moody root system. We prove the structure theorems of these algebras, hence, extending several result and construction (presentation in terms…
Let $k$ be an arbitrary field and $d$ a positive integer. For each degenerate symmetric or antisymmetric bilinear form $M$ on $k^{d}$ we determine the structure of the Lie algebra of matrices that preserve $M$, and of the Lie algebra of…
Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…
A large family of relations among multiple zeta values may be described using the combinatorics of shuffle and quasi-shuffle algebras. While the structure of shuffle algebras have been well understood for some time now, quasi-shuffle…
We extend classical Propositional Logic (PL) by adding a new primitive binary connective $\varphi|\psi$, intended to represent the "superposition" of sentences $\varphi$ and $\psi$, an operation motivated by the corresponding notion of…
We investigate the properties of positive definite and positive semi-definite symmetric matrices within the framework of symmetrized tropical algebra, an extension of tropical algebra adapted to ordered valued fields. We focus on the…
In this paper we consider the class of truth-functional many-valued logics with a finite set of truth-values. The main result of this paper is the development of a new \emph{binary} sequent calculi (each sequent is a pair of formulae) for…
Formal mathematics and computer science proofs are formalized using Hilbert-Russell-style logical systems which are designed to not admit paradoxes and self-refencing reasoning. These logical systems are natural way to describe and reason…
Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications. It was the idea of Elgot to base denotational semantics on iterative theories…
We establish a novel connection between two research areas in non-classical logics which have been developed independently of each other so far: on the one hand, input/output logic, introduced within a research program developing logical…
In this paper we extend the idea of integration to generic algebras. In particular we concentrate over a class of algebras, that we will call self-conjugated, having the property of possessing equivalent right and left multiplication…