DC FieldValueLanguage
dc.contributor.authorDoder, Draganen
dc.contributor.authorOgnjanović, Zoranen
dc.contributor.authorMarković, Zoranen
dc.date.accessioned2020-02-18T20:06:29Z-
dc.date.available2020-02-18T20:06:29Z-
dc.date.issued2010-08-26en
dc.identifier.issn0958-695Xen
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/55-
dc.description.abstractWe introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no finitary axiomatization. We offer a sound and strongly complete axiomatization for the considered logic.en
dc.publisherJ.UCS-
dc.relation.ispartofJournal of Universal Computer Scienceen
dc.subjectBranching time logic | First order logic | Strong completenessen
dc.titleAn axiomatization of a first-order branching time temporal logicen
dc.typeArticleen
dc.identifier.doi10.3217/jucs-016-11-1439-
dc.identifier.scopus2-s2.0-77955793302en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage1439-
dc.relation.lastpage1451-
dc.relation.issue11-
dc.relation.volume16-
dc.description.rankM23-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0003-2508-6480-
Show simple item record

SCOPUSTM   
Citations

14
checked on Jul 13, 2024

Page view(s)

71
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.