{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:22:54Z","timestamp":1755220974949,"version":"3.43.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Studia Logica"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1023\/a:1005087316935","type":"journal-article","created":{"date-parts":[[2002,12,21]],"date-time":"2002-12-21T15:31:12Z","timestamp":1040484672000},"page":"45-66","source":"Crossref","is-referenced-by-count":2,"title":["Strategic Construction of Fitch-style Proofs"],"prefix":"10.1007","volume":"60","author":[{"given":"Frederic D.","family":"Portoraro","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"155400_CR1","unstructured":"Fitch, F. B., Symbolic Logic: An Introduction, Ronald (1952)."},{"key":"155400_CR2","doi-asserted-by":"crossref","unstructured":"Fitting, M., First-Order Logic and Automated Theorem Proving, Springer-Verlag (1990).","DOI":"10.1007\/978-1-4684-0357-2"},{"key":"155400_CR3","unstructured":"Ja\u015akowski, S., 'On the rules of suppositions in formal logic', Studia Logica I (1934)."},{"key":"155400_CR4","unstructured":"Pelletier, F. J., Further developments in THINKER: An automated theorem prover, Technical Report TR-ARP-16\/87, Australian National University (1987)."},{"key":"155400_CR5","unstructured":"Portoraro, F. D., 'Designing and implementing finite structures in Symlog', Philosophy and the Computer, L. Burkholder editor, 229-234, Westview (1992)."},{"key":"155400_CR6","doi-asserted-by":"crossref","unstructured":"Portoraro, F. D., 'Symlog: Automated advice in Fitch-style proof construction', Automated Deduction-CADE 12, Lecture Notes in Artificial Intelligence, A. Bundy editor, vol. 814, 802-806, Springer-Verlag (1994).","DOI":"10.1007\/3-540-58156-1_64"},{"key":"155400_CR7","unstructured":"Portoraro, F. D., Natural Deduction in Peano Arithmetic (Addendum to Logic with Symlog: Learning Symbolic Logic by Computer), Prentice-Hall (1994)."},{"key":"155400_CR8","unstructured":"Portoraro, F. D., and R. E. Tully, Logic with Symlog: Learning Symbolic Logic by Computer, Prentice-Hall (1994). The software: Symlog ver. 2.0 (1992)."},{"key":"155400_CR9","volume-title":"Natural Deduction: A Proof Theoretical Study","author":"D. Prawitz","year":"1965","unstructured":"Prawitz, D., Natural Deduction: A Proof Theoretical Study, Almqvist & Wiksell, Stockholm (1965)."},{"key":"155400_CR10","unstructured":"Sieg, W., Intercalation Calculi for Classical Logic, Report CMU-PHIL 46, Department of Philosophy, Carnegie-Mellon University (1994)."},{"key":"155400_CR11","unstructured":"Sieg, W., and J. Byrnes, Normal Natural Deduction Proofs (in classical logic), Report CMU-PHIL 74, Department of Philosophy, Carnegie-Mellon University (1996)."},{"key":"155400_CR12","unstructured":"Sieg, W., and B. Kauffmann, Unification for Quantified Formulae, Report CMU-PHIL 44, Department of Philosophy, Carnegie-Mellon University (1993)."},{"key":"155400_CR13","unstructured":"Sieg, W., and R. Scheines, 'Searching for proofs (in sentential logic)', Philosophy and the Computer, L. Burkholder editor, 137-159, Westview (1992)."},{"key":"155400_CR14","first-page":"369","volume-title":"Formal Techniques in Artificial Intelligence","author":"J. H. Siekmann","year":"1990","unstructured":"Siekmann, J. H., 'An introduction to unification theory', Formal Techniques in Artificial Intelligence, 369-424, Elsevier Science Publishers, North-Holland (1990)."},{"key":"155400_CR15","doi-asserted-by":"crossref","unstructured":"St\u00c5lmarck, G., 'Normalization theorems for full first order classical natural deduction', JSL Vol. 56,No. 1 (1991).","DOI":"10.2307\/2274910"},{"key":"155400_CR16","unstructured":"Suppes, P., et al., 'Part I. Interactive theorem proving in CAI courses', University-Level Computer-Assisted Instruction at Stanford: 1968\u20131980, P. Suppes editor, IMSSS, Stanford University (1981)."},{"key":"155400_CR17","unstructured":"Szabo, M. E., The Collected Papers of Gerhard Gentzen, M. E. Szabo editor, 68-131, North-Holland (1969)."}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1005087316935.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1005087316935\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1005087316935.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:29:18Z","timestamp":1754630958000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1005087316935"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["155400"],"URL":"https:\/\/doi.org\/10.1023\/a:1005087316935","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"type":"print","value":"0039-3215"},{"type":"electronic","value":"1572-8730"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}