{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T21:28:12Z","timestamp":1695850092304},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1979,11,1]],"date-time":"1979-11-01T00:00:00Z","timestamp":310262400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1979,11]]},"DOI":"10.1007\/bf00268322","type":"journal-article","created":{"date-parts":[[2004,9,30]],"date-time":"2004-09-30T07:48:17Z","timestamp":1096530497000},"page":"377-400","source":"Crossref","is-referenced-by-count":26,"title":["Sequential method in propositional dynamic logic"],"prefix":"10.1007","volume":"12","author":[{"given":"Hirokazu","family":"Nishimura","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional modal logic of programs. Proceedings 9th Annual ACM Symposium on Theory of Computing, pp. 296?294, Boulder Co, 1977","DOI":"10.1145\/800105.803418"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/BF01201353","volume":"39","author":"G. Gentzen","year":"1935","unstructured":"Gentzen, G.: Untersuchungen \u00fcber das logische Schliessen I and II. Math. Z. 39, 176?210 and 405?431 (1935)","journal-title":"Math. Z."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Harel, D., Meyer, A.R., Pratt, V.R.: Computability and completeness in logics of programs. Proceedings 9th Annual Symposium on Theory of Computing, pp. 261?268, Boulder 1977","DOI":"10.1145\/800105.803416"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Harel, D.: Logics of programs: Axiomatics and descriptive power. MIT, ph.D.thesis, May 1978","DOI":"10.1145\/512760.512782"},{"key":"CR5","volume-title":"An introduction to modal logic","author":"G.E. Hughes","year":"1968","unstructured":"Hughes, G.E., Cresswell, M.J.: An introduction to modal logic. London: Methuen 1968"},{"key":"CR6","volume-title":"Mathematical theory of computation","author":"Z. Manna","year":"1974","unstructured":"Manna, Z.: Mathematical theory of computation. New York: McGraw-Hill 1974"},{"key":"CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9452-5","volume-title":"Mathematical logic","author":"D. Monk","year":"1976","unstructured":"Monk, D.: Mathematical logic. Berlin-Heidelberg-New York: Springer 1976"},{"key":"CR8","unstructured":"Nishimura, H.: A study of some tense logics by Gentzen's sequential method. forthcoming in Publ. R.I.M.S."},{"key":"CR9","first-page":"113","volume":"9","author":"M. Ohnishi","year":"1957","unstructured":"Ohnishi, M., Matsumoto, K.: Gentzen method in modal calculi I. Osaka Math. J. 9, 113?130 (1957)","journal-title":"Osaka Math. J."},{"key":"CR10","first-page":"115","volume":"11","author":"M. Ohnishi","year":"1959","unstructured":"Ohnishi, M., Matsumoto, K.: Gentzen method in modal calculi II. Osaka Math. J. 11, 115?120 (1959)","journal-title":"Osaka Math. J."},{"key":"CR11","first-page":"403","volume-title":"Lecture Notes in Computer Science, vol. 64","author":"R. Parikh","year":"1978","unstructured":"Parikh, R.: The completeness of propositional dynamic logic. Lecture Notes in Computer Science, vol. 64, pp. 403?415. Berlin-Heidelberg-New York: Springer 1978"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Semantical considerations in Floyd-Hoare logic. Proceedings 17th IEEE Symposium on Foundations of Computer Science, pp. 109?121. 1976","DOI":"10.1109\/SFCS.1976.27"},{"key":"CR13","first-page":"290","volume-title":"Lecture Notes in Mathematics vol. 500","author":"D. Prawitz","year":"1975","unstructured":"Prawitz, D.: Comments on Gentzen-type procedures and the classical notion of truth. Lecture Notes in Mathematics vol. 500, pp. 290?319. Berlin-Heidelberg-New York: Springer 1975"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"381","DOI":"10.2977\/prims\/1195189814","volume":"13","author":"M. Sato","year":"1977","unstructured":"Sato, M.: A study of Kripke-type models for some modal logics by Gentzen's sequential method. Publ. Res. Inst. Math. Sci. 13, 381?468 (1977)","journal-title":"Publ. Res. Inst. Math. Sci."},{"key":"CR15","first-page":"A","volume":"24","author":"K. Segerberg","year":"1977","unstructured":"Segerberg, K.: A completeness theorem in the modal logic of programs. Notices of the American Mathematical Society, 24, A-552 (1977)","journal-title":"Notices of the American Mathematical Society"},{"key":"CR16","volume-title":"Proof theory","author":"G. Takeuti","year":"1975","unstructured":"Takeuti, G.: Proof theory. Amsterdam: North-Holland 1975"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00268322.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00268322\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00268322","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T07:21:53Z","timestamp":1585898513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00268322"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,11]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1979,11]]}},"alternative-id":["BF00268322"],"URL":"https:\/\/doi.org\/10.1007\/bf00268322","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,11]]}}}