{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T06:57:55Z","timestamp":1776754675809,"version":"3.51.2"},"reference-count":5,"publisher":"Duke University Press","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2007,10,1]]},"DOI":"10.1305\/ndjfl\/1193667709","type":"journal-article","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T01:52:55Z","timestamp":1195177975000},"source":"Crossref","is-referenced-by-count":9,"title":["A Sound and Complete Proof Theory for Propositional Logical Contingencies"],"prefix":"10.1215","volume":"48","author":[{"given":"Alexander","family":"Hertel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Hertel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Morgan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"73","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Gindikin, S. G., <i>Algebraic Logic<\/i>, Problem Books in Mathematics. Springer-Verlag, New York, 1985. Translated from the Russian by R. H. Silverman.","DOI":"10.1007\/978-1-4757-1877-5"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Morgan, C. G., \"Hypothesis generation by machine\", <i>Artificial Intelligence<\/i>, vol. 2 (1971), pp. 179--87.","DOI":"10.1016\/0004-3702(71)90009-9"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Morgan, C. G., \"Sentential calculus for logical falsehoods\", <i>Notre Dame Journal of Formal Logic<\/i>, vol. 14 (1973), pp. 347--53.","DOI":"10.1305\/ndjfl\/1093890998"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Morgan, C. G., \"Truth, falsehood, and contingency in first-order predicate calculus\", <i>Notre Dame Journal of Formal Logic<\/i>, vol. 14 (1973), pp. 536--42.","DOI":"10.1305\/ndjfl\/1093891106"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Turing, A. M., \"On computable numbers, with an application to the Entscheidungsproblem\", <i>Proceedings of the London Mathematical Society, Second Series<\/i>, vol. 42 (1936), pp. 230--65. Correction in vol. 43 (1937), pp. 544--46.","DOI":"10.1112\/plms\/s2-42.1.230"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1305\/ndjfl\/1193667709","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:57:01Z","timestamp":1706648221000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-48\/issue-4\/A-Sound-and-Complete-Proof-Theory-for-Propositional-Logical-Contingencies\/10.1305\/ndjfl\/1193667709.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,1]]},"references-count":5,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2007,10,1]]}},"URL":"https:\/\/doi.org\/10.1305\/ndjfl\/1193667709","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2007,10,1]]}}}