{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T07:36:23Z","timestamp":1700811383991},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":23568,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1949,9]]},"abstract":"<jats:p>We make certain notational conventions. These are referred to as CL (Computational Logic). The relation of <jats:italic>interchangeability<\/jats:italic> is introduced as the basic connection between logical formulas. This approach lends perspicuity to the results of sentential calculus. With its technical devices CL is able to rephrase logical theorems in rather succinct manner. Our exposition tries to steer a middle course between informality and strict rigor.<\/jats:p><jats:p>It is felt that the method of CL offers advantages for the teaching of logic. Proofs are algorithmic and resemble those of elementary algebra. All inferences are reversible and practically non-tentative.<\/jats:p><jats:p><jats:italic>Sign<\/jats:italic> is a primitive term of CL. Its denning property is a capacity for entering into binary combination with other signs, or with itself, according to this convention:<\/jats:p><jats:p><jats:italic>x<\/jats:italic> and <jats:italic>y<\/jats:italic> are signs if, and only if, (<jats:italic>x y<\/jats:italic>) is a sign. Bracketing is looked upon as an operation on signs in terms of which other operations are definable. The practice of some authors in classifying brackets under the heading of symbols, seems to us questionable; for unlike symbols or signs brackets are never used to denote anything. Brackets enter into the composition of signs, not to denote a grouping, but rather to <jats:italic>exhibit<\/jats:italic> it, in the manner of a diagram.<\/jats:p><jats:p>An unending list of letters, with or without subscripts,<\/jats:p><jats:p><jats:disp-formula><jats:graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" orientation=\"portrait\" mime-subtype=\"gif\" mimetype=\"image\" position=\"float\" xlink:type=\"simple\" xlink:href=\"S0022481200105687_eqnU1\" \/><\/jats:disp-formula><\/jats:p><jats:p>serve to denote arbitrary signs. An arbitrary sign may or may not have other signs as parts. The numeral \u201c2\u201d is used as a constant. Bracketing abbreviation is as follows:<\/jats:p><jats:p><jats:disp-formula><jats:graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" orientation=\"portrait\" mime-subtype=\"gif\" mimetype=\"image\" position=\"float\" xlink:type=\"simple\" xlink:href=\"S0022481200105687_eqnU2\" \/><\/jats:disp-formula><\/jats:p><jats:p>and so on. Outermost brackets will ordinarily be omitted. This kind of bracketing may be termed <jats:italic>left-associative<\/jats:italic>. For convenience, these bracketing conventions are crystallized into a rule.<\/jats:p>","DOI":"10.2307\/2267045","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T19:06:41Z","timestamp":1146942401000},"page":"167-172","source":"Crossref","is-referenced-by-count":1,"title":["Computational logic"],"prefix":"10.1017","volume":"14","author":[{"given":"Nathan P.","family":"Levin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200105687","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T10:29:25Z","timestamp":1559989765000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200105687\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1949,9]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1949,9]]}},"alternative-id":["S0022481200105687"],"URL":"https:\/\/doi.org\/10.2307\/2267045","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1949,9]]}}}