Related papers: Intuitionistic fixed point theories over Heyting a…
We define a discrete gauge-invariant Yang-Mills-Higgs action on spacetime simplicial meshes. The formulation is a generalization of classical lattice gauge theory, and we prove consistency of the action in the sense of approximation theory.…
All product fixed point results in ordered metric spaces based on linear contractive conditions are but a vectorial form of the fixed point statement due to Nieto and Rodriguez-Lopez [Order, 22 (2005), 223-239], under the lines in Matkowski…
In this article we show that some recent results on the existence of best proximity points can be obtained from the same result in fixed point theory.
An algebraic proof is presented for the finite strong standard completeness of involutive uninorm logic with fixed point. The result may provide a first step towards settling the open standard completeness problem for involutive uninorm…
Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that typically arise from applying decision rules…
The usual reading of logical implication "A implies B" as "if A then B" fails in intuitionistic logic: there are formulas A and B such that "A implies B" is not provable, even though B is provable whenever A is provable. Intuitionistic…
We develop a common semantic framework for the interpretation both of $\mathbf{IPC}$, the intuitionistic propositional calculus, and of logics weaker than $\mathbf{IPC}$ (substructural and subintuitionistic logics). This is done by proving…
The goal of this paper is to describe an elementary combinatorial heuristic that predicts Hardy and Littlewood's extended Goldbach's conjecture. We examine common features of other heuristics in additive prime number theory, such as…
In this paper we show that using implicative algebras one can produce models of set theory generalizing Heyting/Boolean-valued models and realizability models of (I)ZF, both in intuitionistic and classical logic. This has as consequence…
In this paper we prove FG-coupled fixed point theorems for different contractive mappings and generalized quasi- contractive mappings in partially ordered complete metric spaces. We prove the existence of FG-coupled fixed points of…
We establish, in the setting of equivariant motivic homotopy theory for a finite group, a version of tom Dieck's splitting theorem for the fixed points of a suspension spectrum. Along the way we establish structural results and…
The paper is devoted to the fixed point theory in four aspects: of contractions, nonexpansive mappings, generalized inward mappings, and of the tool theorems. The manuscript was written about ten years ago. At first Nadler's concept of…
Infinitary and cyclic proof systems are proof systems for logical formulas with fixed-point operators or inductive definitions. A cyclic proof system is a restriction of the corresponding infinitary proof system. Hence, these proof systems…
We prove an existence and uniqueness theorem for fixed points of contraction maps in the framework of quantum metric spaces, where distinguishability is defined by the $L^2$ norm: $d_Q(\psi_1,\psi_2) = \|\psi_1 - \psi_2\|$. The result…
We give a new proof of a theorem of Mints that the positive fragment of minimal predicate logic is decidable. The idea of the proof is to replace the eigenvariable condition of sequent calculus by an appropriate scoping mechanism. The…
Several recent papers in digital topology have sought to obtain fixed point results by mimicking the use of tools from classical topology, such as complete metric spaces and homotopy invariant fixed point theory. We show that in many cases,…
We develop a fixed-point iterative algorithm that computes the matrix projection with respect to the Bures distance on the set of positive definite matrices that are invariant under some symmetry. We prove that the fixed-point iteration…
Nonexpansive mappings play a central role in modern optimization and monotone operator theory because their fixed points can describe solutions to optimization or critical point problems. It is known that when the mappings are sufficiently…
We introduce relational semantics for "flat Heyting-Lewis logic" $\mathsf{HLC}^{\flat}$. This logic arises as the extension of intuitionistic logic with a Lewis-style strict implication modality that, contrary to its "sharp" counterpart…
We study logic for reasoning with if-then formulas describing dependencies between attributes of objects which are observed in consecutive points in time. We introduce semantic entailment of the formulas, show its fixed-point…