Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1208.2971

Intuitionistic logic with two Galois connections combined with Fischer Servi axioms

Wojciech Dzik·Jouni Järvinen·Michiro Kondo
View original source ↗Read source document ↗Export metadata ↓

Abstract

Earlier, the authors introduced the logic IntGC, which is an extension of intuitionistic propositional logic by two rules of inference mimicking the performance of Galois connections (Logic J. of the IGPL, 18:837-858, 2010). In this paper, the extensions Int2GC and Int2GC+FS of IntGC are studied. Int2GC can be seen as a fusion of two IntGC logics, and Int2GC+FS is obtained from Int2GC by adding instances of duality-like connections $\Diamond(A \to\ B) \to (\Box A \to \Diamond B)$ and $(\Diamond A \to \Box B) \to \Box(A \to B)$, introduced by G. Fischer Servi (Rend. Sem. Mat. Univers. Politecn. Torino, 42:179-194, 1984), for interlinking the two Galois connections of Int2GC. Both Kripke-style and algebraic semantics are presented for Int2GC and Int2GC+FS, and the logics are proved to be complete with respect to both of these semantics. We show that rough lattice-valued fuzzy sets defined on complete Heyting algebras are proper algebraic models for Int2GC+FS. We also prove that Int2GC+FS is equivalent to the intuitionistic tense logic IKt, and an axiomatisation of IKt with the number of axioms reduced to the half of the number of axioms given by W. B. Ewald (J. Symb. Log, 51:166-179, 1986) is presented.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Wojciech Dzik, Jouni Järvinen, Michiro Kondo. 2012-08-14. Intuitionistic logic with two Galois connections combined with Fischer Servi axioms. https://arxiv.org/abs/1208.2971

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗