PlumX Metrics
Embed PlumX Metrics

A General Glivenko–Gödel Theorem for Nuclei

Electronic Proceedings in Theoretical Computer Science, EPTCS, ISSN: 2075-2180, Vol: 351, Page: 51-66
2021
  • 1
    Citations
  • 0
    Usage
  • 0
    Captures
  • 0
    Mentions
  • 0
    Social Media
Metric Options:   Counts1 Year3 Year

Metrics Details

  • Citations
    1

Conference Paper Description

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.

Bibliographic Details

Ana Sokolova; Giulio Fellin; Peter Schuster

Open Publishing Association

Computer Science

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know