Related papers: Normalization for Cubical Type Theory
In this paper we generalize renormalization theory for analytic critical circle maps with a cubic critical point to the case of maps with an arbitrary odd critical exponent by proving a quasiconformal rigidity statement for renormalizations…
Quantum field theory has been shown recently renormalizable on flat Moyal space and better behaved than on ordinary space-time. Some models at least should be completely finite, even beyond perturbation theory. In this paper a first step is…
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
We prove the strong normalization of full classical natural deduction (i.e. with conjunction, disjunction and permutative conversions) by using a translation into the simply typed lambda-mu-calculus. We also extend Mendler's result on…
We show that the theories of some (ordered) central simple algebras with involution over real closed fields are model-complete or admit quantifier elimination, and characterize positive cones in terms of morphisms into models of some of…
Various formulations of the exact renormalization group can be compared in the perturbative domain, in which we have reliable expressions for regularization-independent (universal) quantities. We consider the renormalization of the…
Bidirectional typechecking, in which terms either synthesize a type or are checked against a known type, has become popular for its scalability (unlike Damas-Milner type inference, bidirectional typing remains decidable even for very…
The confluence of untyped lambda-calculus with unconditional rewriting has already been studied in various directions. In this paper, we investigate the confluence of lambda-calculus with conditional rewriting and provide general results in…
We present a formalization of the technical language of Navya-Nyaya - the "New Logic" school of late-classical Indian philosophy - in CCHM De Morgan cubical type theory (CTT). Previous formalization attempts in first-order logic (Matilal),…
One takes advantage of some basic properties of every homotopic $\lambda$-model (e.g.\ extensional Kan complex) to explore the higher $\beta\eta$-conversions, which would correspond to proofs of equality between terms of a theory of…
We present the system $\mathtt{d}$, an extended type system with lambda-typed lambda-expressions. It is related to type systems originating from the Automath project. $\mathtt{d}$ extends existing lambda-typed systems by an existential…
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…
A typoid is a type equipped with an equivalence relation, such that the terms of equivalence between the terms of the type satisfy certain conditions, with respect to a given equivalence relation between them, that generalise the properties…
We prove equality of the vector field (iterated commutator) type and the regular contact type, which together with the Bloom theorem on equality of the Levi-form type and the regular contact type provides a complete solution of a long…
Let Delta be an Euclidean quiver. We prove that the closures of the maximal orbits in the varieties of representations of Delta are normal and Cohen--Macaulay (even complete intersections). Moreover, we give a generalization of this result…
Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…
We present $\cal L$, an extension of Parigot's $\lambda\mu$-calculus by adding negation as a type constructor, together with syntactic constructs that represent negation introduction and elimination. We will define a notion of reduction…
Several variations on the definition of a Formal Topology exist in the literature. They differ on how they express convergence, the formal property corresponding to the fact that open subsets are closed under finite intersections. We…
For the lambda-calculus with surjective pairing and terminal type, Curien and Di Cosmo were inspired by Knuth-Bendix completion, and introduced a confluent rewriting system that (1) extends the naive rewriting system, and (2) is stable…
The aim of this paper is to build a theory of commutative and noncommutative {\it injective} valuations of various algebras (including algebras with zero divisors). The targets of our valuations are (well-)ordered commutative and…