SearcharxivSearch

arXiv · 1401.7646

Characterizing intermediate tense logics in terms of Galois connections

Abstract

We propose a uniform way of defining for every logic ${\sf L}$ intermediate between intuitionistic and classical logics, the corresponding intermediate minimal tense logic ${\sf LK_t}$. This is done by building the fusion of two copies of intermediate logic with a Galois connection ${\sf LGC}$, and then interlinking their operators by two Fischer Servi axioms. The resulting system is called here ${\sf L2GC{+}FS}$. In the cases of intuitionistic logic ${\sf Int}$ and classical logic ${\sf Cl}$, it is noted that ${\sf Int2GC{+}FS}$ is syntactically equivalent to intuitionistic minimal tense logic ${\sf IK_t}$ by W. B. Ewald and ${\sf Cl2GC{+}FS}$ equals classical minimal tense logic ${\sf K_t}$. This justifies to consider ${\sf L2GC{+}FS}$ as minimal ${\sf L}$-tense logic ${\sf LK_t}$ for any intermediate logic ${\sf L}$. We define H2GC+FS-algebras as expansions of HK1-algebras, introduced by E. Orlowska and I. Rewitzky. For each intermediate logic ${\sf L}$, we show algebraic completeness of ${\sf L2GC{+}FS}$ and its conservativeness over ${\sf L}$. We prove relational completeness of ${\sf Int2GC{+}FS}$ with respect to the models defined on ${\sf IK}$-frames introduced by G. Fischer Servi. We also prove a representation theorem stating that every H2GC+FS-algebra can be embedded into the complex algebra of its canonical ${\sf IK}$-frame.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wojciech Dzik, Jouni Järvinen, Michiro Kondo. 2014-06-30. Characterizing intermediate tense logics in terms of Galois connections. https://doi.org/10.1093/jigpal%2Fjzu024

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