Related papers: Fixed Point Theorems in Computability Theory
We propose a definition of quantum computable functions as mappings between superpositions of natural numbers to probability distributions of natural numbers. Each function is obtained as a limit of an infinite computation of a quantum…
Logic programming with fixed-point definitions is a useful extension of traditional logic programming. Fixed-point definitions can capture simple model checking problems and closed-world assumptions. Its operational semantics is typically…
We develop a geometric framework that unifies several different combinatorial fixed-point theorems related to Tucker's lemma and Sperner's lemma, showing them to be different geometric manifestations of the same topological phenomena. In…
Nominal algebra includes $\alpha$-equality and freshness constraints on nominal terms endowed with a nominal set semantics that facilitates reasoning about languages with binders. Nominal unification is decidable and unitary, however, its…
A homological selection theorem for C-spaces, as well as, a finite-dimensional homological selection theorem is established. We apply the finite-dimensional homological selection theorem to obtain fixed-point theorems for usco homologically…
In this article, we introduce the LR-$(\delta,\phi)$ quasi partial $b$-metric space. Also, the common fixed point theorem on complete LR-$(\delta,\phi)$ quasi partial $b$-metric space has been proved. A non-trivial example is also given.
$ $[This paper is a (self contained) chapter in a new book, Mathematics and Computation, whose draft is available on my homepage at https://www.math.ias.edu/avi/book ]. We survey some concrete interaction areas between computational…
We establish a fixed point property for a certain class of locally compact groups, including almost connected Lie groups and compact groups of finite abelian width, which act by simplicial isometries on finite rank buildings with measurable…
The purpose of this paper is to present some multidimensional fixed-point theorems and their applications. For this, we provide a multidimensional fixed point theorem and then using this theorem we prove the existence and uniqueness of a…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We prove a fixpoint theorem for contractions on Cauchy-complete quantale-enriched categories. It holds for any quantale whose underlying lattice is continuous, and applies to contractions whose control function is sequentially…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
From last decade, when Molodtsov introduced the theory of soft set as a new approach to deal with uncertainties, until now this theory was considered sharply by a fair number of researchers. Combination of fuzzy set theory and soft set…
We prove some results on the border of Ramsey theory (finite partition calculus) and model theory. Also a beginning of classification theory of finite models in undertaken.
The theory of recursive functions is related in a well-known way to the notion of *least fixed points*, by endowing a set of partial functions with an ordering in terms of their domain of definition. When terms in the pure lambda-calculus…
Following F. William Lawvere, we show that many self-referential paradoxes, incompleteness theorems and fixed point theorems fall out of the same simple scheme. We demonstrate these similarities by showing how this simple scheme encompasses…
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…
To enable the study of open sets in computational approaches to mathematics, lots of extra data and structure on these sets is assumed. For both foundational and mathematical reasons, it is then a natural question, and the subject of this…
We give a model-theoretic characterization of the class of geometric theories classified by an atomic topos having enough points; in particular, we show that every complete geometric theory classified by an atomic topos is countably…
In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…