Related papers: Multiplicative logic in arithmetic
The foundational character of certain algebraic structures as Boolean algebras and Heyting algebras is rooted in their potential to model classical and constructive logic, respectively. In this paper we discuss the contributions of…
We continue to develop a research line initiated in \cite{wollic22}, studying I/O logic from an algebraic approach based on subordination algebras. We introduce the classes of slanted (co-)Heyting algebras as equivalent presentations of…
We give an introduction to logic tailored for algebraists, explaining how proofs in linear logic can be viewed as algorithms for constructing morphisms in symmetric closed monoidal categories with additional structure. This is made explicit…
In this short note we relate some known properties of propositional calculus to purely algebraic considerations of a Boolean algebra. Classes of formulas of propositional calculus are considered as elements of a Boolean algebra. As such…
In this paper we investigate two logics from an algebraic point of view. The two logics are: MALL (multiplicative-additive Linear Logic) and LL (classical Linear Logic). Both logics turn out to be strongly algebraizable in the sense of Blok…
Axiomatizing mathematical structures is a goal of Mathematical Logic. Axiomatizability of the theories of some structures have turned out to be quite difficult and challenging, and some remain open. However axiomatization of some…
The collection of open sets of a topological space forms a Heyting algebra, which leads to the idea of a Heyting algebra as a generalized topological space. In fact, a sober topological space may be reconstructed from its locale of open…
This work contributes to the domains of Boolean algebra and of Bayesian probability, by proposing an algebraic extension of Boolean algebras, which implements an operator for the Bayesian conditional inference and is closed under this…
We introduce a geometric model of shallow multiplicative exponential linear logic (MELL) using the Hilbert scheme. Building on previous work interpreting multiplicative linear logic proofs as systems of linear equations, we show that…
This work presents an operational and geometric approach to logic. It starts from the multilinear elective decomposition of binary logical functions in the original form introduced by George Boole. A justification on historical grounds is…
Given a complete Heyting algebra we construct an algebraic tensor triangulated category whose Bousfield lattice is the Booleanization of the given Heyting algebra. As a consequence we deduce that any complete Boolean algebra is the…
We show that a proof in multiplicative linear logic can be represented as a decorated surface, such that two proofs are logically equivalent just when their surfaces are geometrically equivalent. This is an extended abstract for…
In the logic programming paradigm, a program is defined by a set of methods, each of which can be executed when specific conditions are met during the current state of an execution. The semantics of these programs can be elegantly…
Scaled Boolean algebras are a category of mathematical objects that arose from attempts to understand why the conventional rules of probability should hold when probabilities are construed, not as frequencies or proportions or the like, but…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
In this paper we study projective algebras in varieties of (bounded) commutative integral residuated lattices from an algebraic (as opposed to categorical) point of view. In particular we use a well-established construction in residuated…
We classify all apartness relations definable in propositional logics extending intuitionistic logic using Heyting algebra semantics. We show that every Heyting algebra which contains a non-trivial apartness term satisfies the weak law of…
This paper presents an investigation on the structure of conditional events and on the probability measures which arise naturally in this context. In particular we introduce a construction which defines a (finite) {\em Boolean algebra of…
We develop a theory of multiplicative functions (with values inside or on the unit circle) in arithmetic progressions analogous to the well-known theory of primes in arithmetic progressions.
If $A$ is an algebra and \bgt is a tolerance on $A$, then $A/\bgt$ is a multi-algebra in a natural way. We give an example to show that not every multi-algebra arises in this manner. We slightly generalize the construction of $A/\bgt$ and…