journal article
oaidoi:10.1016/0304-3975(94)90085-X

A tableau-like proof procedure for normal modal logics

Authors
Publication date
20 June 1994
Publisher
Published by Elsevier B.V.
Doi

    Abstract

    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

    Similar works

    Full text

    thumbnail-image

    Elsevier - Publisher Connector

    redirect
    oaidoi:10.1016/0304-3975(94)90085...
    Last time updated on 05/05/2017

    This paper was published in Elsevier - Publisher Connector .

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.