Semisimplicity, Glivenko theorems, and the excluded middle
Tom\'a\v{s} L\'avi\v{c}ka, Adam P\v{r}enosil

TL;DR
This paper establishes a general connection between semisimplicity of logics, the law of the excluded middle, and Glivenko theorems, providing new syntactic and model-theoretic characterizations and extending classical results to various algebraic frameworks.
Contribution
It introduces a signature-independent law of the excluded middle, links semisimplicity to this law, and extends Glivenko theorems to a broad class of algebraic and substructural logics.
Findings
Semisimple logics satisfy a general law of the excluded middle.
Syntactic proofs of algebraic characterizations are provided.
A Glivenko-like correspondence is established for various logic extensions.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Logic, Reasoning, and Knowledge · Logic, programming, and type systems
