DeepAI AI Chat
Log In Sign Up

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

by   Pablo Barenbaum, et al.

We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and it may be strong or classical. Proofs of strong propositions must be constructive in some sense, whereas proofs of classical propositions proceed by contradiction. The system, in natural deduction style, is shown to be sound and complete with respect to a Kripke semantics. We develop the system from the perspective of the propositions-as-types correspondence by deriving a term assignment system with confluent reduction. The proof of strong normalization relies on a translation to System F with Mendler-style recursion.


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...

Constructive Galois Connections

Galois connections are a foundational tool for structuring abstraction i...

Extensional proofs in a propositional logic modulo isomorphisms

System I is a proof language for a fragment of propositional logic where...

An extended type system with lambda-typed lambda-expressions (extended version)

We present the type system d, an extended type system with lambda-typed ...

An extended type system with lambda-typed lambda-expressions

We present the system d, an extended type system with lambda-typed lambd...

Animated Logic: Correct Functional Conversion to Conjunctive Normal Form

We present an approach to obtain formally verified implementations of cl...

A Universal Technique for Machine-Certified Proofs of Linearizable Algorithms

Linearizability has been the long standing gold standard for consistency...