{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T10:48:26Z","timestamp":1782730106580,"version":"3.54.5"},"reference-count":22,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2012,3,26]],"date-time":"2012-03-26T00:00:00Z","timestamp":1332720000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Review of Symbolic Logic"],"published-print":{"date-parts":[[2012,6]]},"abstract":"<jats:p>This paper shows how to conservatively extend a classical logic with a transparent truth predicate, in the face of the paradoxes that arise as a consequence. All classical inferences are preserved, and indeed extended to the full (truth-involving) vocabulary. However, not all classical metainferences are preserved; in particular, the resulting logical system is <jats:italic>nontransitive<\/jats:italic>. Some limits on this nontransitivity are adumbrated, and two proof systems are presented and shown to be sound and complete. (One proof system features admissible Cut, but the other does not.)<\/jats:p>","DOI":"10.1017\/s1755020312000056","type":"journal-article","created":{"date-parts":[[2012,3,26]],"date-time":"2012-03-26T13:06:16Z","timestamp":1332767176000},"page":"354-378","source":"Crossref","is-referenced-by-count":135,"title":["CONSERVATIVELY EXTENDING CLASSICAL LOGIC WITH TRANSPARENT TRUTH"],"prefix":"10.1017","volume":"5","author":[{"given":"DAVID","family":"RIPLEY","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2012,3,26]]},"reference":[{"key":"S1755020312000056_ref22","volume-title":"Proof Theory","author":"Takeuti","year":"1987"},{"key":"S1755020312000056_ref20","volume-title":"Paraconsistency: Logic and Applications","author":"Ripley","year":"2011"},{"key":"S1755020312000056_ref19","article-title":"Paradoxes and failures of cut","author":"Ripley","year":"2011","journal-title":"Australasian Journal of Philosophy"},{"key":"S1755020312000056_ref18","first-page":"189","volume-title":"Logic, Methodology, and Philosophy of Science: Proceedings of the Twelfth International Congress","author":"Restall","year":"2005"},{"key":"S1755020312000056_ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801174"},{"key":"S1755020312000056_ref15","doi-asserted-by":"publisher","DOI":"10.1093\/0199247293.001.0001"},{"key":"S1755020312000056_ref12","doi-asserted-by":"publisher","DOI":"10.2307\/2024634"},{"key":"S1755020312000056_ref10","doi-asserted-by":"publisher","DOI":"10.1093\/mind\/106.424.641"},{"key":"S1755020312000056_ref9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921049"},{"key":"S1755020312000056_ref8","first-page":"41","article-title":"Formalization of a plausible inference","volume":"33","author":"Frankowski","year":"2004","journal-title":"Bulletin of the Section of Logic"},{"key":"S1755020312000056_ref5","volume-title":"Possibilities and Paradox: An Introduction to Modal and Many-valued Logic","author":"Beall","year":"2003"},{"key":"S1755020312000056_ref4","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199268733.001.0001"},{"key":"S1755020312000056_ref1","unstructured":"Baaz M. , Ferm\u00fcller C. G. , & Zach R. (1992). Dual systems of sequents and tableaux for many-valued logics. Technical Report TUW-E185.2-BFZ.2\u201392."},{"key":"S1755020312000056_ref14","first-page":"49","article-title":"Q-consequence operation","volume":"24","author":"Malinowski","year":"1990","journal-title":"Reports on Mathematical Logic"},{"key":"S1755020312000056_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00247954"},{"key":"S1755020312000056_ref6","article-title":"Tolerant, classical, strict","author":"Cobreros","year":"2011","journal-title":"Journal of Philosophical Logic"},{"key":"S1755020312000056_ref13","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1305\/ndjfl\/1012429715","article-title":"Truth and the liar in De Morgan-valued models","volume":"40","author":"Leitgeb","year":"1999","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"S1755020312000056_ref2","unstructured":"Baaz M. , Ferm\u00fcller C. G. , & Zach R. (1993). Systematic construction of natural deduction systems for many-valued logics: Extended report. Technical Report TUW-E185.2-BFZ.1\u201393."},{"key":"S1755020312000056_ref16","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199263301.001.0001"},{"key":"S1755020312000056_ref7","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199230747.001.0001"},{"key":"S1755020312000056_ref21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511565687"},{"key":"S1755020312000056_ref3","volume-title":"The Liar: An Essay on Truth and Circularity","author":"Barwise","year":"1987"}],"container-title":["The Review of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1755020312000056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T21:13:17Z","timestamp":1556226797000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1755020312000056\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,26]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["S1755020312000056"],"URL":"https:\/\/doi.org\/10.1017\/s1755020312000056","relation":{},"ISSN":["1755-0203","1755-0211"],"issn-type":[{"value":"1755-0203","type":"print"},{"value":"1755-0211","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,26]]}}}