Related papers: Intuitionistic fixed point theories over set theor…
Our aim in this paper is to prove some interesting fixed point theorems for the class of asymptotically $T$-regular mappings in the framework of preordered modular G-metric spaces. Our results are novel and generalizes several know results.…
Let $X$ be an arbitrary poset and $K$ an arbitrary field. We describe linear unital invertibility preservers of the finitary incidence algebra $FI(X,K)$ in terms of certain maps of the power set algebra $\mathcal{P}(X)$ and linear maps…
In this paper we show that the intuitionistic theory for finitely many iterations of strictly positive operators is a conservative extension of the Heyting arithmetic. The proof is inspired by the quick cut-elimination due to G. Mints. This…
Fixed point theorems are ubiquitous in economic research. Many studies cite Smithson (1971) ``Fixed points of order preserving multifunctions,'' yet the original proof contains errors. This note presents a new, concise proof and explains…
In this paper, we establish some fixed point theorems in ordered partial metric spaces. An example is given to illustrate our obtained results.
We generalize intuitionistic tense logics to the multi-modal case by placing grammar logics on an intuitionistic footing. We provide axiomatizations for a class of base intuitionistic grammar logics as well as provide axiomatizations for…
We provide a semantic framework for preference handling in answer set programming. To this end, we introduce preference preserving consequence operators. The resulting fixpoint characterizations provide us with a uniform semantic framework…
The Bourbaki-Witt principle states that any progressive map on a chain-complete poset has a fixed point above every point. It is provable classically, but not intuitionistically. We study this and related principles in an intuitionistic…
In this paper we study the existence and uniqueness of fixed points of a class of mappings defined on complete, (sequentially compact) cone metric spaces, without continuity conditions and depending on another function.
In this paper we construct a Beth model for intuitionistic functionals of high types and use it to create a relatively strong theory SLP containg intuitionistic principles for functionals, in particular, the theory of the "creating…
We introduce a controlled form of recursion in XQuery, inflationary fixed points, familiar in the context of relational databases. This imposes restrictions on the expressible types of recursion, but we show that inflationary fixed points…
We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic. We consider semantic characterizations of definability, as…
We extend de Finetti's (1937) notion of exchangeability to finite and countable sequences of variables, when a subject's beliefs about them are modelled using coherent lower previsions rather than (linear) previsions. We prove…
We prove a version of the Lefschetz fixed point theorem for multivalued maps $F:X\multimap X$ in which $X$ is a finite $T_0$ space.
This paper presents rules of inference for a binary quantifier $I$ for the formalisation of sentences containing definite descriptions within intuitionist positive free logic. $I$ binds one variable and forms a formula from two formulas.…
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…
We introduce the notions of weakly *-concave and weakly naturally quasi-concave correspondence and prove fixed point theorems and continuous selection theorems for these kind of correspondences. As applications in the game theory, by using…
We exhibit invariants of smooth projective algebraic varieties with integer values, whose nonvanishing modulo p prevents the existence of an action without fixed points of certain finite p-groups. The case of base fields of characteristic p…
We study automatic sequences and automatic systems generated by general constant length (nonprimitive) substitutions. While an automatic system is typically uncountable, the set of automatic sequences is countable, implying that most…
Intuitive Set Theory (IST) is defined as the theory we get, when we add Axiom of Monotonicity and Axiom of Fusion to Zermelo-Fraenkel set theory. In IST, Continuum Hypothesis is a theorem, Axiom of Choice is a theorem, Skolem paradox does…