Related papers: Strongly Complete Logics for Coalgebras
We investigate the representation and complete representation classes for algebras of partial functions with the signature of relative complement and domain restriction. We provide and prove the correctness of a finite equational…
Let K be a variety of (commutative, integral) residuated lattices. The substructural logic usually associated with K is an algebraizable logic that has K as its equivalent algebraic semantics, and is a logic that preserves truth, i.e., 1 is…
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…
We give a specific cylinder functor for semifree dg categories. This allows us to construct a homotopy colimit functor explicitly. These two functors are "computable", specifically, the constructed cylinder functor sends a dg category of…
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…
We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…
We present a new method, the Subdivision Construction, for proving the finite model property (the fmp) for broad classes of modal logics and modal rule systems. The construction builds on the framework of stable canonical rules, and…
Universal continuous calculi are defined and it is shown that for every finite tuple of pairwise commuting Hermitian elements of a Su*-algebra (an ordered *-algebra that is symmetric, i.e. "strictly" positive elements are invertible, and…
Program correctness (in imperative and functional programming) splits in logic programming into correctness and completeness. Completeness means that a program produces all the answers required by its specification. Little work has been…
This paper investigates the logical strength of completeness theorems for modal propositional logic within second-order arithmetic. We demonstrate that the weak completeness theorem for modal propositional logic is provable in…
We present positive coalgebraic logic in full generality, and show how to obtain a positive coalgebraic logic from a boolean one. On the model side this involves canonically computing an endofunctor $T': Pos\to Pos$ from an endofunctor $T:…
This Paper investigate sequent calculi for certain weak subintuitionistic logics. We establish that weakening and contraction are height-preserving admissible for each of these calculi, and we provide a syntactic proof for the admissibility…
In this survey, we first present basic facts on A-infinity algebras and modules including their use in describing triangulated categories. Then we describe the Quillen model approach to A-infinity structures following K. Lefevre's thesis.…
We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…
Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…
The paper studies the containment companion of a logic $\vdash$. This consists of the consequence relation $\vdash^{r}$ which satisfies all the inferences of $\vdash$, where the variables of the conclusion are \emph{contained} into those of…
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…
We extend Lawvere-Pitts prop-categories (aka. hyperdoctrines) to develop a general framework for providing "algebraic" semantics for nonclassical first-order logics. This framework includes a natural notion of substitution, which allows…
We give conditions on a finitary endofunctor of a finitely accessible category to admit a final coalgebra. Our conditions always apply to the case of a finitary endofunctor of a locally finitely presentable (l.f.p.) category and they bring…
Fair termination is the property of programs that may diverge "in principle" but that terminate "in practice", i.e. under suitable fairness assumptions concerning the resolution of non-deterministic choices. We study a conservative…