License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2019.14
URN: urn:nbn:de:0030-drops-105210
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10521/
Go to the corresponding LIPIcs Volume Portal

Díaz-Caro, Alejandro ; Dowek, Gilles

Proof Normalisation in a Logic Identifying Isomorphic Propositions

pdf-format:
LIPIcs-FSCD-2019-14.pdf (0.5 MB)

Abstract

We define a fragment of propositional logic where isomorphic propositions, such as A wedge B and B wedge A, or A ==> (B wedge C) and (A ==> B) wedge (A ==> C) are identified. We define System I, a proof language for this logic, and prove its normalisation and consistency.

BibTeX - Entry

@InProceedings{dazcaro_et_al:LIPIcs:2019:10521,
  author =	{Alejandro D{\'i}az-Caro and Gilles Dowek},
  title =	{{Proof Normalisation in a Logic Identifying Isomorphic Propositions}},
  booktitle =	{4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019)},
  pages =	{14:1--14:23},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-107-8},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{131},
  editor =	{Herman Geuvers},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10521},
  URN =		{urn:nbn:de:0030-drops-105210},
  doi =		{10.4230/LIPIcs.FSCD.2019.14},
  annote =	{Keywords: Simply typed lambda calculus, Isomorphisms, Logic, Cut-elimination, Proof-reduction}
}

Keywords: Simply typed lambda calculus, Isomorphisms, Logic, Cut-elimination, Proof-reduction
Collection: 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019)
Issue Date: 2019
Date of publication: 18.06.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI