| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 423387 | Electronic Notes in Theoretical Computer Science | 2006 | 14 Pages |
Abstract
Inspired by the recent work on approximating classical logic, we present a procedure that approximates the modal logic K by determining a maximum limit of introspection. This procedure has a clear semantics and a natural proof theory in the context of Massacci's modal Single Step Tableaux (SST).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
