DeepAI AI Chat
Log In Sign Up

Extensional proofs in a propositional logic modulo isomorphisms

by   Alejandro Díaz-Caro, et al.
ENS Paris-Saclay
University of Buenos Aires

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 introduction property (every normal closed term is an introduction). Moreover, a severe restriction had to be made on the types of the variables in order to obtain the existence of empty types. We show here that adding η-expansion rules to System I permit to drop this restriction and to retrieve full introduction property.


page 1

page 2

page 3

page 4


Proofs and Refutations for Intuitionistic and Second-Order Logic (Extended Version)

The lambda-PRK-calculus is a typed lambda-calculus that exploits the dua...

A Constructive Logic with Classical Proofs and Refutations (Extended Version)

We study a conservative extension of classical propositional logic disti...

Resolution for Constrained Pseudo-Propositional Logic

This work, shows how propositional resolution can be generalized to obta...

A constructive proof of dependent choice in classical arithmetic via memoization

In a recent paper, Herbelin developed dPA^ω, a calculus in which constru...

Partial Regularization of First-Order Resolution Proofs

Resolution and superposition are common techniques which have seen wides...

The Effects of Adding Reachability Predicates in Propositional Separation Logic

The list segment predicate ls used in separation logic for verifying pro...