Related papers: Strictification of weakly stable type-theoretic st…
Generalized contextuality is a possible indicator of non-classical behaviour in quantum information theory. In finite-dimensional systems, this is justified by the fact that noncontextual theories can be embedded into some simplex, i.e.…
We give a definition of finitary type theories that subsumes many examples of dependent type theories, such as variants of Martin-L\"of type theory, simple type theories, first-order and higher-order logics, and homotopy type theory. We…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is $\Delta^0_2$ categorical. A structure A is said to be weakly ultrahomogeneous if there is a…
In homotopy type theory (HoTT), all constructions are necessarily stable under homotopy equivalence. This has shortcomings: for example, it is believed that it is impossible to define a type of semi-simplicial types. More generally, it is…
We define typical forcings encompassing many informal forcing arguments in bounded arithmetic and give general conditions for such forcings to produce models of the universal variant of relativized $T^1_2$. We apply this result to study the…
In the present article, we describe constructions of model structures on general bicomplete categories. We are motivated by the following question: given a category $\mathcal{C}$ with a subcategory $w\mathcal{C}$ closed under retracts, when…
We derive a new sufficient condition for the existence of {\omega}-categorical universal structures in classes of relational structures with constraints, augmenting results by Cherlin, Shelah, Chi, and Hubi\v{c}ka and Ne\v{s}et\v{r}il.…
We present gradual type theory, a logic and type theory for call-by-name gradual typing. We define the central constructions of gradual typing (the dynamic type, type casts and type error) in a novel way, by universal properties relative to…
We use the topology of simplicial complexes to model political structures following [1]. Simplicial complexes are a natural tool to encode interactions in the structures since a simplex can be used to represent a subset of compatible…
This paper proposes to compute the meanings associated to sentences with generic NPs corresponding to the most of generalized quantifier. We call these generics specimens and they resemble stereotypes or prototypes in lexical semantics. The…
Formal verification is only as good as the specification of a system, which is also true for neural network verification. Existing specifications follow the paradigm of data as specification, where the local neighborhood around a reference…
Deep learning models are vulnerable to adversarial perturbations, raising important concerns for safety-critical deployment. Empirical defenses can achieve strong robustness in practice, but lack formal guarantees, motivating the need for…
This book explores an alternative to the current dominant paradigm where a discrete computer model is constructed as an attempt to approximate some continuum theory. We focus on a class of discrete computer models that are based on simple…
In this paper, which is subsequent to our previous paper [PS] (but can be read independently from it), we continue our study of the closed model structure on the category $\mathrm{Cat}_{\mathrm{dgwu}}(\Bbbk)$ of small weakly unital dg…
Natural language contexts display logical regularities with respect to substitutions of related concepts: these are captured in a functional order-theoretic property called monotonicity. For a certain class of NLI problems where the…
It has long been known that every weak monoidal category A is equivalent via monoidal functors and monoidal natural transformations to a strict monoidal category st(A). We generalise the definition of weak monoidal category to give a…
We describe a type system for the linear-algebraic $\lambda$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $\lambda$-calculus: it is able to statically describe the linear combinations of terms…
This paper gives a uniform-theoretic refinement of classical homotopy theory. Both cubical sets (with connections) and uniform spaces admit classes of weak equivalences, special cases of classical weak equivalences, appropriate for the…
We study the category pro-SSet of pro-simplicial sets, which arises in etale homotopy theory, shape theory, and pro-finite completion. We establish a model structure on pro-SSet so that it is possible to do homotopy theory in this category.…