{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T15:24:35Z","timestamp":1764084275985},"reference-count":15,"publisher":"Duke University Press","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2020,9,1]]},"DOI":"10.1215\/00294527-2020-0015","type":"journal-article","created":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T08:06:50Z","timestamp":1601280410000},"source":"Crossref","is-referenced-by-count":1,"title":["Connexive Restricted Quantification"],"prefix":"10.1215","volume":"61","author":[{"given":"Nissim","family":"Francez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"73","reference":[{"key":"14","unstructured":"[14] Wansing, H., \u201cConnexive logic,\u201d in <i>Stanford Encyclopedia of Philosophy<\/i>, edited by E. N. Zalta, Fall 2014 edition, <a href=\"http:\/\/plato.stanford.edu\/archives\/fall2014\/entries\/logic-connexive\/\">http:\/\/plato.stanford.edu\/archives\/fall2014\/entries\/logic-connexive\/<\/a>."},{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Beall, J., \u201cThere is no logical negation: True, false, both and neither,\u201d <i>Australasian Journal of Logic<\/i>, vol. 14 (2017), pp. 1\u201329.","DOI":"10.26686\/ajl.v14i1.4025"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Beall, J., R. T. Brady, A. P. Hazen, G. Priest, and G. Restall, \u201cRelevant restricted quantification,\u201d <i>Journal of Philosophical Logic<\/i>, vol. 35 (2006), pp. 587\u201398.","DOI":"10.1007\/s10992-005-9008-5"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] Beall, J., and G. Restall, <i>Logical Pluralism<\/i>, Oxford University Press, Oxford, 2006.","DOI":"10.1093\/acprof:oso\/9780199288403.001.0001"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Ben-Yami, H., \u201cA critique of Frege on common nouns,\u201d <i>Ratio<\/i>, vol. 19 (2006), pp. 148\u201355.","DOI":"10.1111\/j.1467-9329.2006.00316.x"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] Ferguson, T. M., \u201cLogics of nonsense and Parry systems,\u201d <i>Journal of Philosophical Logic<\/i>, vol. 44 (2015), pp. 65\u201380.","DOI":"10.1007\/s10992-014-9321-y"},{"key":"6","unstructured":"[6] Ferguson, T. M., \u201cOn arithmetic formulated connexively,\u201d <i>IfCoLog Journal of Logics and Their Applications<\/i>, vol. 3 (2016), 357\u201376."},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Francez, N., \u201cA logic inspired by natural language: Quantifiers as subnectors,\u201d <i>Journal of Philosophical Logic<\/i>, vol. 43 (2014), pp. 1153\u201372.","DOI":"10.1007\/s10992-014-9312-z"},{"key":"8","unstructured":"[8] Kneale, W., and M. Kneale, <i>The Development of Logic<\/i>, Oxford University Press, Oxford, 1962."},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] McCall, S., \u201cConnexive class logic,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 32 (1967), pp. 83\u201390.","DOI":"10.2307\/2271246"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] McCall, S., \u201cA history of connexivity,\u201d pp. 415\u201349 in <i>Logic: A History of Its Central Concepts<\/i>, edited by D. M. Gabbay, F. J. Pelletier, and J. Woods, vol. 11 of <i>Handbook of the History of Logic<\/i>, North-Holland, Amsterdam, 2012.","DOI":"10.1016\/B978-0-444-52937-4.50008-3"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Nelson, D., \u201cConstructible falsity,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 14 (1949), pp. 16\u201326.","DOI":"10.2307\/2268973"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Priest, G., \u201cNegation as cancellation, and connexive logic,\u201d <i>Topoi<\/i>, vol. 18 (1999), pp. 141\u201348.","DOI":"10.1023\/A:1006294205280"},{"key":"13","unstructured":"[13] Wansing, H., \u201cConnexive modal logic,\u201d pp. 367\u201383 in <i>Advances in Modal Logic, Vol. 5<\/i>, edited by R. Schmidt, I. Pratt-Hartmann, M. Reynolds, and H. Wansing, King\u2019s College Publications, London, 2005."},{"key":"15","unstructured":"[15] Wansing, H., \u201cNatural deduction for bi-connexive logic and a two-sorted typed $\\lambda$-calculus,\u201d <i>IFCoLog Journal of Logics and Their Applications<\/i>, vol. 3 (2016), pp. 413\u2013439."}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2020-0015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:00:18Z","timestamp":1706648418000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-61\/issue-3\/Connexive-Restricted-Quantification\/10.1215\/00294527-2020-0015.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,1]]},"references-count":15,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2020,9,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2020-0015","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2020,9,1]]}}}