Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

APAL
2006

favoriteEmaildiscussreport

89views more APAL 2006»

On modal logic of deductive closure

13 years 4 months ago

On modal logic of deductive closure

Download www2.mcdaniel.edu

A new modal logic D is introduced. It describes properties of provability by interpreting modality as a deductive closure operator on sets of formulas. Logic D is proven to be decidable and complete with respect to this semantics. Key words: logic of provability, modal logic, deductive closure 1991 MSC: 03B45

Pavel Naumov

Real-time Traffic

APAL 2006 | Deductive Closure | Deductive Closure Operator | Modal Logic |

claim paper

Related Content

» Fuzzy logic continuity and effectiveness

» A SetTheoretic Approach to Automated Deduction in Graded Modal Logics

» Fibring Modal FirstOrder Logics Completeness Preservation

» On Modal Deductive Databases

» Intuitionistic hybrid logic

» Rewriting for Fitch Style Natural Deductions

» An efficient relational deductive system for propositional nonclassical logics

» Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4

» Foundations of Modal Deductive Databases

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2006
Where	APAL
Authors	Pavel Naumov

Comments (0)