Related papers: Representing Conjunctive Deductions by Disjunctive…
Optics, aka functional references, are classes of tools that allow composable access into compound data structures. Usually defined as programming language libraries, they provide combinators to manipulate different shapes of data such as…
The goal of this note is to compare two notions, one coming from the theory of rewrite systems and the other from proof theory: confluence and cut elimination. We show that to each rewrite system on terms, we can associate a logical system:…
Category theory is the language of homological algebra, allowing us to state broadly applicable theorems and results without needing to specify the details for every instance of analogous objects. However, authors often stray from the realm…
We prove an analogue of Voiculescu's theorem: Relative bicommutant of a separable unital subalgebra $A$ of an ultraproduct of simple unital C*-algebras is equal to $A$.
We study unitary representations of semidirect products of a compact quantum group with a finite group. We give a classification of all irreducible unitary representations, a description of the conjugate representation of irreducible…
We develop a bicategorical setup in which one can speak about adjoint 1-morphisms even in the absence of genuine identity 1-morphisms. We also investigate which part of 2-representation theory of 2-categories extends to this new setup.
We call product generator of an additive category a fixed object satisfying the property that every other object is a direct factor of a product of copies of it. In this paper we start with an additive category with products and images,…
The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the sentence that…
We show that either of the two reasonable choices for the category of compact quantum groups is nice enough to allow for a plethora of universal constructions, all obtained "by abstract nonsense" via the adjoint functor theorem. This…
For a finite dimensional algebra $A$, we prove that the bounded homotopy category of projective $A$-modules and the bounded derived category of $A$-modules are dual to each other via certain categories of locally-finite cohomological…
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…
This paper presents a soundness and completeness proof for propositional intuitionistic calculus with respect to the semantics of computability logic. The latter interprets formulas as interactive computational problems, formalized as games…
We present trichotomy results characterizing the complexity of reasoning with disjunctive logic programs. To this end, we introduce a certain definition schema for classes of programs based on a set of allowed arities of rules. We show that…
In traditional semantics for classical logic and its extensions, such as modal logic, propositions are interpreted as subsets of a set, as in discrete duality, or as clopen sets of a Stone space, as in topological duality. A point in such a…
We consider a family of Hecke C*-algebras which can be realised as crossed products by semigroups of endomorphisms. We show by dilating representations of the semigroup crossed product that the category of representations of the Hecke…
The propositional product logic is one of the basic fuzzy logics with continuous t-norms, exploiting the multiplication t-norm on the unit interval [0,1]. Our aim is to combine well-established automated deduction (theorem proving) with…
Given a monoidal category $\mathscr{C}$ with an object $J$, we construct a monoidal category $\mathscr{C}[J^{\vee}]$ by freely adjoining a right dual $J^{\vee}$ to $J$. We show that the canonical strong monoidal functor $\Omega :…
This paper establishes and proves representation theorems for cumulative propositional dependence logic and for cumulative propositional logic with team semantics. Cumulative logics are famously given by System C. For propositional…
Decompositions of higher-order tensors into sums of simple terms are ubiquitous. We show that in order to verify that two tensors are generated by the same (possibly scaled) terms it is not necessary to compute the individual…
Category theory has foundational importance because it provides conceptual lenses to characterize what is important and universal in mathematics---with adjunctions being the primary lense. If adjunctions are so important in mathematics,…