Results 11  20
of
1,923
3.2 Correspondence to the Sequent Calculus............. 8
"... Abstract In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a topdown symmetry and some normal forms for derivations that are not available ..."
Abstract
 Add to MetaCart
Abstract In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a topdown symmetry and some normal forms for derivations
Linear logic as a framework for specifying sequent calculus
 Lecture Notes in Logic 17, Logic Colloquium’99
, 2004
"... Abstract. In recent years, intuitionistic logic and type systems have been used in numerous computational systems as frameworks for the specification of natural deduction proof systems. As we shall illustrate here, linear logic can be used similarly to specify the more general setting of sequent cal ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
calculus proof systems. Linear logic’s meta theory can be used also to analyze properties of a specified objectlevel proof system. We shall present several example encodings of sequent calculus proof systems using the Forum presentation of linear logic. Since the objectlevel encodings result in logic
Transfer of Sequent Calculus Strategies to Resolution for S4
 IN PROOF THEORY OF MODAL LOGIC, STUDIES IN PURE AND APPLIED LOGIC 2
, 1996
"... This paper illustrates for the propositional S4 a general scheme of transferring strategies of proof search in a cutfree Gentzentype system into a resolution type system, preserving the structure of derivations. This is a direct extension of the method introduced by Maslov for classical predica ..."
PESCA — A Proof Editor for Sequent Calculus
, 2000
"... Abstract. PESCA is a program that helps in the construction of proofs in sequent calculus. It works both as a proof editor and as an automatic theorem prover. Proofs constructed in PESCA can both be seen on the terminal and printed into LATEX files. The user of PESCA can choose among different versi ..."
Abstract
 Add to MetaCart
Abstract. PESCA is a program that helps in the construction of proofs in sequent calculus. It works both as a proof editor and as an automatic theorem prover. Proofs constructed in PESCA can both be seen on the terminal and printed into LATEX files. The user of PESCA can choose among different
A cutfree sequent calculus with εsymbols
"... Let L 0 be a language of firstorder predicate logic. The intermediate predicate logic CD (language L 0) is obtained by adding the axiom ∀x(A(x)∨B)→(∀xA(x)∨B) to the intuitionistic logic. CD is known to be complete with respect to Kripkemodels with constant domains. Problem 1 Find a good (i.e., cut ..."
Abstract
 Add to MetaCart
.e., cutfree and simple) sequent calculus for CD. In [1], there are some solutions to this problem. Recently I try to give another solution which is a sequent calculus with single succedent (“LJstyle”), but this plan does not succeed yet. L ε is the extension of L 0 with “εterms”: εxA(x) and ¯εx
Relational Queries Computable in Polynomial Time
 Information and Control
, 1986
"... We characterize the polynomial time computable queries as those expressible in relational calculus plus a least fixed point operator and a total ordering on the universe. We also show that even without the ordering one application of fixed point suffices to express any query expressible with several ..."
Abstract

Cited by 318 (17 self)
 Add to MetaCart
Query languages for relational databases have received considerable attention. In 1972 Codd showed that two natural languages for queries  one algebraic and the other a version of first order predicate calculus  have identical powers of expressibility, [Cod72]. Query languages which
A Constraint Sequent Calculus for FirstOrder Logic with Linear Integer Arithmetic
"... Firstorder logic modulo the theory of integer arithmetic is the basis for reasoning in many areas, including deductive software verification and software model checking. While satisfiability checking for ground formulae in this logic is well understood, it is still an open question how the general ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
the general case of quantified formulae can be handled in an efficient and systematic way. As a possible answer, we introduce a sequent calculus that combines ideas from freevariable constraint tableaux with the Omega quantifier elimination procedure. The calculus is complete for theorems of first
Tabled Evaluation with Delaying for General Logic Programs
, 1996
"... SLD resolution with negation as finite failure (SLDNF) reflects the procedural interpretation of predicate calculus as a programming language and forms the computational basis for Prolog systems. Despite its advantages for stackbased memory management, SLDNF is often not appropriate for query evalu ..."
Abstract

Cited by 304 (29 self)
 Add to MetaCart
SLD resolution with negation as finite failure (SLDNF) reflects the procedural interpretation of predicate calculus as a programming language and forms the computational basis for Prolog systems. Despite its advantages for stackbased memory management, SLDNF is often not appropriate for query
Results 11  20
of
1,923