{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T02:48:37Z","timestamp":1719888517546},"reference-count":28,"publisher":"Duke University Press","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2021,11,1]]},"DOI":"10.1215\/00294527-2021-0032","type":"journal-article","created":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T16:38:39Z","timestamp":1639413519000},"source":"Crossref","is-referenced-by-count":2,"title":["Cut Elimination for Systems of Transparent Truth with Restricted Initial Sequents"],"prefix":"10.1215","volume":"62","author":[{"given":"Carlo","family":"Nicolai","sequence":"first","affiliation":[{"name":"Department of Philosophy, King\u2019s College, London, United Kingdom http:\/\/carlonicolai.github.io\/"}]}],"member":"73","reference":[{"key":"2","doi-asserted-by":"publisher","unstructured":"Burgess, J. P., \u201cThe truth is never simple,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 51 (1986), pp. 663\u201381.","DOI":"10.2307\/2274021"},{"key":"3","doi-asserted-by":"publisher","unstructured":"Cantini, A., \u201cA theory of formal truth arithmetically equivalent to <math xmlns=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" overflow=\"scroll\" alttext=\"${\\mathsf{ID}_{1}}$\"><msub><mrow><mi mathvariant=\"sans-serif\">ID<\/mi><\/mrow><mrow><mn>1<\/mn><\/mrow><\/msub><\/math>,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 55 (1990), pp. 244\u201359.","DOI":"10.2307\/2274965"},{"key":"4","doi-asserted-by":"publisher","unstructured":"Cantini, A., \u201cThe undecidability of Gri\u0161in\u2019s set theory,\u201d <i>Studia Logica<\/i>, vol. 74 (2003), pp. 345\u201368.","DOI":"10.1023\/A:1025159016268"},{"key":"8","unstructured":"Fischer, M., \u201cModal predicates and their interaction,\u201d Habilitationsschrift, Ludwig Maximilian University of Munich, Munich, 2018."},{"key":"9","doi-asserted-by":"publisher","unstructured":"Fischer, M., and N. Gratzl, \u201cTruth, partial logic and infinitary proof systems,\u201d <i>Studia Logica<\/i>, vol. 106 (2018), pp. 515\u201340.","DOI":"10.1007\/s11225-017-9751-y"},{"key":"11","doi-asserted-by":"crossref","unstructured":"Gri\u0161in, V., \u201cPredicate and set-theoretic calculi based on logic without the contraction rules,\u201d <i>Izvestiya Mathematics<\/i>, vol. 18 (1982), pp. 41\u201359.","DOI":"10.1070\/IM1982v018n01ABEH001382"},{"key":"12","doi-asserted-by":"publisher","unstructured":"Halbach, V., \u201cConservative theories of classical truth,\u201d <i>Studia Logica<\/i>, vol. 62 (1999), pp. 353\u201370.","DOI":"10.1023\/A:1005148426909"},{"key":"13","doi-asserted-by":"publisher","unstructured":"Halbach, V., and L. Horsten, \u201cAxiomatizing Kripke\u2019s theory of truth,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 71 (2006), pp. 677\u2013712.","DOI":"10.2178\/jsl\/1146620166"},{"key":"14","doi-asserted-by":"publisher","unstructured":"Kotlarski, H., S. Krajewski, and A. H. Lachlan, \u201cConstruction of satisfaction classes for nonstandard models,\u201d <i>Canadian Mathematical Bulletin<\/i>, vol. 24 (1981), pp. 283\u201393.","DOI":"10.4153\/CMB-1981-045-3"},{"key":"15","doi-asserted-by":"publisher","unstructured":"Kremer, M., \u201cKripke and the logic of truth,\u201d <i>Journal of Philosophical Logic<\/i>, vol. 17 (1988), pp. 225\u201378.","DOI":"10.1007\/BF00247954"},{"key":"17","doi-asserted-by":"publisher","unstructured":"Leigh, G. E., \u201cConservativity for theories of compositional truth via cut elimination,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 80 (2015), pp. 845\u201365.","DOI":"10.1017\/jsl.2015.27"},{"key":"19","doi-asserted-by":"publisher","unstructured":"Negri, S., and J. von Plato, <i>Proof Analysis: A Contribution to Hilbert\u2019s Last Problem<\/i>, Cambridge University Press, Cambridge, 2011.","DOI":"10.1017\/CBO9781139003513"},{"key":"21","unstructured":"Nicolai, C., and L. Rossi, \u201cA compositional theory of self-applicable consequence,\u201d in preparation."},{"key":"22","unstructured":"Pohlers, W., <i>Proof Theory: A First Step into Impredicativity<\/i>, Universitext, Springer, Berlin, 2009."},{"key":"23","doi-asserted-by":"crossref","unstructured":"Priest, G., <i>Doubt Truth to Be a Liar<\/i>, Oxford University Press, Oxford, 2005.","DOI":"10.1093\/0199263280.001.0001"},{"key":"25","doi-asserted-by":"publisher","unstructured":"Schr\u00f6der-Heister, P., \u201cRestricting initial sequents: The trade-offs between identity, contraction, cut,\u201d pp. 339-51 in <i>Advances in Proof Theory<\/i>, edited by R. Kahle, T. Strahm, and T. Studer, vol. 28 of <i>Progress in Computer Science and Applied Logic<\/i>, Birkh\u00e4user\/Springer, Cham, 2016.","DOI":"10.1007\/978-3-319-29198-7_10"},{"key":"26","doi-asserted-by":"crossref","unstructured":"Schwichtenberg, H., \u201cProof theory: Some applications of cut-elimination,\u201d pp. 867\u201395 in <i>Handbook of Mathematical Logic<\/i>, edited by J. Barwise, vol. 90 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland, Amsterdam, 1977.","DOI":"10.1016\/S0049-237X(08)71124-8"},{"key":"27","unstructured":"Troelstra, A. S., and H. Schwichtenberg, <i>Basic Proof Theory<\/i>, vol. 43 of <i>Cambridge Tracts in Theoretical Computer Science<\/i>, Cambridge University Press, Cambridge, 1996."},{"key":"18","doi-asserted-by":"publisher","unstructured":"Leitgeb, H., \u201cWhat truth depends on,\u201d <i>Journal of Philosophical Logic<\/i>, vol. 34 (2005), pp. 155\u201392.","DOI":"10.1007\/s10992-004-3758-3"},{"key":"7","doi-asserted-by":"publisher","unstructured":"Field, H., <i>Saving Truth from Paradox<\/i>, Oxford University Press, Oxford, 2008.","DOI":"10.1093\/acprof:oso\/9780199230747.001.0001"},{"key":"6","doi-asserted-by":"publisher","unstructured":"Da R\u00e9, B., and L. Rosenblatt, \u201cContraction, infinitary quantifiers, and omega paradoxes,\u201d <i>Journal of Philosophical Logic<\/i>, vol. 47 (2018), pp. 611\u201329.","DOI":"10.1007\/s10992-017-9441-2"},{"key":"28","doi-asserted-by":"publisher","unstructured":"Zardini, E., \u201cTruth without contra(di)ction,\u201d <i>Review of Symbolic Logic<\/i>, vol. 4 (2011), pp. 498\u2013535.","DOI":"10.1017\/S1755020311000177"},{"key":"1","doi-asserted-by":"crossref","unstructured":"Beall, J. C., <i>Spandrels of Truth<\/i>, Oxford University Press, Oxford, 2009.","DOI":"10.1093\/acprof:oso\/9780199268733.001.0001"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Cobreros, P., P. Egr\u00e9, D. Ripley, and R. van Rooij, \u201cTolerant, classical, strict,\u201d <i>Journal of Philosophical Logic<\/i>, vol. 41 (2012), pp. 347\u201385.","DOI":"10.1007\/s10992-010-9165-z"},{"key":"10","doi-asserted-by":"publisher","unstructured":"Fjellstad, A., \u201cA note on the cut-elimination proof in \u2018Truth without contra(di)ction\u2019,\u201d <i>Review of Symbolic Logic<\/i>, vol. 13 (2020), pp. 882\u201386.","DOI":"10.1017\/s1755020319000571"},{"key":"16","doi-asserted-by":"publisher","unstructured":"Kripke, S., \u201cOutline of a theory of truth,\u201d <i>Journal of Philosophy<\/i>, vol. 72 (1975), pp. 690\u2013716.","DOI":"10.1007\/BF00247954"},{"key":"20","doi-asserted-by":"publisher","unstructured":"Nicolai, C., and L. Rossi, \u201cPrinciples for object-linguistic consequence: From logical to irreflexive,\u201d <i>Journal of Philosophical Logic<\/i>, vol. 47 (2018), pp. 549\u201377.","DOI":"10.1007\/s10992-017-9438-x"},{"key":"24","doi-asserted-by":"publisher","unstructured":"Ripley, D., \u201cConservatively extending classical logic with transparent truth,\u201d <i>Review of Symbolic Logic<\/i>, vol. 5 (2012), pp. 354\u201378.","DOI":"10.1017\/S1755020312000056"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2021-0032","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:00:35Z","timestamp":1706648435000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-62\/issue-4\/Cut-Elimination-for-Systems-of-Transparent-Truth-with-Restricted-Initial\/10.1215\/00294527-2021-0032.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,1]]},"references-count":28,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2021,11,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2021-0032","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2021,11,1]]}}}