Search arXivSearch

arXiv · 2009.00176

Temporal interpretation of intuitionistic quantifiers

Abstract

We show that intuitionistic quantifiers admit the following temporal interpretation: $\forall x A$ is true at a world $w$ iff $A$ is true at every object in the domain of every future world, and $\exists x A$ is true at $w$ iff $A$ is true at some object in the domain of some past world. For this purpose we work with a predicate version of the well-known tense propositional logic $\sf S4.t$. The predicate logic $\sf Q^\circ S4.t$ is obtained by weakening the axioms of the standard predicate extension $\sf QS4.t$ of $\sf S4.t$ along the lines Corsi weakened $\sf QK$ to $\sf Q^\circ K$. The G\"odel translation embeds the predicate intuitionistic logic $\sf IQC$ into $\sf QS4$ fully and faithfully. We provide a temporal version of the G\"odel translation and prove that it embeds $\sf IQC$ into $\sf Q^\circ S4.t$ fully and faithfully; that is, we show that a sentence is provable in $\sf IQC$ iff its translation is provable in $\sf Q^\circ S4.t$. Faithfulness is proved using syntactic methods, while we prove fullness utilizing the generalized Kripke semantics of Corsi.

Explore related subjects

Keep this discovery

BibTeXRIS

Guram Bezhanishvili, Luca Carai. 2020-09-01. Temporal interpretation of intuitionistic quantifiers. https://arxiv.org/abs/2009.00176

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO