{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:36:55Z","timestamp":1753889815834,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2014,3,3]],"date-time":"2014-03-03T00:00:00Z","timestamp":1393804800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>In this work we continue the syntactic study of completeness that began with\nthe works of Immerman and Medina. In particular, we take a conjecture raised by\nMedina in his dissertation that says if a conjunction of a second-order and a\nfirst-order sentences defines an NP-complete problems via fops, then it must be\nthe case that the second-order conjoint alone also defines a NP-complete\nproblem. Although this claim looks very plausible and intuitive, currently we\ncannot provide a definite answer for it. However, we can solve in the\naffirmative a weaker claim that says that all ``consistent'' universal\nfirst-order sentences can be safely eliminated without the fear of losing\ncompleteness. Our methods are quite general and can be applied to complexity\nclasses other than NP (in this paper: to NLSPACE, PTIME, and coNP), provided\nthe class has a complete problem satisfying a certain combinatorial property.<\/jats:p>","DOI":"10.2168\/lmcs-10(1:15)2014","type":"journal-article","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T09:40:14Z","timestamp":1405417214000},"source":"Crossref","is-referenced-by-count":0,"title":["Universal First-Order Logic is Superfluous for NL, P, NP and coNP"],"prefix":"10.46298","volume":"Volume 10, Issue 1","author":[{"given":"Nerio","family":"Borges","sequence":"first","affiliation":[]},{"given":"Blai","family":"Bonet","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2014,3,3]]},"reference":[{"key":"764:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1011\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1011\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:01:14Z","timestamp":1681243274000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,3]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-10(1:15)2014","relation":{"is-same-as":[{"id-type":"arxiv","id":"1401.8046","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1401.8046","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2014,3,3]]},"article-number":"1011"}}