DC FieldValueLanguage
dc.contributor.authorOgnjanović, Zoran-
dc.date.accessioned2020-06-15T15:22:44Z-
dc.date.available2020-06-15T15:22:44Z-
dc.date.issued2001-
dc.identifier.issn0350-1302-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/3005-
dc.description.abstractWe describe a first order temporal logic over the natural numbers time. It is well known that the corresponding set of all valid formulas is not recursively enumerable, and that there is no finitistic axiomatization. We present an infinitary axiomatization which is sound and complete with respect to the considered logic.-
dc.publisherMathematical Institute of the SASA-
dc.relation.ispartofPublications de l'Institut Mathematique-
dc.titleCompleteness theorem for a first order linear-time logic-
dc.typeArticle-
dc.identifier.urlhttp://elib.mi.sanu.ac.rs/files/journals/publ/89/n083p001.pdf-
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage1-
dc.relation.lastpage7-
dc.relation.issue83-
dc.relation.volume69-
dc.description.rankM24-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
crisitem.author.orcid0000-0003-2508-6480-
Show simple item record

Page view(s)

35
checked on May 9, 2024

Google ScholarTM

Check


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