Related papers: Tarski's least fixed point theorem: A predicative …

Type systems certify program properties in a compositional way. From a bigger program one can abstract out a part and certify the properties of the resulting abstract program by just using the type of the part that was abstracted away.…

We prove a fixed-point theorem that generalises and simplifies a number of results in the theory of $F$-contractions. We show that all of the previously imposed conditions on the operator can be either omitted or relaxed. Furthermore, our…

We reformulate recent advances in directed type theory--a type theory where the types have the structure of synthetic (higher) categories--as a logical calculus with multiple context 'zones', following the example of Pfenning and Davies.…

We isolate a normal-form mechanism underlying Bourbaki--Witt fixed-point arguments and least-upper-bound versions of Zorn-type maximality principles. Given a progressive self-map on a partially ordered set, we define a Bourbaki tower as a…

In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a…

We generalize Hrushovski's group configuration theorem to the case where the type of the configuration is generically stable, without assuming tameness of the ambient theory. The properties of generically stable types, which we recall in…

Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly…

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…

The aim of this paper is to establish some results regarding Infinite Iterated Function Systems with the help of the Tarski-Kantorovitch fixed-point principles for maps on partially ordered sets. To this end we introduce two new classes of…

In the seventies', Zehnder found a Nash-Moser type implicit function theorem in the analytic set-up. This theorem has found many applications in dynamical systems although its applications require, as a general rule, some efforts. We…

We present an alternative approach to the vector version of Krasnosel'skii compression-expansion fixed point theorem due to Precup, which is based on the fixed point index. It allows us to obtain new general versions of this fixed point…

Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotone function over a complete lattice as the largest post-fixpoint, naturally leads to the so-called coinduction proof principle for showing that some element is below…

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…

We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…

We present a version of Krasnosel'skii fixed point theorem for operators acting on Cartesian products of normed linear spaces, under cone-compression and cone-expansion conditions of norm type. Our approach, based on the fixed point index…

In previous work, the second author introduced a topology, for spaces of irreducible representations, that reduces to the classical Zariski topology over commutative rings but provides a proper refinement in various noncommutative settings.…

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

We propose an extension of pure type systems with an algebraic presentation of inductive and co-inductive type families with proper indices. This type theory supports coercions toward from smaller sorts to bigger sorts via explicit type…

We exhibit invariants of smooth projective algebraic varieties with integer values, whose nonvanishing modulo p prevents the existence of an action without fixed points of certain finite p-groups. The case of base fields of characteristic p…

We study a new proof principle in the context of constructive Zermelo-Fraenkel set theory based on what we will call "non-deterministic inductive definitions". We give applications to formal topology as well as a predicative justification…