{"id":"https://openalex.org/W2056755329","doi":"https://doi.org/10.1093/logcom/exq028","title":"Labelled natural deduction for a bundled branching temporal logic","display_name":"Labelled natural deduction for a bundled branching temporal logic","publication_year":2010,"publication_date":"2010-09-02","ids":{"openalex":"https://openalex.org/W2056755329","doi":"https://doi.org/10.1093/logcom/exq028","mag":"2056755329"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exq028","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exq028","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","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/A5060055067","display_name":"Andrea Masini","orcid":"https://orcid.org/0000-0002-2466-0631"},"institutions":[{"id":"https://openalex.org/I119439378","display_name":"University of Verona","ror":"https://ror.org/039bp8j42","country_code":"IT","type":"education","lineage":["https://openalex.org/I119439378"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"A. Masini","raw_affiliation_strings":["Department of Computer Science, University of Verona, Italy. E-mail: andrea.masini@univr.it; luca.vigano@univr.it; marco.volpe@univr.it","Department of Computer Science, University of Verona, Italy. E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Verona, Italy. E-mail: andrea.masini@univr.it; luca.vigano@univr.it; marco.volpe@univr.it","institution_ids":["https://openalex.org/I119439378"]},{"raw_affiliation_string":"Department of Computer Science, University of Verona, Italy. E-mail:","institution_ids":["https://openalex.org/I119439378"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101515402","display_name":"Luca Vigan\u00f2","orcid":"https://orcid.org/0000-0001-9916-271X"},"institutions":[{"id":"https://openalex.org/I119439378","display_name":"University of Verona","ror":"https://ror.org/039bp8j42","country_code":"IT","type":"education","lineage":["https://openalex.org/I119439378"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"L. Vigano","raw_affiliation_strings":["Department of Computer Science, University of Verona, Italy. E-mail: andrea.masini@univr.it; luca.vigano@univr.it; marco.volpe@univr.it","Department of Computer Science, University of Verona, Italy. E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Verona, Italy. E-mail: andrea.masini@univr.it; luca.vigano@univr.it; marco.volpe@univr.it","institution_ids":["https://openalex.org/I119439378"]},{"raw_affiliation_string":"Department of Computer Science, University of Verona, Italy. E-mail:","institution_ids":["https://openalex.org/I119439378"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028009721","display_name":"Marco Volpe","orcid":null},"institutions":[{"id":"https://openalex.org/I119439378","display_name":"University of Verona","ror":"https://ror.org/039bp8j42","country_code":"IT","type":"education","lineage":["https://openalex.org/I119439378"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"M. Volpe","raw_affiliation_strings":["Department of Computer Science, University of Verona, Italy. E-mail: andrea.masini@univr.it; luca.vigano@univr.it; marco.volpe@univr.it","Department of Computer Science, University of Verona, Italy. E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Verona, Italy. E-mail: andrea.masini@univr.it; luca.vigano@univr.it; marco.volpe@univr.it","institution_ids":["https://openalex.org/I119439378"]},{"raw_affiliation_string":"Department of Computer Science, University of Verona, Italy. E-mail:","institution_ids":["https://openalex.org/I119439378"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028009721","https://openalex.org/A5060055067","https://openalex.org/A5101515402"],"corresponding_institution_ids":["https://openalex.org/I119439378"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":1.8368,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.87454822,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"21","issue":"6","first_page":"1093","last_page":"1163"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9994000196456909,"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/T11567","display_name":"semigroups and automata theory","score":0.9988999962806702,"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/T10142","display_name":"Formal Methods in Verification","score":0.998199999332428,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/natural-deduction","display_name":"Natural deduction","score":0.6564633846282959},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.5761449337005615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5655473470687866},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.5554180145263672},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.44778358936309814},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44319820404052734},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4251830577850342},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.4136131703853607},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.41102755069732666},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35507816076278687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3304908275604248},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.3221302032470703},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15324053168296814},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.0732964277267456}],"concepts":[{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.6564633846282959},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.5761449337005615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5655473470687866},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.5554180145263672},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.44778358936309814},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44319820404052734},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4251830577850342},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.4136131703853607},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.41102755069732666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35507816076278687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3304908275604248},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.3221302032470703},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15324053168296814},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0732964277267456},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1093/logcom/exq028","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exq028","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/57af61ad-b09d-4a90-9fb7-26bbf15cb79e","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/57af61ad-b09d-4a90-9fb7-26bbf15cb79e","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Masini , A , Vigan\u00f2 , L & Volpe , M 2011 , ' Labelled natural deduction for a bundled branching temporal logic ' , Journal of Logic and Computation , vol. 21 , no. 6 , pp. 1093-1163 . https://doi.org/10.1093/logcom/exq028","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W71254099","https://openalex.org/W1483339275","https://openalex.org/W1539868891","https://openalex.org/W1549387132","https://openalex.org/W1557413548","https://openalex.org/W1566288082","https://openalex.org/W1651570284","https://openalex.org/W1977377326","https://openalex.org/W1984813408","https://openalex.org/W2023808162","https://openalex.org/W2028942690","https://openalex.org/W2062458205","https://openalex.org/W2065114960","https://openalex.org/W2065353132","https://openalex.org/W2067441543","https://openalex.org/W2072887965","https://openalex.org/W2074901796","https://openalex.org/W2083732130","https://openalex.org/W2108478736","https://openalex.org/W2110345230","https://openalex.org/W2114841670","https://openalex.org/W2127075564","https://openalex.org/W2153737593","https://openalex.org/W2157319504","https://openalex.org/W2176705267","https://openalex.org/W2396555304","https://openalex.org/W2911379300","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2022951409","https://openalex.org/W3196825089","https://openalex.org/W4368367671","https://openalex.org/W2413189204","https://openalex.org/W3012663989","https://openalex.org/W4385652842","https://openalex.org/W2773803767","https://openalex.org/W4381095475","https://openalex.org/W4318200119","https://openalex.org/W2356412146"],"abstract_inverted_index":{"We":[0,107],"give":[1,108,151],"a":[2,11,30,48,64,110,131,144,152],"sound":[3],"and":[4,58,112,128,162],"complete":[5],"labelled":[6,118],"natural":[7,119],"deduction":[8,120,167],"system":[9,121],"for":[10,122],"bundled":[12],"branching":[13],"temporal":[14],"logic,":[15],"namely":[16],"the":[17,43,71,79,83,97,102,123,135,160,166],"until-free":[18,124],"version":[19,115,125],"of":[20,36,45,67,73,101,116,126,134,156,165],"BCTL*.":[21],"The":[22],"logic":[23,93],"BCTL*":[24],"is":[25,50,56,59,87],"obtained":[26],"by":[27],"referring":[28],"to":[29,143,150],"more":[31],"general":[32],"semantics":[33],"than":[34],"that":[35,42,140],"CTL*,":[37],"where":[38,82],"we":[39,138],"only":[40],"require":[41],"set":[44],"paths":[46],"in":[47],"model":[49],"closed":[51,60],"under":[52,61],"taking":[53],"suffixes":[54],"(i.e.":[55,86],"suffix-closed)":[57],"putting":[62],"together":[63],"finite":[65],"prefix":[66,84],"one":[68],"path":[69,76],"with":[70],"suffix":[72],"any":[74],"other":[75,90],"beginning":[77],"at":[78],"same":[80],"state":[81],"ends":[85],"fusion-closed).":[88],"In":[89],"words,":[91],"this":[92],"does":[94],"not":[95],"enjoy":[96],"so-called":[98],"limit-closure":[99],"property":[100],"standard":[103],"CTL*":[104],"validity":[105],"semantics.":[106],"both":[109,159],"classical":[111,163],"an":[113],"intuitionistic":[114,136,161],"our":[117],"BCTL*,":[127],"carry":[129],"out":[130],"proof-theoretical":[132],"analysis":[133],"system:":[137],"prove":[139],"derivations":[141],"reduce":[142],"normal":[145],"form,":[146],"which":[147],"allows":[148],"us":[149],"purely":[153],"syntactical":[154],"proof":[155],"consistency":[157],"(for":[158],"versions)":[164],"system.":[168]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}