Results

**1 - 6**of**6**### THEOREM PROVING FOR PRENEX GÖDEL LOGIC WITH △: CHECKING VALIDITY AND UNSATISFIABILITY

, 2011

"... First-order Gödel logic with the projection operator △ (G △ ∞) is an important many-valued as well as intermediate logic. In contrast to classical logic, the validity and the satisfiability problems of G △ ∞ are not directly dual to each other. We nevertheless provide a uniform, computational trea ..."

Abstract
- Add to MetaCart

(Show Context)
First-order Gödel logic with the projection operator △ (G △ ∞) is an important many-valued as well as intermediate logic. In contrast to classical logic, the validity and the satisfiability problems of G △ ∞ are not directly dual to each other. We nevertheless provide a uniform, computational treatment of both problems for prenex formulas by describing appropriate translations into sets of order clauses that can be subjected to chaining resolution. For validity a version of Herbrand’s Theorem allows us to show the soundness of standard Skolemization. For satisfiability the translation involves a novel, extended Skolemization method.

### A Systematic Approach to Canonicity in the Classical Sequent Calculus

"... The sequent calculus is often criticized for requiring proofs to be laden with large volumes of low-level syntactic details that can obscure the essence of a given proof. Because each inference rule introduces only a single connective, cut-free sequent proofs can separate closely related steps—such ..."

Abstract
- Add to MetaCart

The sequent calculus is often criticized for requiring proofs to be laden with large volumes of low-level syntactic details that can obscure the essence of a given proof. Because each inference rule introduces only a single connective, cut-free sequent proofs can separate closely related steps—such as instantiating a block of quantifiers—by irrelevant noise. Moreover, the sequential nature of sequent proofs forces proof steps that are syntactically non-interfering and permutable to nevertheless be written in some arbitrary order. The sequent calculus thus lacks a notion of canonicity: proofs that should be considered essentially the same may not have a common syntactic form. To fix this problem, many researchers revolt against the sequent calculus and replace it with proof structures that are more parallel or geometric. Proof-nets, matings, and atomic flows are examples of such revolutionary formalisms. In this paper, we propose taking, instead, an evolutionary approach to recover canonicity within the sequent calculus, an approach we illustrate for classical first-order logic. We use a multi-focused sequent system as our means of abstracting away the details from classical sequent proofs. We then show that, among the focused sequent proofs, the maximally multi-focused proofs, which make the foci as parallel as possible, are canonical. Moreover, such proofs are isomorphic to expansion tree proofs—a well known, simple, and parallel generalization of Herbrand disjunctions—for classical first-order logic. We thus provide a systematic method of recovering the essence of any sequent proof without abandoning the sequent calculus. 1

### The Isomorphism Between Expansion Proofs and Multi-Focused Sequent Proofs

, 2012

"... The sequent calculus is often criticized for requiring proofs to contain large amounts of low-level syntactic details that can obscure the essence of a given proof. Because each inference rule introduces only a single connective, sequent proofs can separate closely related steps—such as instantiatin ..."

Abstract
- Add to MetaCart

(Show Context)
The sequent calculus is often criticized for requiring proofs to contain large amounts of low-level syntactic details that can obscure the essence of a given proof. Because each inference rule introduces only a single connective, sequent proofs can separate closely related steps—such as instantiating a block of quantifiers—by irrelevant noise. Moreover, the sequential nature of sequent proofs forces proof steps that are syntactically non-interfering and permutable to nevertheless be written in some arbitrary order. The sequent calculus thus lacks a notion of canonicity: proofs that should be considered essentially the same may not have a common syntactic form. To fix this problem, many researchers have proposed replacing the sequent calculus with proof structures that are more parallel or geometric. Proof-nets, matings, and atomic flows are examples of such revolutionary formalisms. We propose, instead, an evolutionary approach to recover canonicity within the sequent calculus, which we illustrate for classical first-order logic. The essential element of our approach is the use of a multi-focused sequent calculus as the means for abstracting away low-level details from classical cut-free sequent proofs. We show that, among the multi-focused proofs, the maximally multi-focused proofs that collect together all possible parallel foci are canonical. Moreover, if we start with a certain focused sequent proof system, such proofs are isomorphic to expansion proofs—a well known, minimalistic, and parallel generalization of Herbrand disjunctions—for classical first-order logic. This technique appears to be a systematic way to recover the essence of sequent calculus proofs. 1

### A Multi-Focused Proof System Isomorphic to Expansion Proofs

, 2013

"... The sequent calculus is often criticized for requiring proofs to contain large amounts of low-level syntactic details that can obscure the essence of a given proof. Because each inference rule introduces only a single connective, sequent proofs can separate closely related steps—such as instantiatin ..."

Abstract
- Add to MetaCart

(Show Context)
The sequent calculus is often criticized for requiring proofs to contain large amounts of low-level syntactic details that can obscure the essence of a given proof. Because each inference rule introduces only a single connective, sequent proofs can separate closely related steps—such as instantiating a block of quantifiers—by irrelevant noise. Moreover, the sequential nature of sequent proofs forces proof steps that are syntactically non-interfering and permutable to nevertheless be written in some arbitrary order. The sequent calculus thus lacks a notion of canonicity: proofs that should be considered essentially the same may not have a common syntactic form. To fix this problem, many researchers have proposed replacing the sequent calculus with proof structures that are more parallel or geometric. Proof-nets, matings, and atomic flows are examples of such revolutionary formalisms. We propose, instead, an evolutionary approach to recover canonicity within the sequent calculus, which we illustrate for classical first-order logic. The essential element of our approach is the use of a multi-focused sequent calculus as the means for abstracting away low-level details from classical cut-free sequent proofs. We show that, among the multi-focused proofs, the maximally multi-focused proofs that collect together all possible parallel foci are canonical. Moreover, if we start with a certain focused sequent proof system, such proofs are isomorphic to expansion proofs—a well known, minimalistic, and parallel generalization of Herbrand disjunctions—for classical first-order logic. This technique appears to be a systematic way to recover the “essence of proof ” from within sequent calculus proofs. 1