Related papers: Effectively constructible fixed points in Sacchett…
We present a fixed point theorem for a class of (potentially) non-monotonic functions over specially structured complete lattices. The theorem has as a special case the Knaster-Tarski fixed point theorem when restricted to the case of…
Consider an elliptic curve, defined over the rational numbers, and embedded in projective space. The rational points on the curve are viewed as integer vectors with coprime coordinates. What can be said about a rational point if a bound is…
The classical satisfiability problem (SAT) is used as a natural and general tool to express and solve combinatorial problems that are in NP. We postulate that provability for implicational intuitionistic propositional logic (IIPC) can serve…
Consider the Fulton-MacPherson configuration space of $n$ points on $\P^1$, which is isomorphic to a certain moduli space of stable maps to $\P^1$. We compute the cone of effective ${\mathfrak S}_n$-invariant divisors on this space. This…
In [V. M. Abramov, \emph{Bull. Aust. Math. Soc.} \textbf{104} (2021), 108--117] the fixed point equation for an infinite nonnegative Toeplitz matrix has been studied. It was found the conditions for existence of a positive solution and…
This paper proposes a basic proof theoretic framework for major modal logics: {\sf S5} and some of its subsystems. The framework is based on a version of hypersequent calculus, and the basic modal systems we handle here are the system {\sf…
What are the most general principles in set theory relating forceability and truth? As with Solovay's celebrated analysis of provability, both this question and its answer are naturally formulated with modal logic. We aim to do for…
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…
We define the infinite dimensional simplex to be the closure of the convex hull of the standard basis vectors in R^infinity, and prove that this space has the 'fixed point property': any continuous function from the space into itself has a…
In this paper, we establish some fixed point theorems in ordered partial metric spaces. An example is given to illustrate our obtained results.
We prove an analogue of the fixed-point theorem for the case of definably amenable groups.
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
In this paper using Sperner's lemma for modified partition of a simplex we will constructively prove Brouwer's fixed point theorem for sequentially locally non-constant and uniformly sequentially continuous functions.
Modal logics allow reasoning about various modes of truth: for example, what it means for something to be possibly true, or to know that something is true as opposed to merely believing it. This report describes embeddings of propositional…
In this article, we demonstrate the common fixed point theorems for three transformations on vector S-metric space by utilizing weakly compatible and point of coincidence. Moreover, some of our results generalize the existing results in the…
We prove a fixed point theorem for closed-graphed, decomposable-valued correspondences whose domain and range is a decomposable set of functions from an atomless measure space to a topological space. One consequence is an improvement of the…
The goal of this paper is to establish a general fixed point theorem for compact single-valued continuous mapping in Hausdorff p-vector spaces, and the fixed point theorem for upper semicontinuous set-valued mappings in Hausdorff locally…
A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…
We present an exposition of the *Chain Bounding Lemma*, which is a common generalization of both Zorn's Lemma and the Bourbaki-Witt fixed point theorem. The proofs of these results through the use of Chain Bounding are amongst the simplest…
We introduce a direct image formalism for constructible motivic functions. One deduces a very general version of motivic integration for which a change of variables theorem is proved. These constructions are generalized to the relative…