| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4662651 | Annals of Pure and Applied Logic | 2006 | 7 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
