{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:02Z","timestamp":1725663422368},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540160663"},{"type":"electronic","value":"9783540397489"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-16066-3_30","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:36:26Z","timestamp":1330194986000},"page":"364-374","source":"Crossref","is-referenced-by-count":1,"title":["Propositional dynamic logics with counters and stacks"],"prefix":"10.1007","author":[{"given":"Tinko","family":"Tinchev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimiter","family":"Vakarelov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"30_CR1","unstructured":"Goldblatt, R. Axiomatising the Logic of Computer Programming, Springer LNCS 130 (1982)."},{"key":"30_CR2","first-page":"177","volume":"158","author":"D. Harel","year":"1983","unstructured":"Harel, D. Recurring Domimoes: Making the Highly Undecidable Highly Understandable, in: Springer LNCS 158 (1983), 177\u2013194.","journal-title":"Springer LNCS"},{"key":"30_CR3","first-page":"222","volume":"26","author":"D. Harel","year":"1983","unstructured":"Harel, D., A. Pnueli and J. Stavi, Propositional Dynamic Logic of Nonregular Programs, JCSS 26, (1983), 222\u2013243.","journal-title":"JCSS"},{"key":"30_CR4","first-page":"12","volume":"115","author":"A. Meyer","year":"1981","unstructured":"Meyer, A., R. Streett and G. Mirkowska, The Deducibility Problem in Propositional Dynamic Logic, in: Springer LNCS 115 (1981), 12\u201322.","journal-title":"Springer LNCS"},{"key":"30_CR5","first-page":"23","volume":"125","author":"G. Mirkowska","year":"1981","unstructured":"Mirkowska, G. PAL \u2014 Propositional Algorithmic Logic, in: Springer LNCS 125 (1981), 23\u2013101.","journal-title":"Springer LNCS"},{"key":"30_CR6","first-page":"166","volume":"148","author":"G. Mirkowska","year":"1983","unstructured":"Mirkowska, G. On the Propositional Algorithmic Theory of Arithmetic, in: Springer LNCS 148 (1983), 166\u2013185.","journal-title":"Springer LNCS"},{"key":"30_CR7","unstructured":"Salwicki,A. On Algorithmic Theory of Stacks, ICS PAS report Nr 337"},{"key":"30_CR8","unstructured":"Tinchev, T. and D. Vakarelov. Propositional Dynamic Logic with Recursive Programs, submitted."}],"container-title":["Lecture Notes in Computer Science","Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16066-3_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:02:55Z","timestamp":1619557375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16066-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540160663","9783540397489"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-16066-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}