{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T02:54:07Z","timestamp":1777517647232,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2015,2,1]],"date-time":"2015-02-01T00:00:00Z","timestamp":1422748800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Computability"],"published-print":{"date-parts":[[2015,2]]},"abstract":"<jats:p>\n                    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\n                    <jats:sub>0<\/jats:sub>\n                    or equivalent to WKL\n                    <jats:sub>0<\/jats:sub>\n                    . 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.\n                  <\/jats:p>","DOI":"10.3233\/com-150034","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T15:00:35Z","timestamp":1575298835000},"page":"69-84","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["The complexity of satisfaction problems in reverse mathematics"],"prefix":"10.1177","volume":"4","author":[{"given":"Ludovic","family":"Patey","sequence":"first","affiliation":[{"name":"Laboratoire PPS, Universit\u00e9 Paris Diderot, Paris, France. E-mail: ludovic.patey@computability.fr; Url: http:\/\/ludovicpatey.com"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2015,2,1]]},"container-title":["Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/COM-150034","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/COM-150034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T16:03:12Z","timestamp":1777392192000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/COM-150034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["10.3233\/COM-150034"],"URL":"https:\/\/doi.org\/10.3233\/com-150034","relation":{},"ISSN":["2211-3568","2211-3576"],"issn-type":[{"value":"2211-3568","type":"print"},{"value":"2211-3576","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2]]}}}