Related papers: Weak Kleene Algebra is Sound and (Possibly) Comple…
We give a formal treatment of simple type theories, such as the simply-typed $\lambda$-calculus, using the framework of abstract clones. Abstract clones traditionally describe first-order structures, but by equipping them with additional…
Kleene algebra with tests (KAT) was introduced as an algebraic structure to model and reason about classic imperative programs, i.e. sequences of discrete transitions guarded by Boolean tests. This paper introduces two generalisations of…
The coalgebraic modelling of alternating automata and of probabilistic automata has long been obstructed by the absence of distributive laws of the powerset monad over itself, respectively of the powerset monad over the finite distribution…
We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type theory modelling the structure of a cartesian closed bicategory and show that its syntactic model satisfies an appropriate universal…
The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are non-null in a…
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 the paper we introduce a weak set theory $\mathsf{H}_{<\omega}$ . A formalization of arithmetic on finite von Neumann ordinals gives an embedding of arithmetical language into this theory. We show that $\mathsf{H}_{<\omega}$ proves a…
We consider Kleene and Stone algebras defined on the completion DM(RS) of the ordered set of rough sets induced by a reflexive relation. We focus on cases where the completion forms a spatial and completely distributive lattice. We derive…
Weak affine light typing (WALT) assigns light affine linear formulae as types to a subset of lambda-terms in System F. WALT is poly-time sound: if a lambda-term M has type in WALT, M can be evaluated with a polynomial cost in the dimension…
We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…
We investigate completions of partial combinatory algebras (pcas), in particular of Kleene's second model $\mathcal{K}_2$ and generalizations thereof. We consider weak and strong notions of embeddability and completion that have been…
We prove a localization theorem for affine $W$-algebras in the spirit of Beilinson--Bernstein and Kashiwara--Tanisaki. More precisely, for any non-critical regular weight $\lambda$, we identify $\lambda$-monodromic Whittaker $D$-modules on…
We introduce the notion of weak Lie 2-bialgebra. Roughly, a weak Lie 2-bialgebra is a pair of compatible 2-term $L_\infty$-algebra structures on a vector space and its dual. The compatibility condition is described in terms of the big…
Let A be a commutative ring, and \a a weakly proregular ideal in A. This includes the noetherian case: if A is noetherian then any ideal in it is weakly proregular; but there are other interesting examples. In this paper we prove the MGM…
Arkani-Hamed and collaborators have recently shown that scattering amplitudes for colored theories can be expressed as integrals over combinatorial objects simply constructed from surfaces decorated by kinematic data. In this paper we…
We construct and study an algebraic theory which closely approximates the theory of power operations for Morava E-theory, extending previous work of Charles Rezk in a way that takes completions into account. These algebraic structures are…
We prove the long-standing conjecture on the coset construction of the minimal series principal $W$-algebras of $ADE$ types in full generality. We do this by first establishing Feigin's conjecture on the coset realization of the universal…
Multiple-conclusion Hilbert-style systems allow us to finitely axiomatize every logic defined by a finite matrix. Having obtained such axiomatizations for Paraconsistent Weak Kleene and Bochvar-Kleene logics, we modify them by replacing the…
In this expository article, we give a self-contained introduction to the wonderfully well-behaved class of pseudocompact algebras, focusing on the foundational classes of semisimple and separable algebras. We give characterizations of such…
Regular expressions are commonly understood in terms of their denotational semantics, that is, through formal languages -- the regular languages. This view is inductive in nature: two primitives are equivalent if they are constructed in the…