Results 1  10
of
15
Efficient LoopCheck for Backward Proof Search in Some NonClassical Propositional Logics
, 1996
"... . We consider the modal logics KT and S4, the tense logic K t , and the fragment IPC (^;!) of intuitionistic logic. For these logics backward proof search in the standard sequent or tableau calculi does not terminate in general. In terms of the respective Kripke semantics, there are several kinds of ..."
Abstract

Cited by 33 (1 self)
 Add to MetaCart
. We consider the modal logics KT and S4, the tense logic K t , and the fragment IPC (^;!) of intuitionistic logic. For these logics backward proof search in the standard sequent or tableau calculi does not terminate in general. In terms of the respective Kripke semantics, there are several kinds of nontermination: loops inside a world (KT), innite resp. looping branches (S4, IPC (^;!) ), and innite branching degree (K t ). We give uniform sequentbased calculi that contain specically tailored loopchecks such that the eciency of proof search is not deteriorated. Moreover all these loopchecks are easy to implement and can be combined with optimizations. Note that our calculus for S4 is not a pure contractionfree sequent calculus, but this (theoretical) defect does not hinder its application in practice. 1 Introduction For many nonclassical propositional logics, backward proof search in the usual sequent calculi does not terminate in general. For all the logics we consider in th...
On an interpretation of second order quantification in first order intuitionistic propositional logic
 JOURNAL OF SYMBOLIC LOGIC, 57: 33 { 52
, 1992
"... We prove the following surprising property of Heyting's intuitionistic propositional calculus, IpC. Consider the collection of formulas, , built up from propositional variables (p; q; r; : ::) and falsity (?) using conjunction (^), disjunction (_) and implication (!). Write ` to indicate that such a ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
We prove the following surprising property of Heyting's intuitionistic propositional calculus, IpC. Consider the collection of formulas, , built up from propositional variables (p; q; r; : ::) and falsity (?) using conjunction (^), disjunction (_) and implication (!). Write ` to indicate that such a formula is intuitionistically valid. We show that for each variable p and formula there exists a formula Ap (e ectively computable from), containing only variables not equal to p which occur in, and such that for all formulas not involving p, ` ! Ap if and only if ` !. Consequently quanti cation over propositional variables can be modelled in IpC, and there is an interpretation of the second order propositional calculus, IpC2, in IpC which restricts to the identity on rst order propositions. An immediate corollary is the strengthening of the usual Interpolation Theorem for IpC to the statement that there are least and greatest interpolant formulas for any given pair of formulas. The result also has a number of interesting consequences for the algebraic counterpart of IpC, the theory of Heyting algebras. In particular we show that a model of IpC² can be constructed whose algebra of truthvalues is equal to any given Heyting algebra.
Connection Methods in Linear Logic and Proof Nets Construction
 Theoretical Computer Science
, 1999
"... Linear logic (LL) is the logical foundation of some typetheoretic languages and also of environments for specification and theorem proving. In this paper, we analyse the relationships between the proof net notion of LL and the connection notion used for efficient proofsearch in different logics. A ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Linear logic (LL) is the logical foundation of some typetheoretic languages and also of environments for specification and theorem proving. In this paper, we analyse the relationships between the proof net notion of LL and the connection notion used for efficient proofsearch in different logics. Aiming at using proof nets as a tool for automated deduction in linear logic, we define a connectionbased characterization of provability in Multiplicative Linear Logic (MLL). We show that an algorithm for proof net construction can be seen as a proofsearch connection method. This central result is illustrated with a specific algorithm that is able to construct, for a provable MLL sequent, a set of connections, a proof net and a sequent proof. From these results we expect to extend to other LL fragments, we analyse what happens with the additive connectives of LL by tackling the additive fragment in a similar way.
Admissibility of Structural Rules for ContractionFree Systems of Intuitionistic Logic
 Journal of Symbolic Logic
, 2000
"... We give a direct proof of admissibility of cut and contraction for the contractionfree sequent calculus G4ip for intuitionistic propositional logic and for a corresponding multisuccedent calculus; this proof extends easily in the presence of quantifiers, in contrast to other, indirect, proofs, i.e. ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
We give a direct proof of admissibility of cut and contraction for the contractionfree sequent calculus G4ip for intuitionistic propositional logic and for a corresponding multisuccedent calculus; this proof extends easily in the presence of quantifiers, in contrast to other, indirect, proofs, i.e. those which use induction on sequent weight or appeal to admissibility of rules in other calculi.
Fast Tacticbased Theorem Proving
 TPHOLs 2000, LNCS 1869
, 2000
"... Theorem provers for higherorder logics often use tactics to implement automated proof search. Tactics use a generalpurpose metalanguage to implement both generalpurpose reasoning and computationally intensive domainspecific proof procedures. The generality of tactic provers has a performance pe ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
Theorem provers for higherorder logics often use tactics to implement automated proof search. Tactics use a generalpurpose metalanguage to implement both generalpurpose reasoning and computationally intensive domainspecific proof procedures. The generality of tactic provers has a performance penalty; the speed of proof search lags far behind specialpurpose provers. We present a new modular proving architecture that significantly increases the speed of the core logic engine.
STRIP: Structural sharing for efficient proofsearch
 Asian Computing Science Conference, ASIAN'99, LNCS 1742
, 1999
"... The STRIP system is a theorem prover for intuitionistic propositional logic with two main characteristics: it deals with the duplication of formulae during proofsearch from a fine and explicit management of formulae (as resources) based on a structural sharing and it builds, for a given formula, e ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
The STRIP system is a theorem prover for intuitionistic propositional logic with two main characteristics: it deals with the duplication of formulae during proofsearch from a fine and explicit management of formulae (as resources) based on a structural sharing and it builds, for a given formula, either a proof or a countermodel.
Semantic Labelled Tableaux for Propositional BI
 Journal of Logic and Computation
, 2003
"... In this paper, we study semantic labelled tableaux for the propositional Bunched Implications logic (BI) that freely combines intuitionistic logic (IL) and multiplicative intuitionistic linear logic (MILL). ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper, we study semantic labelled tableaux for the propositional Bunched Implications logic (BI) that freely combines intuitionistic logic (IL) and multiplicative intuitionistic linear logic (MILL).
Admissibility of Structural Rules for Extensions of Contractionfree Sequent Calculi
"... The contractionfree sequent calculus G4 for intuitionistic logic is extended by rules following a general rulescheme for nonlogical axioms. Admissibility of structural rules for these extensions is proved in a direct way by induction on derivations. This method permits the representation of variou ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The contractionfree sequent calculus G4 for intuitionistic logic is extended by rules following a general rulescheme for nonlogical axioms. Admissibility of structural rules for these extensions is proved in a direct way by induction on derivations. This method permits the representation of various applied logics as complete, contraction and cutfree sequent calculus systems with some restrictions on the nature of the derivations. As specic examples, intuitionistic theories of apartness and order and (Robinsonstyle) arithmetic are treated. Keywords: applied sequent calculus, contractionfree, apartness, conservativity, cutelimination 1 Introduction Extension of a cutfree sequent calculus with new rules can easily destroy the cutfree nature of the calculus. In other words, if two calculi are equivalent in the sense of deriving the same sequents, the addition of some new rules to each calculus can generate nonequivalent calculi. In this paper we address a particular example wh...
Bisimulations, Model Descriptions and Propositional Quanti ers
, 1996
"... In this paper we giveperspicuous proofs of the existence of model descriptions for nite Kripke models and of Uniform Interpolation for the theories IPC, K, GL and S4Grz, using bounded bisimulations. 1 ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this paper we giveperspicuous proofs of the existence of model descriptions for nite Kripke models and of Uniform Interpolation for the theories IPC, K, GL and S4Grz, using bounded bisimulations. 1