A General Glivenko-Gödel Theorem for Nuclei

12/28/2021
by   Giulio Fellin, et al.
0

Glivenko's theorem says that, in propositional logic, classical provability of a formula entails intuitionistic provability of double negation of that formula. We generalise Glivenko's theorem from double negation to an arbitrary nucleus, from provability in a calculus to an inductively generated abstract consequence relation, and from propositional logic to any set of objects whatsoever. The resulting conservation theorem comes with precise criteria for its validity, which allow us to instantly include Gödel's counterpart for first-order predicate logic of Glivenko's theorem. The open nucleus gives us a form of the deduction theorem for positive logic, and the closed nucleus prompts a variant of the reduction from intuitionistic to minimal logic going back to Johansson.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/18/2018

Duality between unprovability and provability in forward proof-search for Intuitionistic Propositional Logic

The inverse method is a saturation based theorem proving technique; it r...
research
05/11/2022

Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis

With help of a compact Prolog-based theorem prover for Intuitionistic Pr...
research
06/16/2017

From Propositional Logic to Plausible Reasoning: A Uniqueness Theorem

We consider the question of extending propositional logic to a logic of ...
research
12/30/2021

Feferman-Vaught Decompositions for Prefix Classes of First Order Logic

The Feferman-Vaught theorem provides a way of evaluating a first order s...
research
09/03/2022

Explainability via Short Formulas: the Case of Propositional Logic with Implementation

We conceptualize explainability in terms of logic and formula size, givi...
research
04/17/2018

Ruitenburg's Theorem via Duality and Bounded Bisimulations

For a given intuitionistic propositional formula A and a propositional v...
research
03/06/2022

Intertwining of Complementary Thue-Morse Factors

We consider the positions of occurrences of a factor x and its binary co...

Please sign up or login with your details

Forgot password? Click here to reset