Classical Type Theory

[1]  Dov M. Gabbay,et al.  Handbook of logic in artificial intelligence and logic programming (vol. 1) , 1993 .

[2]  D. Prawitz.  Ideas and Results in Proof Theory , 1971 .

[3]  Matthew Bishop,et al.  A Breadth-First Strategy for Mating Search , 1999, CADE.

[4]  G. Takeuti.  Proof Theory , 1975 .

[5]  Jean H. Gallier,et al.  Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

[6]  Ian Green,et al.  System description : Proof planning in higher-order logic with λ Clam , 1998 .

[7]  Amy P. Felty,et al.  Using Extended Tactics to Do Proof Transformations , 1986 .

[8]  Alonzo Church,et al.  Introduction to Mathematical Logic , 1991 .

[9]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[10]  Gérard P. Huet,et al.  A Unification Algorithm for Typed lambda-Calculus , 1975, Theor. Comput. Sci..

[11]  W. V. Quine,et al.  Natural deduction , 2021, An Introduction to Proof Theory.

[12]  Dale Miller.  Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs , 1984, CADE.

[13]  J. Heijenoort.  From Frege To Gödel , 1967 .

[14]  Gaisi Takeuti,et al.  On a generalized logic calculus , 1953 .

[15]  Kohlhase,et al.  A unifying principle for extensional higher-order logic , 1993 .

[16]  R. Goodstein.  FIRST-ORDER LOGIC , 1969 .

[17]  Peter B. Andrews.  Theorem Proving via General Matings , 1981, JACM.

[18]  Peter B. Andrews.  General models and extensionality , 1972, Journal of Symbolic Logic.

[19]  Wolfgang Bibel,et al.  Automated Theorem Proving , 1987, Artificial Intelligence / Künstliche Intelligenz.

[20]  John Denton,et al.  A supplement to Herbrand , 1966, Journal of Symbolic Logic.

[21]  Peter B. Andrews,et al.  False lemmas in Herbrand , 1963 .

[22]  Moto-O. Takahashi,et al.  A proof of cut-elimination theorem in simple type-theory , 1967 .

[23]  Christoph Benzmüller,et al.  System Description: LEO - A Higher-Order Theorem Prover , 1998, CADE.

[24]  Keith Hanna,et al.  Specification and Verification using Higher-Order Logic: A Case Study , 1986 .

[25]  R. Statman.  Bounds for proof-search and speed-up in the predicate calculus , 1978 .

[26]  Ian Green,et al.  System Description: Proof Planning in Higher-Order Logic with Lambda-Clam , 1998, CADE.

[27]  Daniel Leivant,et al.  Higher order logic , 1994, Handbook of Logic in Artificial Intelligence and Logic Programming.

[28]  Herman Rubin,et al.  Equivalents of the Axiom of Choice , 1970 .

[29]  Volker Sorge,et al.  Omega: Towards a Mathematical Assistant , 1997, CADE.

[30]  Sunil Issar.  Path-Focused Duplication: A Search Procedure for General Matings , 1990, AAAI.

[31]  GERARD P. HUET,et al.  The Undecidability of Unification in Third Order Logic , 1973, Inf. Control..

[32]  Michael J. C. Gordon,et al.  Set Theory, Higher Order Logic or Both? , 1996, TPHOLs.

[33]  Dag Prawitz.  Hauptsatz for Higher Order Logic , 1968, J. Symb. Log..

[34]  Peter B. Andrews,et al.  On Sets, Types, Fixed Points, and Checkerboards , 1996, TABLEAUX.

[35]  Peter B. Andrews.  An introduction to mathematical logic and type theory - to truth through proof , 1986, Computer science and applied mathematics.

[36]  Peter B. Andrews,et al.  Mating search without path enumeration , 1999 .

[37]  Gérard Huet,et al.  Constrained resolution: a complete method for higher-order logic. , 1972 .

[38]  David A. Wolfram,et al.  The Clausal Theory of Types , 1993 .

[39]  Christoph Benzmüller,et al.  Extensional Higher-Order Resolution , 1998, CADE.

[40]  Peter B. Andrews.  Transforming Matings into Natural Deduction Proofs , 1980, CADE.

[41]  Karsten Konrad.  HOT: A Concurrent Automated Theorem Prover Based on Higher-Order Tableaux , 1998, TPHOLs.

[42]  Peter B. Andrews.  Resolution and the consistency of analysis , 1974, Notre Dame J. Formal Log..

[43]  John Alan Robinson.  New directions in mechanical theorem proving , 1968, IFIP Congress.

[44]  Warren D. Goldfarb,et al.  The Undecidability of the Second-Order Unification Problem , 1981, Theor. Comput. Sci..

[45]  P. Andrews,et al.  A transfinite type theory with type variables , 1965 .

[46]  W. W. Bledsoe,et al.  Set Variables , 1977, IJCAI.

[47]  Solomon Feferman,et al.  Systems of predicative analysis , 1964, Journal of Symbolic Logic.

[48]  Herman Geuvers,et al.  Proof-Assistants Using Dependent Type Systems , 2001, Handbook of Automated Reasoning.

[49]  Keith Hanna,et al.  Specification and Verification using Higher-Order Logic , 1985 .

[50]  Frank Pfenning,et al.  Presenting Intuitive Deductions via Symmetric Simplification , 1990, CADE.

[51]  J. V. Tucker,et al.  Basic Simple Type Theory , 1997 .

[52]  Tomasz Pietrzykowski,et al.  Mechanizing omega-Order Type Theory Through Unification , 1976, Theor. Comput. Sci..

[53]  Dale A. Miller.  A compact representation of proofs , 1987, Stud Logica.

[54]  Frank Pfenning,et al.  Logical Frameworks , 2001, Handbook of Automated Reasoning.

[55]  L. Henschen.  N-sorted logic for automatic theorem-proving in higher-order logic , 1972, ACM Annual Conference.

[56]  S. Shapiro,et al.  Foundations Without Foundationalism: A Case for Second-Order Logic. , 1994 .

[57]  Patricia Johann,et al.  Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading , 1994, CADE.

[58]  Christoph Benzmüller,et al.  Equality and extensionality in automated higher order theorem proving , 1999 .

[59]  Peter B. Andrews,et al.  Selectively Instantiating Definitions , 1998, CADE.

[60]  Michael Kohlhase,et al.  Higher-Order Tableaux , 1995, TABLEAUX.

[61]  Leon Henkin,et al.  Completeness in the theory of types , 1950, Journal of Symbolic Logic.

[62]  Michael Kohlhase,et al.  A mechanization of sorted higher-order logic based on the resolution principle , 1994 .

[63]  Gilles Dowek,et al.  Higher-Order Unification and Matching , 2001, Handbook of Automated Reasoning.

[64]  Dieter Hutter,et al.  A colored version of the λ-calculus , 1997 .

[65]  W. W. Bledsoe,et al.  Using Examples to Generate Instantiations of Set Variables , 1983, IJCAI.

[66]  Takahashi Moto-o.  A sysytem of simple type theory of Gentzen style with inference on extensionality, and cut-elimination in it , 1970 .

[67]  Dieter Hutter,et al.  A Colored Version of the Lambda-Calculus , 1997, CADE.

[68]  S. Shapiro.  Foundations without Foundationalism: A Case for Second-Order Logic , 1994 .

[69]  Samuel R. Buss,et al.  On Gödel's theorems on lengths of proofs I: Number of lines and speedup for arithmetics , 1994, Journal of Symbolic Logic.

[70]  Tomasz Pietrzykowski.  A Complete Mechanization of Second-Order Type Theory , 1973, JACM.

[71]  Michael Kohlhase,et al.  Higher-Order Order-Sorted Resolution , 1999 .

[72]  Peter B. Andrews.  Resolution in type theory , 1971, Journal of Symbolic Logic.

[73]  Dale A. Miller.  Proofs in Higher-Order Logic , 1983 .

[74]  Peter B. Andrews,et al.  AUTOMATING HIGHER-ORDER LOGIC , 1984 .

[75]  Gerard P. Hubt.  A mechanization of type theory , 1973, IJCAI 1973.

[76]  R. Smullyan.  A UNIFYING PRINCIPAL IN QUANTIFICATION THEORY. , 1963, Proceedings of the National Academy of Sciences of the United States of America.

[77]  Christoph Benzmüller,et al.  Extensional Higher-Order Paramodulation and RUE-Resolution , 1999, CADE.