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

Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…

The first aim of this paper is to examine some important properties of soft metric spaces. Second is to introduce soft continuous mappings and investigate properties of soft continuous mappings. Third is to prove some fixed point theorems…

This paper studies relative unification and admissibility in the intuitionistic logic. We generalize results of [Ghilardi, 1999; Iemhoff, 2001a] and prove them relative in NNIL(par) propositions, the class of propositions with No Nested…

Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions…

Most physics theories are deterministic, with the notable exception of quantum mechanics which, however, comes plagued by the so-called measurement problem. This state of affairs might well be due to the inability of standard mathematics to…

By contrast wih $\mathsf{S4}$, the analysis of local tabularity above $\mathsf{IPC}$ has provided a difficult challenge. This paper studies a strengthening of local tabularity -- \textit{uniform local tabularity} -- where one demands that…

The aim of this paper is to establish some metrical coincidence and common fixed point theorems with an arbitrary relation under an implicit contractive condition which is general enough to cover a multitude of well known contraction…

We explore various semantic understandings of dual intuitionistic logic by exploring the relationship between co-Heyting algebras and topological spaces. First, we discuss the relevant ideas in the setting of Heyting algebras and…

We study topology, particularly compactness, as an extension of Shulman's work on constructive mathematics via affine logic, while allowing propositional impredicativity. We introduce a notion of compactness in affine logic and prove the…

We prove that there is a factor of the Muchnik lattice that captures intuitionistic propositional logic. This complements a now classic result of Skvortsova for the Medvedev lattice.

We develop a denotational semantics of Linear Logic with least and greatest fixed points in coherence spaces (where both fixed points are interpreted in the same way) and in coherence spaces with totality (where they have different…

We present identities for permutations with fixed points. The formulas are based on successive derivations or integrations of the determinant of a particular matrix.

Machine learning models can assign fixed predictions that preclude individuals from changing their outcome. Existing approaches to audit fixed predictions do so on a pointwise basis, which requires access to an existing dataset of…

This paper deals with a modifed iterative projection method for approximating a solution of hierarchical fixed point problems for nearly nonexpansive mappings. Some strong convergence theorems for the proposed method are presented under…

This paper combines the decomposition technique ($\sigma$-stability) in random functional analysis with the deterministic theory of asymptotically pointwise contractions to provide a complete self-contained derivation of a fixed point…

In arXiv: math.LO/0011208 we proposed the {\sl intuitionistic or disjunctive representation of quantum logic}, i.e., a representation of the property lattice of physical systems as a complete Heyting algebra of logical propositions on these…

The paper presents a cut-elimination procedure for intuitionistic propositional logic in which cut is eliminated directly, without introducing the multiple-cut rule mix, and in which pushing cut above contraction is one of the reduction…

Mathematical proof aims to deliver confident conclusions, but a very similar process of deduction can be used to make uncertain estimates that are open to revision. A key ingredient in such reasoning is the use of a "default" estimate of…

The purpose of this paper is to introduce a bi-intuitionistic sequent calculus and to give proofs of admissibility for its structural rules. The calculus I will present, called SC2Int, is a sequent calculus for the bi-intuitionistic logic…

This paper establishes novel fixed point theorems for Kannan-type and Chatterjea-type mappings in probabilistic cone metric spaces. By integrating probabilistic distance functions with cone-valued structures, we generalize classical fixed…