Related papers: Quotient completion for the foundation of construc…
This essay advocates the view that any problem that has a meaningful empirical content, can be formulated in constructive, more definitely, finite terms. We consider combinatorial models of dynamical systems and approaches to statistical…
This article tackles categorical coherence within a two-dimensional generalization of Lawvere's functorial semantics. 2-theories, a syntactical way of describing categories with structure, are presented. From the perspective here afforded,…
As already mentioned by Lawvere in his 1973 paper, the characterisation of Cauchy completeness of metric spaces in terms of representability of adjoint distributors amounts to the idempotent-split property of an ordinary category when the…
Pure type systems arise as a generalisation of simply typed lambda calculus. The contemporary development of mathematics has renewed the interest in type theories, as they are not just the object of mere historical research, but have an…
The geometric form of Hilbert's Nullstellensatz may be understood as a property of "geometric saturation" in algebraically closed fields. We conceptualise this property in the language of first order logic, following previous approaches and…
We consider the structure of classes of curves on a projective simply connected surface for which fundamental groups of the complements admit free quotients having rank greater than one with irreducible components belonging to a selected…
This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules. We adopt the constructive point of view, with which all existence theorems have an explicit algorithmic…
We construct a logic-enriched type theory LTTW that corresponds closely to the predicative system of foundations presented by Hermann Weyl in Das Kontinuum. We formalise many results from that book in LTTW, including Weyl's definition of…
This paper introduces a model theory for resolution on Higher Order Hereditarily Harrop formulae (HOHH), the logic underlying the Lambda-Prolog programming language, and proves soundness and completeness of resolution. The semantics and the…
Despite ample evidence that our concepts, our cognitive architecture, and mathematics itself are all deeply compositional, few models take advantage of this structure. We therefore propose a radically compositional approach to computational…
This paper considers the problem of building saturated models for first-order graded logics. We define types as pairs of sets of formulas in one free variable which express properties that an element is expected, respectively, to satisfy…
The homotopical approach to intensional type theory views proofs of equality as paths. We explore what is required of an object $I$ in a topos to give such a path-based model of type theory in which paths are just functions with domain $I$.…
This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures, the full type hierarchies over preorders for the base…
We construct an A_infinity-category D(C|B) from a given A_infinity-category C and its full subcategory B. The construction is similar to a particular case of Drinfeld's quotient of differential graded categories. We use D(C|B) to construct…
Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…
In a previous publication, we introduced an abstract logic via an abstract notion of quantifier. Drawing upon concepts from categorical logic, this abstract logic interprets formulas from context as subobjects in a specific category, e.g.,…
The focus of this article is on metric completions of triangulated categories arising in the representation theory of hereditary finite dimensional algebras and commutative rings. We explicitly describe all completions of bounded derived…
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…
We prove finiteness results on integral points on complements of large divisors in projective varieties over finitely generated fields of characteristic zero. To do so, we prove a function field analogue of arithmetic finiteness results of…
The notions of null-sets and nullity are present in all discourses of mathematics. They are based on the dual-pair of notions of "almost-every" and "almost none". A notion of nullity corresponds to a choice of subsets that one interprets as…