{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T08:25:23Z","timestamp":1649147123770},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Stud Logica"],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/bf01058393","type":"journal-article","created":{"date-parts":[[2005,1,28]],"date-time":"2005-01-28T08:45:09Z","timestamp":1106901909000},"page":"291-308","source":"Crossref","is-referenced-by-count":0,"title":["Identity in modal logic theorem proving"],"prefix":"10.1007","volume":"52","author":[{"given":"Francis J.","family":"Pelletier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"B. Chellas,Modal Logic, Cambridge University Press, 1980.","DOI":"10.1017\/CBO9780511621192"},{"key":"CR2","unstructured":"P. Jackson endH. Reichgelt,A general proof method for first order modal logic,IJCAI-10, 1987, pp. 942 ? 944."},{"key":"CR3","volume-title":"Logic","author":"D. Kalish","year":"1964","unstructured":"D. Kalish andR. Montague,Logic Hartcourt, Brace, Janovich, 1964."},{"key":"CR4","volume-title":"Logic","author":"D. Kalish","year":"1980","unstructured":"D. Kalish, R. Montague andG. Mar,Logic, Hartcourt, Brace, Janovich, 1980."},{"key":"CR5","unstructured":"S. Kripke,Identity and necessity, in M. Munitz, ed.,Identity and Individuation, New York University Press, 1971, pp. 135 ? 164."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/978-94-010-2557-7_9","volume-title":"Semantics of Natural Language","author":"S. Kripke","year":"1972","unstructured":"S. Kripke,Naming and necessity, in D. Davidson and G. Harman, eds,Semantics of Natural Language, D. Reidel Publ. Co., Dordrecht 1972, pp. 253?355 and 763 ? 769."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"M. McRobbie, R. Meyer andP. Thistlewaite,Towards efficient ?knowledge-based? automated theorem proving for non-standard logics,CADE-9, Springer-Verlag 1988, pp. 197 ? 217.","DOI":"10.1007\/BFb0012833"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"C. Morgan,Methods for automated theorem proving in non-classical logics,IEEE Trans. on Computers, 1976, pp. 852 ? 862.","DOI":"10.1109\/TC.1976.1674704"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"C. Morgan,Autologic,Logique et Analyse, 1985, pp. 257 ? 282.","DOI":"10.1016\/B978-0-08-028680-8.50016-3"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"H. Ohlbach,A resolution calculus for modal logics,CADE-9, Springer-Verlag 1988, pp. 500 ? 516.","DOI":"10.1007\/BFb0012852"},{"key":"CR11","series-title":"Tech. Report","volume-title":"Completely Non-Causal, Completely Heuristic-Driven, Automatic theorem Proving","author":"F. J. Pelletier","year":"1982","unstructured":"F. J. Pelletier,Completely Non-Causal, Completely Heuristic-Driven, Automatic theorem Proving Tech. Report TR82-7, Dept. Computing Science, Univ. Alberta, 1982."},{"key":"CR12","series-title":"Tech. Report","volume-title":"Further Developments in THINKER, an Automated Theorem Prover","author":"F. J. Pelletier","year":"1987","unstructured":"F. J. Pelletier,Further Developments in THINKER, an Automated Theorem Prover Tech. Report TR-ARP-16\/87 Automated Reasoning Project, Australia National University, 1987."},{"key":"CR13","unstructured":"F. J. Pelletier,The philosophy of automated theorem proving,Proceedings of IJCAI-91, 1991."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"R. Smullyan,First Order Logic, Springer-Verlag 1968.","DOI":"10.1007\/978-3-642-86718-7"},{"key":"CR15","unstructured":"P. Thistlewaite, M. McRobbie andR. Meyer,Automated Theorem Proving in Non-Classical Logics, Pitman, 1987."},{"key":"CR16","unstructured":"P. Thistlewaite, R. Meyer andM. McRobbie,Advanced theorem proving techniques for relevant logics,Logique et Analyse, 1985, pp. 233 ? 258."},{"key":"CR17","unstructured":"A. Whitehead andB. Russell,Principia Mathematica, Cambridge University Press 1910."},{"key":"CR18","unstructured":"G. Wrightson,Non-classical logic theorem proving,Journal of Automated Reasoning, 1985, pp. 35 ? 37."}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/BF01058393.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/BF01058393\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/BF01058393","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T13:09:09Z","timestamp":1586092149000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/BF01058393"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993]]}},"alternative-id":["BF01058393"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/bf01058393","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"value":"0039-3215","type":"print"},{"value":"1572-8730","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}