Search arXivSearch

arXiv · 2009.00218

Temporal interpretation of intuitionistic quantifiers: Monadic case

Abstract

In a recent paper we showed that intuitionistic quantifiers admit the following temporal interpretation: "always in the future" (for $\forall$) and "sometime in the past" (for $\exists$). In this paper we study this interpretation for the monadic fragment $\sf MIPC$ of the intuitionistic predicate logic. It is well known that $\sf MIPC$ is translated fully and faithfully into the monadic fragment $\sf MS4$ of the predicate $\sf S4$ (G\"{o}del translation). We introduce a new tense extension of $\sf S4$, denoted by $\sf TS4$, and provide an alternative full and faithful translation of $\sf MIPC$ into $\sf TS4$, which yields the temporal interpretation of monadic intuitionistic quantifiers mentioned above. We compare this new translation with the G\"{o}del translation by showing that both $\sf MS4$ and $\sf TS4$ can be translated fully and faithfully into a tense extension of $\sf MS4$, which we denote by $\sf MS4.t$. This is done by utilizing the algebraic and relational semantics for the new logics introduced. As a byproduct, we prove the finite model property (fmp) for $\sf MS4.t$ and show that the fmp for the other logics involved can be derived as a consequence of the fullness and faithfulness of the translations considered.

Explore related subjects

Keep this discovery

BibTeXRIS

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

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