{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:10:01Z","timestamp":1706649001840},"reference-count":7,"publisher":"Duke University Press","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2001,4,1]]},"DOI":"10.1305\/ndjfl\/1054837938","type":"journal-article","created":{"date-parts":[[2003,6,12]],"date-time":"2003-06-12T16:56:13Z","timestamp":1055436973000},"source":"Crossref","is-referenced-by-count":3,"title":["Forcing Complexity: Minimum Sizes of Forcing Conditions"],"prefix":"10.1215","volume":"42","author":[{"given":"Toshio","family":"Suzuki","sequence":"first","affiliation":[]}],"member":"73","reference":[{"key":"2","doi-asserted-by":"publisher","unstructured":"Dowd, M., \"Generic oracles, uniform machines, and codes\", <i>Information and Computation<\/i>, vol. 96 (1992), pp. 65\u201376.","DOI":"10.1016\/0890-5401(92)90055-K"},{"key":"4","unstructured":"Suzuki, T., \"Recognizing tautology by a deterministic algorithm whose while-loop's execution time is bounded by forcing\", <i>Kobe Journal of Mathematics<\/i>, vol. 15 (1998), pp. 91\u2013102."},{"key":"3","doi-asserted-by":"publisher","unstructured":"Poizat, B., \u201c$\\mathcal{Q}=\\mathcal{NQ}$?\u201d <i>The Journal of Symbolic Logic<\/i>, vol. 51 (1986), pp. 22\u201332.","DOI":"10.2307\/2273938"},{"key":"5","unstructured":"Suzuki, T., <i>Computational C<\/i>omplexity of Boolean Formulas with Query Symbols, Ph.D. thesis, University of Tsukuba, Tsukuba-City, 1999."},{"key":"6","doi-asserted-by":"publisher","unstructured":"Suzuki, T., \"Complexity of the $r$\"-query tautologies in the presence of a generic oracle, <i>Notre Dame Journal of Formal Logic<\/i>, vol. 41 (2000), pp. 142\u2013151.","DOI":"10.1305\/ndjfl\/1038234608"},{"key":"7","doi-asserted-by":"publisher","unstructured":"Suzuki, T., \"Degrees of D\"owd-type generic oracles, <i>Information and Computation<\/i>, vol. 176 (2002), pp. 66\u201387.","DOI":"10.1006\/inco.2002.3149"},{"key":"1","doi-asserted-by":"publisher","unstructured":"Bennett, C. H., and J. Gill, \"Relative to a random oracle $A$\", ${\\bf P}\\sp{A}\\not={\\bf NP}\\sp{A}\\not={\\rm co}-{\\bf NP}\\sp{A}$ with probability $1$, <i>SIAM Journal on Computing<\/i>, vol. 10 (1981), pp. 96\u2013113.","DOI":"10.1137\/0210008"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1305\/ndjfl\/1054837938","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:55:48Z","timestamp":1706648148000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-42\/issue-2\/Forcing-Complexity-Minimum-Sizes-of-Forcing-Conditions\/10.1305\/ndjfl\/1054837938.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4,1]]},"references-count":7,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2001,4,1]]}},"URL":"https:\/\/doi.org\/10.1305\/ndjfl\/1054837938","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4,1]]}}}