DC FieldValueLanguage
dc.contributor.authorOgnjanović, Zoranen
dc.date.accessioned2020-02-18T20:06:33Z-
dc.date.available2020-02-18T20:06:33Z-
dc.date.issued1994-06-20en
dc.identifier.issn0304-3975en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/84-
dc.description.abstractIn this paper a new proof procedure for some propositional and first-order normal modal logics is given. It combines a tableau-like approach and a resolution-like inference. Completeness and decidability for some propositional logics are proved. An extension for the first-order case is presented.en
dc.publisherElsevier-
dc.relationScience Fund Serbia, grant number 0403-
dc.relation.ispartofTheoretical Computer Scienceen
dc.subjectFirst order normal modal logics | Kripke models | Normal modal logics | Propositional logics | Resolution like inference | Tableau like proof procedure-
dc.titleA tableau-like proof procedure for normal modal logicsen
dc.typeArticleen
dc.identifier.doi10.1016/0304-3975(94)90085-Xen
dc.identifier.scopus2-s2.0-0028447948en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage167-
dc.relation.lastpage186-
dc.relation.issue1-
dc.relation.volume129-
dc.description.rankM23-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0003-2508-6480-
Show simple item record

SCOPUSTM   
Citations

4
checked on Dec 26, 2024

Page view(s)

17
checked on Dec 26, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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