Notre Dame Journal of Formal Logic · 2006 · 36 citations · 13 references
HumanitiesComputer ScienceKnowledge RepresentationLogicTheory Of ComputationDeductive ReasoningDeductive SystemsModel TheoryPredicate LogicPropositional LogicAxiom SystemsAxiomatizationFormal Proof SystemsLocality ConditionsPredicate Logic SemanticsPropositional Reasoning
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. Unlike sequent systems, they drop the restriction that rules only apply to the main connective of a formula: their rules apply anywhere deeply inside a formula. This allows to observe very clearly the symmetry between identity axiom and the cut rule. This symmetry allows to reduce the cut rule to atomic form in a way which is dual to reducing the identity axiom to atomic form. We also reduce weakening and even contraction to atomic form. This leads to inference rules that are local: they do not require the inspection of expressions of arbitrary size.
13
Jean-Yves Girard · Theoretical Computer Science · 1987 · 4.1K citations
Investigations into Logical Deduction
Gerhard Gentzen · American Philosophical Quarterly · 1964 · 661 citations
Uniform proofs as a foundation for logic programming
Dale Miller, Gopalan Nadathur, Frank Pfenning et al. · Annals of Pure and Applied Logic · 1991 · 576 citations
Computing, Computer Science, Logic +16
A game semantics for linear logic
Andreas Blass · Annals of Pure and Applied Logic · 1992 · 285 citations · Full text