| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 422850 | Electronic Notes in Theoretical Computer Science | 2014 | 18 Pages |
Abstract
We present a logic of verified and unverified assertions and prove it sound and complete with respect to its possible-worlds semantics. The logic, a constructive modal logic, is motivated by considerations of the interpretation of conditionals in natural language semantics, but, we claim, is of independent interest.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
