DC FieldValueLanguage
dc.contributor.authorRašković, Miodrag-
dc.contributor.authorTanović, Predrag-
dc.date.accessioned2020-07-14T07:24:01Z-
dc.date.available2020-07-14T07:24:01Z-
dc.date.issued1990-
dc.identifier.issn0350-1302-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/3849-
dc.description.abstractWe prove a completeness theorem for a logic with both probability and first-order quantifiers in the case when the basic language contains only unary relation symbols.-
dc.publisherMathematical Institute of the SASA-
dc.relation.ispartofPublications de l'Institut Mathématique-
dc.titleCompleteness theorem for a monadic logic with both first-order and probability quantifiers-
dc.typeArticle-
dc.identifier.urlhttp://elib.mi.sanu.ac.rs/files/journals/publ/67/n061p001.pdf-
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage1-
dc.relation.lastpage14-
dc.relation.issue61-
dc.relation.volume47-
dc.description.rankM24-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.deptMathematics-
crisitem.author.orcid0000-0003-0307-7508-
Show simple item record

Page view(s)

19
checked on Nov 19, 2024

Google ScholarTM

Check


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