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

We present some first steps in the more general setting of the interpretation of dependent type theory in Ludics. The framework is the following: a (Martin-Lof) type A is represented by a behaviour (which corresponds to a formula) in such a…

This paper provides a canonical construction of a Noetherian least fixed point topology. While such least fixed point are not Noetherian in general, we prove that under a mild assumption, one can use a topological minimal bad sequence…

Dependently typed proof assistant rely crucially on definitional equality, which relates types and terms that are automatically identified in the underlying type theory. This paper extends type theory with definitional functor laws,…

A framework is developed to describe the Zariski topologies on the prime and primitive spectra of a quantum algebra $A$ in terms of the (known) topologies on strata of these spaces and maps between the collections of closed sets of…

Inductive and coinductive types are commonly construed as ontological (Church-style) types, denoting canonical data-sets such as natural numbers, lists, and streams. For various purposes, notably the study of programs in the context of…

A wide range of intuitionistic type theories may be presented as equational theories within a logical framework. This method was formulated by Per Martin-L\"{o}f in the mid-1980's and further developed by Uemura, who used it to prove an…

The goal of this paper is to develop a KAM theory for tori with hyperbolic directions, which applies to Hamiltonian partial differential equations, even to some ill-posed ones. The main result has an \emph{a-posteriori} format, i.e., we…

Recent improvement on Tarski's procedure for quantifier elimination in the first order theory of real numbers makes it feasible to solve small instances of the following problems completely automatically: 1. listing all equality and…

Equations in free groups have become prominent recently in connection with the solution to the well known Tarski Conjecture. Results of Makanin and Rasborov show that solvability of systems of equations is decidable and there is a method…

We present a fixed point theorem on topological cylinders in normed linear spaces for maps satisfying a property of stretching a space along paths. This result is a generalization of a similar theorem obtained by D. Papini and F. Zanolin.…

We present the theory of higher order invariants and higher order automorphic forms in the simplest case, that of a compact quotient. In this case many things simplify and we are thus able to prove a more precise structure theorem than in…

We study the problem of enumerating Tarski fixed points on finite lattices. We derive query complexity lower bounds for finding three or more Tarski fixed points of isotone maps and the subclasses of increasing and decreasing isotone maps.…

Higher inductive types are a class of type-forming rules, introduced to provide basic (and not-so-basic) homotopy-theoretic constructions in a type-theoretic style. They have proven very fruitful for the "synthetic" development of homotopy…

This paper establishes novel fixed point theorems for Kannan-type and Chatterjea-type mappings in probabilistic cone metric spaces. By integrating probabilistic distance functions with cone-valued structures, we generalize classical fixed…

The aim of this thesis is to give a concise introduction to homotopy type theory, to Aczel's constructive set theory and to simplicial sets and their homotopy theory in particular referring to their standard model structure, showing some of…

The aim of this paper is to discuss Penot's problem on a generalization of Caristi's fixed point theorem. We settle this problem in the negative and we present some new theorems on the existence of fixed points of set-valued mappings in…

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,…

This paper proposes a way of doing type theory informally, assuming a cubical style of reasoning. It can thus be viewed as a first step toward a cubical alternative to the program of informalization of type theory carried out in the…

Simple type theory is formulated for use with the generic theorem prover Isabelle. This requires explicit type inference rules. There are function, product, and subset types, which may be empty. Descriptions (the eta-operator) introduce the…

We study the existence of critical points of stable stationary solutions to reaction-diffusion problems on topological tori. Stable nonconstant stationary solutions are often called patterns. We construct topological tori and patterns with…