Related papers: The G\"odel Fibration
We present a technique for deriving certain new natural dualities for any variety of algebras generated by a finite Heyting chain. The dualities we construct are tailored to admit a transparent translation to the more pictorial…
F-theory is perhaps the most general currently available approach to study non-perturbative string compactifications in their geometric, large radius regime. It opens up a wide and ever-growing range of applications and connections to…
Derived D-Geometry is considered as a convenient language for a coordinate-free investigation of nonlinear partial differential equations up to symmetries. One of the first issues one meets in the functor of points approach to derived…
Let p=tp(a/A) be a stationary type in an arbitrary finite rank stable theory, and P an A-invariant family of partial types. The following property is introduced and characterised: whenever c is definable over (A,a) and a is not algebraic…
We present a version of arithmetic in all finite types which allows for a definition of equality at higher types for which all congruence are derivable, for which the soundness of the Dialectica interpretation is provable inside the system…
This paper describes a computational framework for a grammar architecture in which different linguistic domains such as morphology, syntax, and semantics are treated not as separate components but compositional domains. Word and phrase…
There are infinitely many variants of the notion of Kan fibration that, together with suitable choices of cofibrations and the usual notion of weak equivalence of simplicial sets, satisfy Quillen's axioms for a homotopy model category. The…
Let $A$ be a star product on a symplectic manifold $(M,\omega_0)$, $\frac{1}{t}[\omega]$ its Fedosov class, where $\omega$ is a deformation of $\omega_0$. We prove that for a complex polarization of $\omega$ there exists a commutative…
Fiore and Hur recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a…
We study a many-valued generalization of Propositional Dynamic Logic where formulas in states and accessibility relations between states of a Kripke model are evaluated in a finite FL-algebra. One natural interpretation of this framework is…
Diffeological spaces are generalizations of smooth manifolds. In this paper, we study the homotopy theory of diffeological spaces. We begin by proving basic properties of the smooth homotopy groups that we will need later. Then we introduce…
We introduce the G\"odel Mirror, a formal system defined in Lean 4 that treats contradiction as a control signal for recursive structural evolution. Inspired by G\"odelian self-reference, our system's operational semantics encode symbolic…
A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…
Structural operational semantics can be studied at the general level of distributive laws of syntax over behaviour. This yields specification formats for well-behaved algebraic operations on final coalgebras, which are a domain for the…
Delta lenses are functors equipped with a suitable choice of lifts, generalising the notion of split opfibration. In recent work, delta lenses were characterised as the right class of an algebraic weak factorisation system. In this paper,…
A foundational theory of compositional categorical rewriting theory is presented, based on a collection of fibration-like properties that collectively induce and intrinsically structure the large collection of lemmata used in the proofs of…
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:…
We introduce the logics GLP(\Lambda), a generalization of Japaridze's polymodal provability logic GLP(\omega) where \Lambda is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall…
We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…
The familiar construction of categories of fractions, due to Gabriel and Zisman, allows one to invert a class W of arrows in a category in a universal way. Similarly, bicategories of fractions allow one to invert a collection of arrows in a…