相关论文: Intuitionistic fixed point theories over Heyting a…

We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…

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…

This note presents a rather intuitive approach to extreme value theory. This approach was devised mostly for pedagogical reason.

Beginning with the projectively invariant method for linear programming, interior point methods have led to powerful algorithms for many difficult computing problems, in combinatorial optimization, logic, number theory and non-convex…

Intuitionistic belief has been axiomatized by Artemov and Protopopescu as an extension of intuitionistic propositional logic by means of the distributivity scheme K, and of co-reflection $A\rightarrow\Box A$. This way, belief is interpreted…

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…

We prove a Goldblatt-Thomason theorem for dialgebraic intuitionistic logics, and instantiate it to Goldblatt-Thomason theorems for a wide variety of modal intuitionistic logics from the literature.

Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…

The aim of this paper is to prove a fixed point theorem on a generalised cone metric spaces for maps satisfying general contractive type conditions.

Methods are described for the solution of linear inference problems subject to deterministic constraints. The approach builds on work by Backus (1970a,b,c) and Parker (1977), but a range useful advances are suggested to address both…

We offer the proofs that complete our article introducing the propositional calculus called semi-intuitionistic logic with strong negation.

We investigate non-wellfounded proof systems based on parsimonious logic, a weaker variant of linear logic where the exponential modality ! is interpreted as a constructor for streams over finite data. Logical consistency is maintained at a…

In this paper, influenced by the ideas from A. Mihail, The canonical projection between the shift space of an IIFS and its attractor as a fixed point, Fixed Point Theory Appl., 2015, Paper No. 75, 15 p., we associate to every generalized…

In this article, we prove some fixed point theorems in metric type spaces. This article is just a generalization some results previously proved in \cite{niyi-gaba}. In particular, we give some coupled common fixed points theorems under weak…

In 1938, Tarski proved that a formula is not intuitionistically valid if, and only if, it has a counter-model in the Heyting algebra of open sets of some topological space. In fact, Tarski showed that any Euclidean space R^n with n >= 1…

In this paper we present some fixed-figure theorems as a geometric approach to the fixed-point theory when the number of fixed points of a self-mapping is more than one. To do this, we modify the Jleli-Samet type contraction and define new…

We introduce a new type of mappings in metric space which are three-point analogue of the well-known Chatterjea type mappings, and call them generalized Chatterjea type mappings. It is shown that such mappings can be discontinuous as is the…

In this paper, we consider the complexity of propositional proofs of classical and intuitionistic tautologies. In fact, we describe a nondeterministic polynomial-time decision procedure for intuitionistic implicational tautologies. For this…

This paper develops a general method of inference for fixed effects models which is (i) automatic, (ii) computationally inexpensive, (iii) tuning parameter-free, and (iv) highly model agnostic. Specifically, we show how to combine a…

The aim of this paper is to provide characterizations of a Meir-Keeler type mapping and a fixed point theorem for the mapping in a metric space endowed with a transitive relation.