Related papers: A note on arithmetic in finite types
Infinite types and formulas are known to have really curious and unsound behaviors. For instance, they allow to type {\Omega}, the auto- autoapplication and they thus do not ensure any form of normalization/productivity. Moreover, in most…
This is a survey of results on definability and undefinability in models of arithmetic. The goal is to present a stark difference between undefinability results in the standard model and much stronger versions about expansions of…
We propose a definition of higher inductive types in $(\infty,1)$-categories with finite limits. We show that the $(\infty,1)$-category of $(\infty,1)$-categories with higher inductive types is finitarily presentable. In particular, the…
We construct a model of type theory enjoying parametricity from an arbitrary one. A type in the new model is a semi-cubical type in the old one, illustrating the correspondence between parametricity and cubes. Our construction works not…
Bidirectional typechecking, in which terms either synthesize a type or are checked against a known type, has become popular for its applicability to a variety of type systems, its error reporting, and its ease of implementation. Following…
G\"odel's second incompleteness theorem is standardly understood as showing that no sufficiently strong, consistent theory of arithmetic can prove its own consistency, a result typically interpreted against a model-theoretic background in…
We present a refinement of the Calculus of Inductive Constructions in which one can easily define a notion of relational parametricity. It provides a new way to automate proofs in an interactive theorem prover like Coq.
The class of all subdirectly irreducible groups belonging to a variety generated by a finite nilpotent group can be axiomatised by a finite set of elementary sentences.
An extension of algebras is a homomorphism of algebras preserving identities. We use extensions of algebras to study the finitistic dimension conjecture over Artin algebras. Let $f: B \to A$ be an extension of Artin algebras. We denote by…
We prove the finiteness of leaps of modules of $m$-integrable derivations for algebras essentially of finite type and, more generally, for schemes essentially of finite type over an algebraically closed field of positive characteristic.…
We verify a confluence result for the rewriting calculus of the linear category introduced in our previous paper. Together with the termination result proved therein, the generalized coherence theorem for linear category is established.…
Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…
This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…
We present the first definition of strictly associative and unital $\infty$-category. Our proposal takes the form of a type theory whose terms describe the operations of such structures, and whose definitional equality relation enforces…
We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…
It is well known that every solution of an elliptic equation is analytic if its coefficients are analytic. However, less is known about the ultra-analyticity of such solutions. This work addresses the problem of elliptic equations with…
Refinement types are types equipped with predicates that specify preconditions and postconditions of underlying functional languages. We propose a general semantic construction of dependent refinement type systems from underlying type…
We define a proof system for exceptions which is close to the syntax for exceptions, in the sense that the exceptions do not appear explicitly in the type of any expression. This proof system is sound with respect to the intended…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…