{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:53Z","timestamp":1725663413497},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540160663"},{"type":"electronic","value":"9783540397489"}],"license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-16066-3_12","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:35:34Z","timestamp":1330194934000},"page":"118-126","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Propositional calculi of term satisfiability and process logics"],"prefix":"10.1007","author":[{"given":"R.","family":"Knast","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Chandra A., Halpern I., Mayer A., Parikh R., Equations between regular terms and an application to process logic Annual ACM Symp. on Theory of Computing, 1981, pp.384\u2013390.","DOI":"10.1145\/800076.802493"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Habasi\u0144ski Z., Process logics: two decidability results, MFCA 1984, Lecture Notes in CS 176, pp.282\u2013290","DOI":"10.1007\/BFb0030309"},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0022-0000(82)90003-4","volume":"25","author":"D. Harel","year":"1982","unstructured":"Harel D., Kozen D., Parikh R., Process Logic: expresiveness, decidability, completeness, J. of Comp. and System. Sci., vol.25, 1982, pp.144\u2013170.","journal-title":"J. of Comp. and System. Sci."},{"issue":"4","key":"12_CR4","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/PGEC.1964.263815","volume":"13","author":"P. Landweber","year":"1964","unstructured":"Landweber P., Decision problems of phrase structure grammars, IEEE Trans, Electronic Comput. vol 13, N4, 1964, 354\u2013362.","journal-title":"IEEE Trans, Electronic Comput."}],"container-title":["Lecture Notes in Computer Science","Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16066-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:59:01Z","timestamp":1558267141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16066-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540160663","9783540397489"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-16066-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]},"assertion":[{"value":"28 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}