Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
The Complexity of Satisfaction Problems in Reverse Mathematics
verfasst von : Ludovic Patey
Erschienen in: Language, Life, Limits
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Satisfiability problems play a central role in computer science and engineering as a general framework for studying the complexity of various problems. Schaefer proved in 1978 that truth satisfaction of propositional formulas given a language of relations is either NP-complete or tractable. We classify the corresponding satisfying assignment construction problems in the framework of Reverse Mathematics and show that the principles are either provable over
RCA
0
or equivalent to
WKL
0
. We formulate also a Ramseyan version of the problems and state a different dichotomy theorem. However, the different classes arising from this classification are not known to be distinct.