This paper concerns theorem proving in some extended logic. As the core part of this work the computer application implementing Wiśniewski’s logic has been developed. The article begins with the presentation of logic syntax and semantics. The next part is a description of the proving system which is based on resolution rule, which enables automatization of the process. The final part focuses on a description of steps used for proving theorems. The correctness of the algorithm has been verified by experiments.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.