{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T07:27:50Z","timestamp":1773300470006,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11155,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1983]]},"DOI":"10.1016\/0304-3975(82)90125-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:07:16Z","timestamp":1027638436000},"page":"333-354","source":"Crossref","is-referenced-by-count":1303,"title":["Results on the propositional \u03bc-calculus"],"prefix":"10.1016","volume":"27","author":[{"given":"Dexter","family":"Kozen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90125-6_BIB1","series-title":"Mathematical Theory of Program Correctness","author":"De Bakker","year":"1980"},{"key":"10.1016\/0304-3975(82)90125-6_BIB2","series-title":"Proc. 1st Internat. Coll. on Automata, Languages and Programming","first-page":"167","article-title":"A calculus for recursive program schemes","author":"De Bakker","year":"1972"},{"issue":"1","key":"10.1016\/0304-3975(82)90125-6_BIB3","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(82)90125-6_BIB4","series-title":"Proc. 7th Internat. Coll. on Automata, Languages and Programming","first-page":"169","article-title":"Characterizing correctness properties of parallel programs using fixpoints","volume":"85","author":"Emerson","year":"1980"},{"key":"10.1016\/0304-3975(82)90125-6_BIB5","series-title":"Proc. Workshop on Logics of Programs","first-page":"52","article-title":"Design and synthesis of synchronization skeletons using branching-time temporal logic","volume":"131","author":"Emerson","year":"1982"},{"issue":"2","key":"10.1016\/0304-3975(82)90125-6_BIB6","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","article-title":"Propositional dynamic logic of regular programs","volume":"18","author":"Fischer","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(82)90125-6_BIB7","series-title":"Proc. 1st Internat. Colloq. on Automata, Languages and Programming","first-page":"225","article-title":"Induction rules and termination proofs","author":"Hitchcock","year":"1973"},{"key":"10.1016\/0304-3975(82)90125-6_BIB8","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1109\/SFCS.1981.49","article-title":"The propositional dynamic logic of deterministic, well-structured programs (extended abstract)","author":"Halpern","year":"1981","journal-title":"Proc. 22nd IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(82)90125-6_BIB9","series-title":"Proc. 7th Internat. Colloq. on Automata, Languages, and Programming","first-page":"352","article-title":"A representation theorem for models of \u2217-free PDL","volume":"85","author":"Kozen","year":"1980"},{"key":"10.1016\/0304-3975(82)90125-6_BIB10","series-title":"Proc. Workshop on Logic of Programs","first-page":"1","article-title":"On the duality of dynamic algebras and Kripke models","volume":"125","author":"Kozen","year":"1979"},{"key":"10.1016\/0304-3975(82)90125-6_BIB11","series-title":"Proc. Workshop on Logics of Programs 1981","first-page":"167","article-title":"On induction vs. \u2217-continuity","volume":"131","author":"Kozen","year":"1982"},{"key":"10.1016\/0304-3975(82)90125-6_BIB12","unstructured":"D. Kozen, On the expressiveness of \u03bc, Unpublished manuscript."},{"key":"10.1016\/0304-3975(82)90125-6_BIB13","unstructured":"D. Kozen, Small models for the propositional \u03bc-calculus, Unpublished manuscript."},{"key":"10.1016\/0304-3975(82)90125-6_BIB14","first-page":"348","article-title":"Results on the propositional \u03bc-calculus","author":"Kozen","year":"1982","journal-title":"Proc. 9th Internat. Colloq. on Automata, Languages, and Programming"},{"key":"10.1016\/0304-3975(82)90125-6_BIB15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0304-3975(81)90019-0","article-title":"An elementary proof of the completeness of PDL","volume":"14","author":"Kozen","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90125-6_BIB16","series-title":"Proc. Workshop on Logics of Programs 1983","article-title":"A decision procedure for the propositional \u03bc-calculus","author":"Kozen","year":"1983"},{"key":"10.1016\/0304-3975(82)90125-6_BIB17","first-page":"59","article-title":"Fixpoint induction and proof of program semantics","volume":"5","author":"Park","year":"1970"},{"key":"10.1016\/0304-3975(82)90125-6_BIB18","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0022-0000(80)90061-6","article-title":"A near optimal method for reasoning about action","volume":"20","author":"Pratt","year":"1980","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0304-3975(82)90125-6_BIB19","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1109\/SFCS.1981.4","article-title":"A decidable \u03bc-calculus","author":"Pratt","year":"1981","journal-title":"Proc. 22nd IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(82)90125-6_BIB20","series-title":"Ph.D. Thesis","article-title":"Recursive program schemes: Semantics and proof theory","author":"De Roever","year":"1974"},{"key":"10.1016\/0304-3975(82)90125-6_BIB21","first-page":"375","article-title":"Propositional dynamic logic of looping and converse","author":"Streett","year":"1981","journal-title":"Proc. 13th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(82)90125-6_BIB22","series-title":"A theory of programs","author":"Scott","year":"1969"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582901256?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582901256?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T02:13:30Z","timestamp":1580868810000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582901256"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397582901256"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90125-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}