DC FieldValueLanguage
dc.contributor.authorIkodinović, Nebojšaen
dc.contributor.authorRašković, Miodragen
dc.contributor.authorMarković, Zoranen
dc.contributor.authorOgnjanović, Zoranen
dc.date.accessioned2020-02-18T20:06:28Z-
dc.date.available2020-02-18T20:06:28Z-
dc.date.issued2013-05-13en
dc.identifier.issn1542-3980en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/44-
dc.description.abstractIn this paper we investigate logics which are suitable for reasoning about uncertainty in different situations. A possible-world approach is used to provide semantics to formulas. Axiomatic systems for our logics are given and the corresponding strong completeness theorems are proved. Relationships to other systems are discussed.en
dc.publisherOld City Publishing-
dc.relation.ispartofJournal of Multiple-Valued Logic and Soft Computingen
dc.subjectClassical propositional logic | Completeness theorem | Measure | Uncertaintyen
dc.titleLogics with generalized measure operatorsen
dc.typeArticleen
dc.identifier.scopus2-s2.0-84877267203en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage527-
dc.relation.lastpage555-
dc.relation.issue5-6-
dc.relation.volume20-
dc.description.rankM21a-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0003-2508-6480-
Show simple item record

SCOPUSTM   
Citations

4
checked on Nov 19, 2024

Page view(s)

32
checked on Nov 19, 2024

Google ScholarTM

Check


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