Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,394,724 papers from all fields of science
Search
Sign In
Create Free Account
History of type theory
Known as:
Simple theory of types
The type theory was initially created to avoid paradoxes in a variety of formal logics and rewrite systems. Later, type theory referred to a class of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Automath
Axiom of reducibility
Calculus of constructions
Curry–Howard correspondence
Expand
Broader (1)
Type theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Carnap, Logicism, and Ontological Commitment
O. Bueno
2016
Corpus ID: 2625403
Throughout most of his career, Rudolf Carnap attempted to articulate an empiricist view. Central to this project is the…
Expand
2005
2005
Fraenkel‐Carnap properties
G. Weaver
,
B. R. George
Mathematical Logic Quarterly
2005
Corpus ID: 32210198
In the 1920's Fraenkel and Carnap raised the question of whether or not every finitely axiomatizable semantically complete theory…
Expand
2002
2002
Knowledge Representation, Computation, and Learning in Higher-order Logic
J. Lloyd
2002
Corpus ID: 123364010
This paper contains a systematic study of the foundations of knowledge representation, computation, and learning in higher-order…
Expand
2001
2001
RUSSELL ’ S OTHER CONTRADICTION : THE PARADOX OF PROPOSITIONS
André Fuhrmann
2001
Corpus ID: 15706166
Appendix B of The Principles of Mathematics (1903) contains Russell’s first statement of his theory of logical types. This simple…
Expand
1995
1995
{78 () the Vlisp Veriied Scheme System *
Joshua Guttman
1995
Corpus ID: 14928366
The vlisp project has produced a rigorously veriied compiler from Scheme to byte codes, and a veriied interpreter for the…
Expand
Highly Cited
1990
Highly Cited
1990
A Semi-Functional Implementation of a Higher-Order Logic Programming Language
Conal Elliott
,
F. Pfenning
1990
Corpus ID: 54154214
In this chapter we develop an interpreter of a higher-order constraint logic programming language in Standard ML (SML). The logic…
Expand
1981
1981
Inequivalence of the fragments of new foundations
Ú. Oswald
Archive for Mathematical Logic
1981
Corpus ID: 719803
Grigin [2, 3] defined and investigated fragments of New Foundations (NF). Quine's [5] set theory N F is a first order theory in…
Expand
1973
1973
SEMANTIC ANTINOMIES AND DEEP STRUCTURE ANALYSIS
R. Zuber
1973
Corpus ID: 57797864
To the ancient thinkers of Megara is attributed, among others, the paradox represented by the following question: 'Have you lost…
Expand
1948
1948
A problem concerning the notion of definability
A. Tarski
Journal of Symbolic Logic (JSL)
1948
Corpus ID: 40354166
We are inclined to believe that, by means of an argument entirely analogous to that which leads to the Richard antinomy, the…
Expand
Review
1940
Review
1940
Review: Alonzo Church, A Formulation of the Simple Theory of Types
W. Quine
Journal of Symbolic Logic (JSL)
1940
Corpus ID: 117961453
But these difficulties disappear if we conceive [_ as being, not a specific relationship, but a generic term for any negative…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required