SearcharxivSearch

arXiv · 2101.03528

Semisimplicity, Glivenko theorems, and the excluded middle

Abstract

We formulate a general, signature-independent form of the law of the excluded middle and prove that a logic is semisimple if and only if it enjoys this law, provided that it satisfies a weak form of the so-called inconsistency lemma of Raftery. We then show that this equivalence can be used to provide simple syntactic proofs of the theorems of Kowalski and Kracht characterizing the semisimple varieties of FLew-algebras and Boolean algebras with operators, and to extend them to FLe-algebras and Heyting algebras with operators. Moreover, under stronger assumptions this correspondence works at the level of individual models: the semisimple models of such a logic are precisely those which satisfy an axiomatic form of the law of the excluded middle, and a Glivenko-like connection obtains between the logic and its extension by the axiom of the excluded middle. This in particular subsumes the well-known Glivenko theorems relating intuitionistic and classical logic and the modal logics S4 and S5. As a consequence, we also obtain a description of the subclassical substructural logics which are Glivenko related to classical logic.

Explore related subjects

Keep this discovery

BibTeXRIS

Tomáš Lávička, Adam Přenosil. 2021-01-10. Semisimplicity, Glivenko theorems, and the excluded middle. https://arxiv.org/abs/2101.03528

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