Extensional proofs in a propositional logic modulo isomorphisms

System I is a proof language for 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 made equal. System I enjoys the strong normalization property. This is sufficient to prove the existence of empty types, but not to prove the introduc...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2023-10, Vol.977, p.114172, Article 114172
Hauptverfasser:	Díaz-Caro, Alejandro, Dowek, Gilles
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science Cut-elimination Eta-expansion Isomorphisms Logic Logic in Computer Science Proof-reduction Simply typed lambda calculus Strong normalization
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!