{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T09:33:08Z","timestamp":1674552788294},"reference-count":15,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":5032,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2000,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We describe a method for obtaining classical logic from intuitionistic logic which does not depend on any proof system, and show that by applying it to the most important implicational relevance logics we get relevance logics with nice semantical and proof-theoretical properties. Semantically all these logics are sound and strongly complete relative to classes of structures in which all elements except one are designated. Proof-theoretically they correspond to cut-free hypersequential Gentzen-type calculi. Another major property of all these logics is that the classical implication can faithfully be translated into them.<\/jats:p>","DOI":"10.2307\/2586570","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T14:04:37Z","timestamp":1146924277000},"page":"788-802","source":"Crossref","is-referenced-by-count":5,"title":["Implicational <i>F<\/i>-structures and implicational relevance logics"],"prefix":"10.1017","volume":"65","author":[{"given":"A.","family":"Avron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200012202_ref006","first-page":"1","volume-title":"Logic: Foundations to applications","author":"Avron","year":"1996"},{"key":"S0022481200012202_ref013","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19720181903"},{"key":"S0022481200012202_ref011","first-page":"1","volume":"35","author":"Dunn","year":"1970","journal-title":"Algebraic completeness results for R-mingle and its extensions"},{"key":"S0022481200012202_ref002","volume-title":"Entailment","volume":"2","author":"Anderson","year":"1992"},{"key":"S0022481200012202_ref007","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/5.2.181"},{"key":"S0022481200012202_ref008","first-page":"831","volume":"63","author":"Avron","year":"1998","journal-title":"Multiplicative conjunction and the algebraic meaning of contraction and weakening"},{"key":"S0022481200012202_ref001","volume-title":"Entailment","volume":"1","author":"Anderson","year":"1975"},{"key":"S0022481200012202_ref003","first-page":"334","volume":"49","author":"Avron","year":"1984","journal-title":"Relevant entailment\u2014Semantics and formal systems"},{"key":"S0022481200012202_ref005","first-page":"707","volume":"55","author":"Avron","year":"1990","journal-title":"Relevance and paraconsistency \u2014 A new approach"},{"key":"S0022481200012202_ref009","volume-title":"The weak theory of implication","author":"Church","year":"1951"},{"key":"S0022481200012202_ref010","first-page":"1","volume-title":"Substructural logics","author":"Do\u0161en","year":"1993"},{"key":"S0022481200012202_ref012","volume-title":"Handbook of philosophical logic","volume":"III","author":"Dunn","year":"1986"},{"key":"S0022481200012202_ref004","first-page":"939","volume":"52","author":"Avron","year":"1987","journal-title":"A constructive analysis of RM"},{"key":"S0022481200012202_ref014","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1305\/ndjfl\/1093634487","article-title":"A structurally complete fragment of relevant logic","volume":"33","author":"Meyer","year":"1992","journal-title":"Notre-Dame Journal of Formal Logic"},{"key":"S0022481200012202_ref015","first-page":"23","article-title":"Axiomatization of partial system of three-valued calculus of propositions","volume":"1","author":"Soboci\u0144ski","year":"1952","journal-title":"The Journal of Computing Systems"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200012202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T17:20:16Z","timestamp":1557336016000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200012202\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0022481200012202"],"URL":"https:\/\/doi.org\/10.2307\/2586570","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}