Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus

Authors:
Hugo Herbelin;Gyesik Lee
Affiliations:
INRIA & PPS, Paris Universitééé 7, Paris, France;ROSAEC center, Seoul National University, Seoul, Korea
Venue:
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Year:
2009

Citing 8
Cited 1

Linear logic

Theoretical Computer Science
LKQ and LKT

Proceedings of the workshop on Advances in linear logic
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics

Theoretical Computer Science
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Normalisation by Evaluation

Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
From Semantics to Rules: A Machine Assisted Analysis

CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure

CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development

Polarized classical non-associative Lambek calculus and formal semantics

LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-free intuitionistic sequent calculus as formal system and by combining soundness with completeness, we obtain an executable cut-elimination procedure. The proof, which has been formalised in the Coq proof assistant, easily extends to the case of the absurdity connective using Kripke models with exploding nodes.