A tableau-like proof procedure for normal modal logics

DC Field	Value	Language
dc.contributor.author	Ognjanović, Zoran	en
dc.date.accessioned	2020-02-18T20:06:33Z	-
dc.date.available	2020-02-18T20:06:33Z	-
dc.date.issued	1994-06-20	en
dc.identifier.issn	0304-3975	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/84	-
dc.description.abstract	In 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.publisher	Elsevier	-
dc.relation	Science Fund Serbia, grant number 0403	-
dc.relation.ispartof	Theoretical Computer Science	en
dc.subject	First order normal modal logics \| Kripke models \| Normal modal logics \| Propositional logics \| Resolution like inference \| Tableau like proof procedure	-
dc.title	A tableau-like proof procedure for normal modal logics	en
dc.type	Article	en
dc.identifier.doi	10.1016/0304-3975(94)90085-X	en
dc.identifier.scopus	2-s2.0-0028447948	en
dc.contributor.affiliation	Mathematical Institute of the Serbian Academy of Sciences and Arts	-
dc.relation.firstpage	167	-
dc.relation.lastpage	186	-
dc.relation.issue	1	-
dc.relation.volume	129	-
dc.description.rank	M23	-
item.openairetype	Article	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.cerifentitytype	Publications	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-
crisitem.author.orcid	0000-0003-2508-6480	-

4

checked on Apr 23, 2024

70

checked on Apr 24, 2024

Check