DC Field | Value | Language |
---|---|---|
dc.contributor.author | Rašković, Miodrag | - |
dc.contributor.author | Tanović, Predrag | - |
dc.date.accessioned | 2020-07-14T07:24:01Z | - |
dc.date.available | 2020-07-14T07:24:01Z | - |
dc.date.issued | 1990 | - |
dc.identifier.issn | 0350-1302 | - |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/3849 | - |
dc.description.abstract | We 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.publisher | Mathematical Institute of the SASA | - |
dc.relation.ispartof | Publications de l'Institut Mathématique | - |
dc.title | Completeness theorem for a monadic logic with both first-order and probability quantifiers | - |
dc.type | Article | - |
dc.identifier.url | http://elib.mi.sanu.ac.rs/files/journals/publ/67/n061p001.pdf | - |
dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
dc.relation.firstpage | 1 | - |
dc.relation.lastpage | 14 | - |
dc.relation.issue | 61 | - |
dc.relation.volume | 47 | - |
dc.description.rank | M24 | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Mathematics | - |
crisitem.author.orcid | 0000-0003-0307-7508 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.