Skip to main content
×
Home
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 343
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Ahmed, Waqar Hasan, Osman and Tahar, Sofiène 2016. Formalization of Reliability Block Diagrams in Higher-order Logic. Journal of Applied Logic, Vol. 18, p. 19.


    Běhounek, Libor 2016. A minimalistic many-valued theory of types. Journal of Logic and Computation, p. exw006.


    Benzmüller, Christoph 2016. Cut-Elimination for Quantified Conditional Logic. Journal of Philosophical Logic,


    BERGER, ULRICH and HOU, TIE 2016. A realizability interpretation of Church's simple theory of types. Mathematical Structures in Computer Science, p. 1.


    Blanchette, Jasmin Christian Fleury, Mathias and Weidenbach, Christoph 2016. Automated Reasoning.


    Blanchette, Jasmin Christian Böhme, Sascha Fleury, Mathias Smolka, Steffen Juilf and Steckermeier, Albert 2016. Semi-intelligible Isar Proofs from Machine-Generated Proofs. Journal of Automated Reasoning, Vol. 56, Issue. 2, p. 155.


    Blanqui, Frédéric 2016. Termination of rewrite relations on λ-terms based on Girard's notion of reducibility. Theoretical Computer Science, Vol. 611, p. 50.


    Brown, Chad E. and Urban, Josef 2016. Intelligent Computer Mathematics.


    Brucker, Achim D. and Wolff, Burkhart 2016. Tests and Proofs.


    Chihani, Zakaria Miller, Dale and Renaud, Fabien 2016. A Semantic Framework for Proof Evidence. Journal of Automated Reasoning,


    Eklund, Patrik Höhle, Ulrich and Kortelainen, Jari 2016. A survey on the categorical term construction with applications. Fuzzy Sets and Systems, Vol. 298, p. 128.


    Eklund, Patrik 2016. Information Processing and Management of Uncertainty in Knowledge-Based Systems.


    Farmer, William M. 2016. Intelligent Computer Mathematics.


    Kamareddine, Fairouz Seldin, Jonathan P. and Wells, J.B. 2016. Bridging Curry and Church's typing style. Journal of Applied Logic, Vol. 18, p. 42.


    Klev, Ansten 2016. Identity and Sortals (and Caesar). Erkenntnis,


    Kumar, Ramana Arthan, Rob Myreen, Magnus O. and Owens, Scott 2016. Self-Formalisation of Higher-Order Logic. Journal of Automated Reasoning, Vol. 56, Issue. 3, p. 221.


    Nigam, Vivek Pimentel, Elaine and Reis, Giselle 2016. An extended framework for specifying and reasoning about proof systems. Journal of Logic and Computation, Vol. 26, Issue. 2, p. 539.


    Rabe, Florian 2016. The Future of Logic: Foundation-Independence. Logica Universalis, Vol. 10, Issue. 1, p. 1.


    Steen, Alexander Wisniewski, Max and Benzmüller, Christoph 2016. Mathematical Software – ICMS 2016.


    Suzuki, Kenichi Kiselyov, Oleg and Kameyama, Yukiyoshi 2016. Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation - PEPM 2016. p. 37.

    ×

A formulation of the simple theory of types

  • Alonzo Church (a1)
  • DOI: http://dx.doi.org/10.2307/2266170
  • Published online: 01 March 2014
Abstract

The purpose of the present paper is to give a formulation of the simple theory of types which incorporates certain features of the calculus of λ-conversion. A complete incorporation of the calculus of λ-conversion into the theory of types is impossible if we require that λx and juxtaposition shall retain their respective meanings as an abstraction operator and as denoting the application of function to argument. But the present partial incorporation has certain advantages from the point of view of type theory and is offered as being of interest on this basis (whatever may be thought of the finally satisfactory character of the theory of types as a foundation for logic and mathematics).

For features of the formulation which are not immediately connected with the incorporation of λ-conversion, we are heavily indebted to Whitehead and Russell, Hilbert and Ackermann, Hilbert and Bernays, and to forerunners of these, as the reader familiar with the works in question will recognize.

The class of type symbols is described by the rules that ı and o are each type symbols and that if α and β are type symbols then (αβ) is a type symbol: it is the least class of symbols which contains the symbols ı and o and is closed under the operation of forming the symbol (αβ) from the symbols α and β.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

Rudolf Carnap , Abriss der Logistik, Vienna1929, §9

Bertrand Russell , Mathematical logic as based on the theory of types, American journal of mathematics, vol. 30 (1908), pp. 222262

M. Schönfinkel , Über die Bausteine der mathematischen Logik, Mathematische Annalen, vol. 92 (1924), pp. 305316

S. C. Kleene , A theory of positive integers informal logic, American journal of mathematics, vol. 57 (1935), pp. 153–173, 219244

P. Bernays , Axiomatische Untersuchung des Aussagen-Kalkuh der “Principia Mathematica,” Mathematische Zeitschrift, vol. 25 (1926), pp. 305320

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Erratum