Related papers: The G\"odel Fibration
We derive an intuitionistic version of G\"odel-L\"ob modal logic ($\sf{GL}$) in the style of Simpson, via proof theoretic techniques. We recover a labelled system, $\sf{\ell IGL}$, by restricting a non-wellfounded labelled system for…
Motivated by applications in modelling quantum systems using coalgebraic techniques, we introduce a fibred coalgebraic logic. Our approach extends the conventional predicate lifting semantics with additional modalities relating conditions…
G\"odel modal logics can be seen as extenions of intutionistic modal logics with the prelinearity axiom. In this paper we focus on the algebraic and relational semantics for G\"odel modal logics that leverages on the duality between finite…
A symplectic fibration is a fibre bundle in the symplectic category. We find the relation between deformation quantization of the base and the fibre, and the total space. We use the weak coupling form of Guillemin, Lerman, Sternberg and…
We use the complete Segal approach to the theory of Cartesian fibrations to define and study representable Cartesian fibrations, generalizing representable right fibrations which have played a key role in $\infty$-category theory. In…
The Grothendieck construction establishes an equivalence between fibrations, a.k.a. fibred categories, and indexed categories, and is one of the fundamental results of category theory. Cockett and Cruttwell introduced the notion of…
A standard result from the theory of Grothendieck fibrations states that if $p : E \to B$ is a fibration, then $E$ has limits of shape $\mathcal{J}$ if $B$ has limits of shape $\mathcal{J}$ the fibers of $\mathcal{E}$ have limits of shape…
We describe the construction of the slice fibration of a given one.
Most categorical models for dependent types have traditionally been heavily set based: contexts form a category, and for each we have a set of types in said context -- and for each type a set of terms of said type. This is the case for…
We explain how to construct in two different ways a cartesian closed fibration of higher-order regular languages in the sense of Salvati. In the first construction, we use fibrational techniques to derive the cartesian closed fibration from…
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…
Logical relations built on top of an operational semantics are one of the most successful proof methods in programming language semantics. In recent years, more and more expressive notions of operationally-based logical relations have been…
We develop the theory of (op)fibrations of 2-multicategories and use it to define abstract six-functor-formalisms. We also give axioms for Wirthm\"uller and Grothendieck formalisms (where either $f^!=f^*$ or $f_!=f_*$) or intermediate…
Reasoning about weak higher categorical structures constitutes a challenging task, even to the experts. One principal reason is that the language of set theory is not invariant under the weaker notions of equivalence at play, such as…
The description of algebraic structure of n-fold loop spaces can be done either using the formalism of topological operads, or using variations of Segal's $\Gamma$-spaces. The formalism of topological operads generalises well to different…
We introduce the notion of an enriched fibration, i.e. a fibration whose total category and base category are enriched in those of a monoidal fibration in an appropriate way. Furthermore, we provide a way to obtain such a structure,…
We introduce the notion of local fibration, a generalization of the notion of fibration which takes into account the presence of Grothendieck topologies on the two categories, and show that the classical results about fibrations lift to…
Recently, the second author, Briseid and Safarik introduced nonstandard Dialectica, a functional interpretation that is capable of eliminating instances of familiar principles of nonstandard arithmetic - including overspill, underspill, and…
This thesis concerns the development of a framework that facilitates the design and analysis of formal systems. Specifically, this framework provides a specification language which supports the concise and direct description of formal…
Let T be Goedel's system of primitive recursive functionals of finite type in the lambda formulation. We define by constructive means using recursion on nested multisets a multivalued function I from the set of terms of T into the set of…