Proof Normalisation in a Logic Identifying Isomorphic Propositions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Proof Normalisation in a Logic Identifying Isomorphic Propositions

Abstract

We define a fragment of propositional logic where isomorphic propositions, such as A ∧ B and B ∧ A, or A ⇒ (B ∧ C) and (A ⇒ B) ∧ (A ⇒ C) are identified. We define System I, a proof language for this logic, and prove its normalisation and consistency.
Fichier principal
Vignette du fichier
proofnormalization.pdf (614.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02909135 , version 1 (30-07-2020)

Identifiers

  • HAL Id : hal-02909135 , version 1

Cite

Alejandro Díaz-Caro, Gilles Dowek. Proof Normalisation in a Logic Identifying Isomorphic Propositions. FSCD 2019 - International Conference on Formal Structures for Computation and Deduction, Jun 2019, Dortmund, Germany. ⟨hal-02909135⟩

Collections

INRIA INRIA2
28 View
11 Download

Share

Gmail Facebook Twitter LinkedIn More