{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T13:28:41Z","timestamp":1774013321653,"version":"3.50.1"},"reference-count":27,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":4575,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2001,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We give a sound and complete axiomatization for the full computation tree logic. CTL*, of <jats:italic>R<\/jats:italic>-generable models. This solves a long standing open problem in branching time temporal logic.<\/jats:p>","DOI":"10.2307\/2695091","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T14:06:19Z","timestamp":1146924379000},"page":"1011-1057","source":"Crossref","is-referenced-by-count":85,"title":["An axiomatization of full Computation Tree Logic"],"prefix":"10.1017","volume":"66","author":[{"given":"M.","family":"Reynolds","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200010471_ref022","first-page":"240","volume-title":"17th ACM Symp. on Theory of Computing, Proceedings","year":"1985"},{"key":"S0022481200010471_ref023","volume-title":"BRICS Research Report RS-95-6","year":"1995"},{"key":"S0022481200010471_ref020","first-page":"477","volume-title":"Handbook of Logic in Computer Science, Volume 2","year":"1992"},{"key":"S0022481200010471_ref009","volume-title":"29th IEEE Foundations of Computer Science, Proceedings","year":"1988"},{"key":"S0022481200010471_ref008","volume":"33","year":"1986","journal-title":"Journal of the ACM"},{"key":"S0022481200010471_ref007","volume-title":"Proc. 14th ACM Symp. on Theory of Computing","year":"1982"},{"key":"S0022481200010471_ref006","first-page":"41","volume-title":"Logics for concurrency","year":"1996"},{"key":"S0022481200010471_ref005","volume":"26","year":"1983","journal-title":"Theoretical Computer Science"},{"key":"S0022481200010471_ref004","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90173-S"},{"key":"S0022481200010471_ref003","first-page":"52","volume-title":"Proc. IBM Workshop on Logic of Programs, Yorktown Heights, NY","year":"1981"},{"key":"S0022481200010471_ref002","doi-asserted-by":"publisher","DOI":"10.1007\/BF00370320"},{"key":"S0022481200010471_ref001","first-page":"210","volume-title":"Temporal logic, Proceedings of ICTL'94","year":"1994"},{"key":"S0022481200010471_ref019","volume-title":"Proceedings of 29th IEEE Symposium on the Foundations of Computer Science","year":"1988"},{"key":"S0022481200010471_ref018","first-page":"46","volume-title":"Proceedings of the Eighteenth Symposium on Foundations of Computer Science","year":"1977"},{"key":"S0022481200010471_ref017","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(66)80013-X"},{"key":"S0022481200010471_ref016","first-page":"2","volume-title":"Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science","year":"1995"},{"key":"S0022481200010471_ref015","first-page":"87","volume-title":"CAAP'96, 21st International Colloquium, Proceedings","volume":"1059","year":"1996"},{"key":"S0022481200010471_ref014","first-page":"163","volume-title":"7th ACM Symposium on Principles of Programming Languages, Las Vegas","year":"1980"},{"key":"S0022481200010471_ref013","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-8384-7_3"},{"key":"S0022481200010471_ref012","volume-title":"Temporal logic: Mathematical foundations and computational aspects","volume":"1","year":"1994"},{"key":"S0022481200010471_ref011","volume-title":"Handbook of theoretical computer science","volume":"B","year":"1990"},{"key":"S0022481200010471_ref010","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80047-9"},{"key":"S0022481200010471_ref027","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/3.3.249"},{"key":"S0022481200010471_ref026","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/7.1.125"},{"key":"S0022481200010471_ref025","first-page":"1","volume":"61","year":"1996","journal-title":"Branching-time logic with quantification over branches: the point of view of modal logic"},{"key":"S0022481200010471_ref024","doi-asserted-by":"publisher","DOI":"10.1007\/BF00649485"},{"key":"S0022481200010471_ref021","first-page":"135","volume-title":"Handbook of philosophical logic, Vol II: Extensions of classical logic","year":"1984"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200010471","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T19:26:46Z","timestamp":1557257206000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200010471\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0022481200010471"],"URL":"https:\/\/doi.org\/10.2307\/2695091","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}