{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T03:53:38Z","timestamp":1786074818922,"version":"3.56.0"},"reference-count":7,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":2293,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2007,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we present two calculi for intuitionistic logic. The first one. IG, is characterized by the fact that every proof-search terminates and termination is reached without jeopardizing the subformula property. As to the second one, SIC, proof-search terminates, the subformula property is preserved and moreover proof-search is performed without any recourse to metarules, in particular there is no need to back-track. As a consequence, proof-search in the calculus SIC is accomplished by a <jats:italic>single<\/jats:italic> tree as in classical logic.<\/jats:p>","DOI":"10.2178\/jsl\/1203350782","type":"journal-article","created":{"date-parts":[[2008,3,25]],"date-time":"2008-03-25T18:42:11Z","timestamp":1206470531000},"page":"1204-1218","source":"Crossref","is-referenced-by-count":7,"title":["Intuitionistic logic freed of all metarules"],"prefix":"10.1017","volume":"72","author":[{"given":"Giovanna","family":"Corsi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gabriele","family":"Tassi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200004874_ref005","volume-title":"Proceedings of TABLEAUX'96","volume":"1071","author":"Heuerding","year":"1996"},{"key":"S0022481200004874_ref004","first-page":"795","volume":"57","author":"Dyckhoff","year":"1992","journal-title":"Contraction-free sequent calculi for intuitionistic logic"},{"key":"S0022481200004874_ref001","first-page":"939","volume":"52","author":"Avron","year":"1987","journal-title":"A constructive analysis of RM"},{"key":"S0022481200004874_ref003","first-page":"26","volume-title":"Logic and Philosophy in Italy, Some trends and perspectives","author":"Corsi","year":"2006"},{"key":"S0022481200004874_ref006","first-page":"900","volume":"48","author":"Pottinger","year":"1992","journal-title":"Uniform cut-free formulations of T, S4 and S5"},{"key":"S0022481200004874_ref007","volume-title":"Basic Proof Theory","author":"Troelstra","year":"1996"},{"key":"S0022481200004874_ref002","doi-asserted-by":"publisher","DOI":"10.1007\/BF00373275"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200004874","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:42:40Z","timestamp":1556739760000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200004874\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["S0022481200004874"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1203350782","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}