MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  2004, Route des Lucioles

Download:
Download as a PDF | Download as a PS
by Amy Felty
ftp://ftp.research.bell-labs.com/dist/felty/welp91.ps.gz
Add To MetaCart

Abstract:

In this paper, we show that an intuitionistic logic with second-order function quantification, called hh 2 here, can serve as a meta-language to directly and naturally specify both sequent calculi and natural deduction inference systems for first-order logic. For the intuitionistic subset of first-order logic, we present a set of hh 2 formulas which simultaneously specifies both kinds of inference systems and provides a direct and concise account of the correspondence between cut-free sequential proofs and normal natural deduction proofs. The logic of hh

Citations

635 A formulation of the simple theory of types – Church - 1940
377 Isabelle: A generic theorem prover – Paulson - 1994
344 Uniform proofs as a foundation for logic programming – Miller, Nadathur, et al. - 1991
197 An Overview of Prolog – Nadathur, Miller - 1988
180 A unification algorithm for typed -calculus – Huet - 1975
176 Investigations into logical deduction – Gentzen - 1969
120 Ideas and results in proof theory – Prawitz - 1971
95 Elements of Intuitionism – Dummett - 1977
64 Specifying Theorem Provers in a Higher-Order Logic Programming Language – Felty, Miller - 1988
62 Higher-order Horn clauses – Nadathur, Miller - 1990
51 Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language – Felty - 1989
26 Normalization as a homomorphic image of cut-elimination – Pottinger - 1977
22 Natural Deduction. Almqvist – Prawitz - 1965
19 Introduction to Combinatory Logic and Lambda Calculus – Hindley, Seldin - 1986
3 eLP, a Common Lisp implementation of Prolog – Elliott, Pfenning - 1989
1 Cut-elimination and normalization – Zucker - 1974