{"id":"https://openalex.org/W2153737593","doi":"https://doi.org/10.2307/2695091","title":"An axiomatization of full Computation Tree Logic","display_name":"An axiomatization of full Computation Tree Logic","publication_year":2001,"publication_date":"2001-09-01","ids":{"openalex":"https://openalex.org/W2153737593","doi":"https://doi.org/10.2307/2695091","mag":"2153737593"},"language":"en","primary_location":{"id":"doi:10.2307/2695091","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2695091","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036930915","display_name":"Mark Reynolds","orcid":"https://orcid.org/0000-0002-5415-0544"},"institutions":[{"id":"https://openalex.org/I176790772","display_name":"Murdoch University","ror":"https://ror.org/00r4sry34","country_code":"AU","type":"education","lineage":["https://openalex.org/I176790772"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"M. Reynolds","raw_affiliation_strings":["School of Information Technology, Murdoch University, South Street, Perth, Western Australia 6150, E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Technology, Murdoch University, South Street, Perth, Western Australia 6150, E-mail:","institution_ids":["https://openalex.org/I176790772"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5036930915"],"corresponding_institution_ids":["https://openalex.org/I176790772"],"apc_list":null,"apc_paid":null,"fwci":5.3251,"has_fulltext":false,"cited_by_count":135,"citation_normalized_percentile":{"value":0.95995318,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"66","issue":"3","first_page":"1011","last_page":"1057"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.929407000541687},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6586568355560303},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.6362142562866211},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5541278719902039},{"id":"https://openalex.org/keywords/ctl*","display_name":"CTL*","score":0.5282663106918335},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.5186840295791626},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5055232048034668},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47604870796203613},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.468894898891449},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42127442359924316},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3597583472728729},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10331448912620544}],"concepts":[{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.929407000541687},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6586568355560303},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6362142562866211},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5541278719902039},{"id":"https://openalex.org/C147969180","wikidata":"https://www.wikidata.org/wiki/Q5014579","display_name":"CTL*","level":4,"score":0.5282663106918335},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.5186840295791626},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5055232048034668},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47604870796203613},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.468894898891449},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42127442359924316},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3597583472728729},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10331448912620544},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C202751555","wikidata":"https://www.wikidata.org/wiki/Q221681","display_name":"In vitro","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C154317977","wikidata":"https://www.wikidata.org/wiki/Q376266","display_name":"Cytotoxic T cell","level":3,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.2307/2695091","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2695091","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/4a96679f-dc9e-4681-b38a-05fa9ed42672","is_oa":false,"landing_page_url":"https://research-repository.uwa.edu.au/en/publications/4a96679f-dc9e-4681-b38a-05fa9ed42672","pdf_url":null,"source":{"id":"https://openalex.org/S4306402523","display_name":"UWA Profiles and Research Repository (University of Western Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Reynolds, M 2001, 'An Axiomatization of Full Computation Tree Logic', The Journal of Symbolic Logic, vol. 66, no. 3, pp. 1011-1057.","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:researchrepository.murdoch.edu.au:12272","is_oa":false,"landing_page_url":"http://researchrepository.murdoch.edu.au/id/eprint/12272/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400274","display_name":"Murdoch Research Repository (Murdoch University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I176790772","host_organization_name":"Murdoch University","host_organization_lineage":["https://openalex.org/I176790772"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Reynolds, M. <http://researchrepository.murdoch.edu.au/view/author/Reynolds, Mark.html> (2001) An axiomatization of full computation tree logic. Journal of Symbolic Logic, 66 (3). pp. 1011-1057.","raw_type":"Journal Article"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1183746544","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183746544","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.666.2813","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.666.2813","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://researchrepository.murdoch.edu.au/12272/1/axiomatization_of_full_computation_tree_logic.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1503002024","https://openalex.org/W1603602114","https://openalex.org/W1979405912","https://openalex.org/W1996717414","https://openalex.org/W2007505115","https://openalex.org/W2023808162","https://openalex.org/W2028942690","https://openalex.org/W2053068495","https://openalex.org/W2062458205","https://openalex.org/W2072887965","https://openalex.org/W2075664249","https://openalex.org/W2077311658","https://openalex.org/W2093270475","https://openalex.org/W2094912129","https://openalex.org/W2112547704","https://openalex.org/W2132750992","https://openalex.org/W2157005730","https://openalex.org/W2157319504","https://openalex.org/W2176705267"],"related_works":["https://openalex.org/W858755136","https://openalex.org/W1981889059","https://openalex.org/W3005864166","https://openalex.org/W2143025323","https://openalex.org/W31328628","https://openalex.org/W3091862538","https://openalex.org/W1969550103","https://openalex.org/W1031601050","https://openalex.org/W2105438026","https://openalex.org/W1546948343"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"give":[2],"a":[3,21],"sound":[4],"and":[5],"complete":[6],"axiomatization":[7],"for":[8],"the":[9],"full":[10],"computation":[11],"tree":[12],"logic.":[13,30],"CTL*,":[14],"of":[15],"R":[16],"-generable":[17],"models.":[18],"This":[19],"solves":[20],"long":[22],"standing":[23],"open":[24],"problem":[25],"in":[26],"branching":[27],"time":[28],"temporal":[29]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2025-10-10T00:00:00"}