Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,547,892 papers from all fields of science
Search
Sign In
Create Free Account
Craig's theorem
Known as:
Craig theorem
In mathematical logic, Craig's theorem states that any recursively enumerable set of well-formed formulas of a first-order language is (primitively…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Broader (1)
Computability theory
Finite model property
Kleene's T predicate
Recursively enumerable set
Well-formed formula
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Review
2013
Adapting Credit Scores to Evolving Consumer Behavior and Data
Frédéric Huynh
2013
Corpus ID: 150060005
Credit scores have become an integral component of the credit landscape. As that landscape shifts, credit-score algorithms should…
Expand
2005
2005
Craig’s Theorem
J. Ketland
2005
Corpus ID: 262703156
Review
2002
Review
2002
Vasarely Design and Other Non-Cubical Designs
H. Bizek
2002
Corpus ID: 117419372
I exhibited 3-dimensional designs made from Rubik's cubes at the Bridges Conference two years ago. I left the conference with new…
Expand
1999
1999
Craig's Theorem and empirical undetermination Thesis Reassessed
C. List
1999
Corpus ID: 169928010
1989
1989
A Note on Vandermonde Matrices and Craig's Theorem
S. R. Searle
1989
Corpus ID: 125502063
1985
1985
A new proof for Craig's theorem
P. Bellot
Journal of Symbolic Logic (JSL)
1985
Corpus ID: 38657666
Craig's theorem is a result about the cardinality of a proper basis for the theory of combinators. Its proof given in [3] was…
Expand
1972
1972
Craig's theorem, Ramsey-sentences, and scientific instrumentalism
James W. Cornman
Synthese
1972
Corpus ID: 46964393