Herbrand award acceptance speech

Herbrand award acceptance speech (2003)

Cached

Download Links

[gtps.math.cmu.edu]

Other Repositories/Bibliography

DBLP

by Peter B. Andrews

Citations:

4 - 0 self

BibTeX

@MISC{Andrews03herbrandaward,
    author = {Peter B. Andrews},
    title = {Herbrand award acceptance speech},
    year = {2003}
}

Bookmark

OpenURL

Abstract

Citations

926	A computing procedure for quantification theory - Davis, Putnam - 1960
829	A Machine–oriented Logic Based on the Resolution Principle - Robinson - 1965
728	A formulation of the simple theory of types - Church - 1940
279	An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof - Andrews - 1986
242	First-Order Logic - Smullyan - 1970
209	Investigations into logical deduction - Gentzen - 1969
169	A unication algorithm for typed calculus - Huet - 1975
102	Theorem proving via general matings - Andrews - 1981
101	Recherches sur la th'eorie de la d'emonstration - Herbrand - 1930
93	Resolution in type theory - Andrews - 1971
93	Mathematical logic as based on the theory of types - Russell - 1908
64	TPS: A theorem proving system for classical type theory - Andrews, Bishop, et al. - 1994
63	Proofs in higher-order logic - Miller - 1983
42	Transforming Matings into Natural Deduction Proofs - Andrews - 1980
25	A Compact Representation of Proofs - Miller - 1987
24	The TPS Theorem Proving System - Andrews, Issar, et al. - 1988
19	1971], Logical writings - Herbrand
18	Untersuchungen "uber das Logische Schliessen I und II. Mathematische Zeitschrift - Gentzen - 1935
17	Mechanizing !-Order Type Theory Through Unification - Jensen, Pietrzykowski - 1976
15	Selectively instantiating definitions, in - Bishop, Andrews - 1998
15	A proof method for quantification theory - Gilmore - 1960
15	Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs - Miller
14	Eliminating the Irrelevant from Mechanical Proofs - Davis - 1963
14	Presenting Intuitive Deductions via Symmetric Simplification - Pfenning, Nesmith
13	System description: TPS: A theorem proving system for type theory - Andrews, Bishop, et al. - 2000
12	A Proof of Cut-Elimination Theorem in Simple Type Theory - Takahashi - 1967
10	A Look at TPS - Miller, Cohen, et al. - 1982
9	Analytic and Non-Analytic Proofs - Pfenning - 1987
9	Syntactical and semantical properties of simple type theory - Schütte - 1960
8	On sets, types, fixed points, and checkerboards - Andrews, Bishop
8	Path-Focused Duplication: A Search Procedure for General Matings - Issar - 1990
6	Operational Issues in Automated Theorem Proving Using Matings - Issar - 1991
6	An improved proof procedure. Theoria - Prawitz - 1960
5	A breadth-first strategy for mating search - Bishop - 1999
5	A Proof Procedure for Quantification Theory - Quine - 1955
5	On a Generalized Logic Calculus - Takeuti - 1953
4	Mating Search Without Path Enumeration - Bishop - 1999
4	Solving for Set Variables in Higher-Order Theorem Proving - Brown - 2002
4	A supplement to Herbrand - Dreben, Denton - 1963
2	On the Fundamental Conjecture of GLC I - Takeuti - 1955
1	Resolution and the Consistency of Analysis - Andrews - 1974
1	TPS: An Interactive and Automatic Tool for Proving Theorems of Type Theory - Andrews, Bishop, et al. - 1994
1	Tutorial: Using TPS for Higher-Order Theorem Proving and ETPS for Teaching Logic - Andrews, Brown
1	and Eve Longini Cohen. Theorem Proving in Type Theory - Andrews - 1977
1	Edited by Solomon Feferman - Works, Press - 2003
1	Herbrand's error and G"odel's correction - Goldfarb - 1993
1	59] Jean van Heijenoort. From Frege to G"odel. A Source Book - html - 1967