Related papers: Strictification of weakly stable type-theoretic st…
We present a framework for the formal meta-theory of lambda calculi in first-order syntax, with two sorts of names, one to represent both free and bound variables, and the other for constants, and by using Stoughton's multiple…
In this paper, we present a general realizability semantics for the simply typed $\lambda\mu$-calculus. Then, based on this semantics, we derive both weak and strong normalization results for two versions of the $\lambda\mu$-calculus…
Fix a weakly minimal (i.e., superstable $U$-rank $1$) structure $\mathcal{M}$. Let $\mathcal{M}^*$ be an expansion by constants for an elementary substructure, and let $A$ be an arbitrary subset of the universe $M$. We show that all…
A class of structures is monadically dependent if one cannot interpret all graphs in colored expansions from the class using a fixed first-order formula. A tree-ordered $\sigma$-structure is the expansion of a $\sigma$-structure with a…
Given a family of model categories $\cal E \to \cal R$ over a Reedy category, we outline a set of conditions which lead to the existence of a Reedy model structure on the category of sections ${\sf Sect}(\cal R, \cal E)$. We prove that for…
We present a soundness theorem for a dependent type theory with context constants with respect to an indexed category of (finite, abstract) simplical complexes. The point of interest for computer science is that this category can be seen to…
This paper develops a systematic framework for integrating local categories that model logical connectives using higher category theory. By extending these local categories into a unified two-category enriched with natural isomorphisms, the…
The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…
With a simple generic approach, we develop a classification that encodes and measures the strength of completeness (or compactness) properties in various types of spaces and ordered structures. The approach also allows us to encode notions…
In this paper we study the global structure of the stable homotopy theory of spectra. We establish criteria for when the homotopy theory associated to a given stable model category agrees with the classical stable homotopy theory of…
In a recent paper we introduced a much weaker and easy to verify structure than a model category, which we called a "weak fibration category". We further showed that a small weak fibration category can be "completed" into a full model…
In this paper we construct new categorical models for the identity types of Martin-L\"of type theory, in the categories Top of topological spaces and SSet of simplicial sets. We do so building on earlier work of Awodey and Warren, which has…
We propose to grok Lipschitz stratifications from a non-archimedean point of view and thereby show that they exist for closed definable sets in any power-bounded o-minimal structure on a real closed field. Unlike the previous approaches in…
We develop a theory of completeness for weight structures on stable categories, dual to the theory of complete t-structures. As in the bounded case, we show that complete weight structures are determined by their weight heart, giving rise…
We introduce a novel topology, called Kernel Mean Embedding Topology, for stochastic kernels, in a weak and strong form. This topology, defined on the spaces of Bochner integrable functions from a signal space to a space of probability…
Categories with families (CwFs) have been used to define the semantics of type theory in type theory. In the setting of Homotopy Type Theory (HoTT), one of the limitations of the traditional notion of CwFs is the requirement to set-truncate…
First, we extend Leifer-Milner RPO theory, by giving general conditions to obtain IPO labelled transition systems (and bisimilarities) with a reduced set of transitions, and possibly finitely branching. Moreover, we study the weak variant…
We advocate the use of de Bruijn's universal abstraction $\lambda^\infty$ for the quantification of schematic variables in the predicative setting and we present a typed $\lambda$-calculus featuring the quantifier $\lambda^\infty$…
The standard stabilizer formalism provides a setting to show that quantum computation restricted to operations within the Clifford group are classically efficiently simulable: this is the content of the well-known Gottesman-Knill theorem.…
Belief systems are often treated as globally consistent sets of propositions or as scalar-valued probability distributions. Such representations tend to obscure the internal structure of belief, conflate external credibility with internal…