Related papers: Cover Systems for the Modalities of Linear Logic
Modern categorical logic as well as the Kripke and topological models of intuitionistic logic suggest that the interpretation of ordinary "propositional" logic should in general be the logic of subsets of a given universe set. Partitions on…
Broadly speaking, there are two kinds of semantics-aware assistant systems for mathematics: proof assistants express the semantic in logic and emphasize deduction, and computer algebra systems express the semantics in programming languages…
We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…
We introduce the concept of a triangular representation of a Lie algebra, give a counterpart of Ado's theorem, and discuss $2$-irreducible triangular modules over a nonreductive Lie algebra.
Fractional calculus is a generalization of classical theories of integration and differentiation to arbitrary order (i.e., real or complex numbers). In the last two decades, this new mathematical modeling approach has been widely used to…
Floyd languages (FL), alias Operator Precedence Languages, have recently received renewed attention thanks to their closure properties and local parsability which allow one to apply automatic verification techniques (e.g. model checking)…
In this paper, we introduce the concept of a (lattice) skew Hilbert algebra as a natural generalization of Hilbert algebras. This notion allows a unified treatment of several structures of prominent importance for mathematical logic, e.g.…
There are many examples of dualities between topological spaces and algebras in the literature. Particularly, many of those examples come from the algebraic counterpart of a logical system, e.g, boolean and heyting algebras, MV-algebras,…
Monads are of interest both in semantics and in higher dimensional algebra. It turns out that the idea behind usual notion finitary monads (whose values on all sets can be computed from their values on finite sets) extends to a more general…
In this paper, we investigate arithmetical completeness with respect to finite Kripke models of quantified modal logic. We adapt the finite-model embedding techniques of Artemov and Japaridze to two settings involving finite Kripke models.…
In this paper, we tell a story about incompleteness in modal logic. The story weaves together a paper of van Benthem, `Syntactic aspects of modal incompleteness theorems,' and a longstanding open question: whether every normal modal logic…
The cylindrical algebraic covering method was originally proposed to decide the satisfiability of a set of non-linear real arithmetic constraints. We reformulate and extend the cylindrical algebraic covering method to allow for checking the…
This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete…
This paper presents a new system of logic, LF, that is intended to be used as the foundation of the formalization of science. That is, deductive validity according to LF is to be used as the criterion for assessing what follows from the…
The multimodal Lambek calculus is an extension of the Lambek calculus that includes several product operations (some of them being commutative or/and associative), unary modalities, and corresponding residual implications. In this work, we…
The definition of a dilute braid-monoid algebra is briefly reviewed. The construction of solvable vertex and interaction-round-a-face models built on representations of the dilute Temperley-Lieb and Birman-Wenzl-Murakami algebras is…
We present algebraic semantics for the classical logic of proofs based on Boolean algebras. We also extend the language of the logic of proofs in order to have a Boolean structure on justification terms and equality predicate on terms. In…
This paper reveals a categorical equivalence connecting two distinct quantum logic structures. The first is the orthomodular lattice, an algebraic system designed to formalize the properties of quantum systems. The second is a finitary…
(1) Let 1\leq k\leq \omega. Call an atom structure \alpha weakly k neat representable, the term algebra is in \RCA_n\cap \Nr_n\CA_{n+k}, but the complex algebra is not representable. Call an atom structure neat if there is an atomic algebra…
We relate the cohomology of the Orlik-Solomon algebra of a discriminantal arrangement to the local system cohomology of the complement. The Orlik-Solomon algebra of such an arrangement (viewed as a complex) is shown to be a linear…