Related papers: Canonicity and Computability in Homotopy Type Theo…

We intend to investigate the metalogical property of 'omitting types' for a wide variety of quantifier logics (that can also be seen as multimodal logics upon identifying existential quantifiers with modalities syntactically and…

This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized…

In this paper, we propose an abstract definition of dependent type theories as essentially algebraic theories. One of the main advantages of this definition is its composability: simple theories can be combined into more complex ones, and…

In this paper, we define a realizability semantics for the simply typed $\lambda\mu$-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the…

Dependently typed proof assistant rely crucially on definitional equality, which relates types and terms that are automatically identified in the underlying type theory. This paper extends type theory with definitional functor laws,…

Several approaches exist to data-mining big corpora of formal proofs. Some of these approaches are based on statistical machine learning, and some -- on theory exploration. However, most are developed for either untyped or simply-typed…

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…

While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…

We study knowable informational dependence between empirical questions, modeled as continuous functional dependence between variables in a topological setting. We also investigate epistemic independence in topological terms and show that it…

We explore the canonical Grothendieck topology and a new homotopical analog. First we discuss some background information, including defining a new 2-category called the Index-Functor Category and a sieve generalization. Then we discuss a…

Given a definably compact group G in a saturated o-minimal structure, there is a canonical homomorphism from G to a compact real Lie group F(G). We establish a similar result for the (o-mininimal) universal cover of a definably compact…

A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…

Computational paths treat propositional equality as explicit paths built from labelled deduction steps and rewrite rules. This view originates in work by de Queiroz and collaborators [1] and yields a weak groupoid structure for equality,…

We construct a left semi-model structure on the category of intensional type theories (precisely, on $\mathrm{CxlCat_{Id,1,\Sigma(,\Pi_{ext})}}$). This presents an $\infty$-category of such type theories; we show moreover that there is an…

This is a continuation of the work initiated in a previous paper on so-called driven cofactor systems, which are partially decoupling second-order differential equations of a special kind. The main purpose in that paper was to obtain an…

Using dependent type theory to formalise the syntax of dependent type theory is a very active topic of study and goes under the name of "type theory eating itself" or "type theory in type theory." Most approaches are at least loosely based…

In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…

This manuscript explores many convolution (restricted summation) type sequences via certain types of matrix based factorizations that can be used to express their generating functions. The last primary (non-appendix) section of the thesis…

An introduction and survey of homotopy type theory in honor of W.W. Tait.

Computational content encoded into constructive type theory proofs can be used to make computing experiments over concrete data structures. In this paper, we explore this possibility when working in Coq with chain complexes of infinite type…