2012•Theoretical Computer ScienceOpen access

A formal framework for specifying sequent calculus proof systems

Dale Miller, Elaine Pimentel

Open full text 46 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 46 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Natural deduction, Sequent calculus, Cut-elimination theorem, Proof calculus, Rule of inference, Sequent, Curry–Howard correspondence, Decidability

Back to paper search Browse research topics Original source

A formal framework for specifying sequent calculus proof systems — Research Paper | ScholarLens