Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations

Broader (1)

Computability theory
Finite model propertyKleene's T predicateRecursively enumerable setWell-formed formula

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The Gotsman-Linial Conjecture is False
In 1991, Craig Gotsman and Nathan Linial conjectured that for all n and d, the average sensitivity of a degree-d polynomial… 
2018
2018
On the Rectifiability of Arithmetic Circuits using Craig Interpolants in Finite Fields
When formal verification of arithmetic circuits identifies the presence of a bug in the design, the task of rectification needs… 
2015
2015
How to deal with unbelievable assertions
We tackle the problem that arises when an agent receives unbelievable information. Information is unbelievable if it conflicts… 
Review
2013
Review
2013
Adapting Credit Scores to Evolving Consumer Behavior and Data
Credit scores have become an integral component of the credit landscape. As that landscape shifts, credit-score algorithms should… 
2003
2003
On Craig Theorem and Herbrand Theoremfor 3 Valued Logics
Author show the Craig theorem and Herbrand theorem for The 3 valued logics MP,MP*,MF,MF*,ME and ME*. 
2002
2002
Context and Institutional Structure in Attorney Regulation: Constructing an Enforcement Regime for International Arbitration
The question that looms large over the future of international arbitration is: How much should states yield to the international… 
Review
2002
Review
2002
Vasarely Design and Other Non-Cubical Designs
I exhibited 3-dimensional designs made from Rubik's cubes at the Bridges Conference two years ago. I left the conference with new… 
1989
1989
Interpolation theorem in Many-valued logics with designated values
Many-valued logics can be divided into two categories according as the designated values are specified or not. In our research on… 
1985
1985
A new proof for Craig's theorem
Craig's theorem is a result about the cardinality of a proper basis for the theory of combinators. Its proof given in [3] was… 
1972
1972
Craig's theorem, Ramsey-sentences, and scientific instrumentalism
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)