Results 1  10
of
156,801
A SchütteTait style cutelimination proof for firstorder Gödel logic
 In Automated Reasoning with Tableaux and Related Methods (Tableaux’02), volume 2381 of LNAI
, 2002
"... Abstract. We present a SchütteTait style cutelimination proof for the hypersequent calculus HIF for firstorder Gödel logic. This proof allows to bound the depth of the resulting cutfree derivation by 4 d ρ(d) , where d is the depth of the original derivation and ρ(d) the maximal complexity o ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
Abstract. We present a SchütteTait style cutelimination proof for the hypersequent calculus HIF for firstorder Gödel logic. This proof allows to bound the depth of the resulting cutfree derivation by 4 d ρ(d) , where d is the depth of the original derivation and ρ(d) the maximal complexity
Cutelimination for Simple Type Theory with an Axiom of Choice G.
, 1996
"... We present a cutelimination proof for simple type theory with axiom of choice modeled after Takahashi’s proof of cutelimination for simple type theory with extensionality. The same proof works when types are restricted, for example for secondorder classsical logic with axiom of choice. 1 Introduc ..."
Abstract
 Add to MetaCart
We present a cutelimination proof for simple type theory with axiom of choice modeled after Takahashi’s proof of cutelimination for simple type theory with extensionality. The same proof works when types are restricted, for example for secondorder classsical logic with axiom of choice. 1
Towards an Algorithmic Construction of CutElimination Procedures
 UNDER CONSIDERATION FOR PUBLICATION IN MATH. STRUCT. IN COMP. SCIENCE
, 2009
"... We investigate cutelimination in propositional substructural logics. The problem is to decide whether a given calculus admits (reductive) cutelimination. We show that, for commutative singleconclusion sequent calculi containing generalized knotted structural rules and arbitrary logical rules, the ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
, the problem can be decided by resolutionbased methods. A general cutelimination proof for these calculi is also provided.
Cutelimination for a logic with definitions and induction
 Theoretical Computer Science
, 1997
"... In order to reason about specifications of computations that are given via the proof search or logic programming paradigm one needs to have at least some forms of induction and some principle for reasoning about the ways in which terms are built and the ways in which computations can progress. The l ..."
Abstract

Cited by 72 (22 self)
 Add to MetaCart
that this logic has a number of applications. In this paper we prove the cutelimination theorem for F Oλ ∆IN, adapting a technique due to Tait and MartinLöf. This cutelimination proof is technically interesting and significantly extends previous results of this kind. 1
Cutelimination and proofsearch for biintuitionistic logic using nested sequents
, 2008
"... We propose a new sequent calculus for biintuitionistic logic which sits somewhere between display calculi and traditional sequent calculi by using nested sequents. Our calculus enjoys a simple (purely syntactic) cutelimination proof as do display calculi. But it has an easily derivable variant cal ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
We propose a new sequent calculus for biintuitionistic logic which sits somewhere between display calculi and traditional sequent calculi by using nested sequents. Our calculus enjoys a simple (purely syntactic) cutelimination proof as do display calculi. But it has an easily derivable variant
On proof mining by cutelimination
"... Abstract. We present cutelimination as a method of proof mining, in the sense that hidden mathematical information can be extracted by eliminating lemmas from proofs. We present reductive methods for cutelimination and the method ceres (cutelimination by resolution). A comparison of ceres with red ..."
Abstract
 Add to MetaCart
Abstract. We present cutelimination as a method of proof mining, in the sense that hidden mathematical information can be extracted by eliminating lemmas from proofs. We present reductive methods for cutelimination and the method ceres (cutelimination by resolution). A comparison of ceres
Cut Elimination for a Simple Formulation of Epsilon Calculus
, 2007
"... A simple cut elimination proof for arithmetic with epsilon symbol is used to establish termination of a modified epsilon substitution process. This opens a possibility of extension to much stronger systems. 1 ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
A simple cut elimination proof for arithmetic with epsilon symbol is used to establish termination of a modified epsilon substitution process. This opens a possibility of extension to much stronger systems. 1
Π ρ,σ,D
, 2008
"... There appears to be a gap in McDowell and Miller’s cutelimination proof for F Oλ ∆IN [1]. In particular, the induction measure used for cutelimination appears to be violated in the defL / ◦ L reduction case. ..."
Abstract
 Add to MetaCart
There appears to be a gap in McDowell and Miller’s cutelimination proof for F Oλ ∆IN [1]. In particular, the induction measure used for cutelimination appears to be violated in the defL / ◦ L reduction case.
CutElimination: Experiments with CERES
, 2005
"... Cutelimination is the most prominent form of proof transformation in logic. The elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical proofs. The cutelimination method CERES (cutelimination by resolution) works by constructing a set of ..."
Abstract

Cited by 16 (12 self)
 Add to MetaCart
Cutelimination is the most prominent form of proof transformation in logic. The elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical proofs. The cutelimination method CERES (cutelimination by resolution) works by constructing a set
Fast CutElimination by Projection
"... The transformation of arbitrary proofs in Gentzen’s calculus LK into cutfree proofs is of central importance not only to proof theory itself but also to computer ..."
Abstract
 Add to MetaCart
The transformation of arbitrary proofs in Gentzen’s calculus LK into cutfree proofs is of central importance not only to proof theory itself but also to computer
Results 1  10
of
156,801