Related papers: Open Horn Type Theory
We found in Homotopy Type Theory (HoTT), a way of representing a first order version of intuitionistic logic (ICL), for intuitionistic calculational logic) where, instead of deduction trees, corresponding linear calculational formats are…
Resolution lies at the foundation of both logic programming and type class context reduction in functional languages. Terminating derivations by resolution have well-defined inductive meaning, whereas some non-terminating derivations can be…
Autonomous systems that operate in a shared environment with people need to be able to follow the rules of the society they occupy. While laws are unique for one society, different people and institutions may use different rules to guide…
An elementary notion of homotopy can be introduced between arrows in a cartesian closed category $E$. The input is a finite-product-preserving endofunctor $\Pi_0$ with a natural transformation $p$ from the identity which is surjective on…
This paper introduces a new family of models of intensional Martin-L\"of type theory. We use constructive ordered algebra in toposes. Identity types in the models are given by a notion of Moore path. By considering a particular gros topos,…
We propose an enhancement to inductive types and records in a dependent type theory, namely (co)conditions. With a primitive interval type, conditions generalize the cubical syntax of higher inductive types in homotopy type theory, while…
This is an introduction to the study of abstract homotopy theory by means of model categories and $(\infty,1)$-categories. The only prerequisites are very basic general topology and abstract algebra. None categorical background is needed.…
Given a type A in homotopy type theory (HoTT), we can define the free infinity-group on A as the loop space of the suspension of A+1. Equivalently, this free higher group can be defined as a higher inductive type F(A) with constructors unit…
First-order resolution has been used for type inference for many years, including in Hindley- Milner type inference, type-classes, and constrained data types. Dependent types are a new trend in functional languages. In this paper, we show…
Symmetry protected topological (SPT) phases are gapped phases of matter that cannot be deformed to a trivial phase without breaking the symmetry or closing the bulk gap. Here, we introduce a new notion of a topological obstruction that is…
In this paper we propose to use a relative variant of the notion of the \'{e}tale homotopy type of an algebraic variety in order to study the existence of rational points on it. In particular, we use an appropriate notion of homotopy fixed…
The dynamics of belief and knowledge is one of the major components of any autonomous system that should be able to incorporate new pieces of information. We introduced the Horn knowledge base dynamics to deal with two important points:…
We provide a direct, intersection theoretic, argument that the Jordan models of an operator of class C_{0}, of its restriction to an invariant subspace, and of its compression to the orthogonal complement, satisfy a multiplicative form of…
A hierarchy of type universes is a rudimentary ingredient in the type theories of many proof assistants to prevent the logical inconsistency resulting from combining dependent functions and the type-in-type rule. In this work, we argue that…
The basic notions of category theory, such as limit, adjunction, and orthogonality, all involve assertions of the existence and uniqueness of certain arrows. Weak notions arise when one drops the uniqueness requirement and asks only for…
Without the axiom of choice, the free exact completion of the category of sets (i.e. the category of setoids) may not be complete or cocomplete. We will show that nevertheless, it can be enhanced to a derivator: the formal structure of…
We present a simple resolution proof system for higher-order constrained Horn clauses (HoCHC) - a system of higher-order logic modulo theories - and prove its soundness and refutational completeness w.r.t. the standard semantics. As…
In recent work we have shown how it is possible to define very precise type systems for object-oriented languages by abstractly compiling a program into a Horn formula f. Then type inference amounts to resolving a certain goal w.r.t. the…
We introduce a transport cohomological framework for categorical filtrations. Given a contravariant filtration $F:\mathcal T^{op}\to\mathbf{Prob}$ on a small category \(\mathcal T\), conditional expectation induces transport operators…
Our main objective is to demonstrate how homological perturbation theory (HPT) results over the last 40 years immediately or with little extra work give some of the Koszul duality results that have appeared in the last decade. Higher…