Epistemic possibilities for constructive reasoning with open assumptions
نویسنده
چکیده
For the verificationist principle of truth underlying intuitionistic logic and constructivism, semantic truth conditions for propositions are substituted by syntactically defined assertion conditions for judgments ([2]). Where the standard interpretation of such notion of truth is given in a language for arithmetic, far less clear is how to interpret it for the representation of rational knowledge processes. In this talk, I will show philosophical and logical issues involved by such task, and in particular for the required interepretation of open assumptions in Constructive Type Theory (CTT, [1]). In the first part of the talk, the crucial problem of assertion conditions for judgments will be illustrated, introducing epistemic modalities for formulae of the form (A true) and ♦(A true) (see [7] and [6]). Such judgmental modal operators express epistemic attitudes for assertion conditions and significantly extend the quantificational fragment of CTT. In the second part, some existent modal contextual type-theoretical calculi based on propositional modal operators are surveyed ([3], [4]) and then the alternative version based on their judgmental translation is introduced ([5]). Their interpretation requires a non-standard extension of the constructive definition of type to introduce separate truth constructors from verified and open assumptions. Judgmental modal operators are then used to internalize modes of correctness on truth expressions: necessity for standard constructive verification, possibility for provability up to refutation of contextual conditions.
منابع مشابه
A Constructive Epistemic Logic with Public Announcement (Non-Predetermined Possibilities)
We argue that the notion of epistemic possible worlds in constructivism (intuition-ism) is not as the same as it is in classic view, and there are possibilities, called non-predetermined worlds, which are ignored in (classic) Epistemic Logic. Regarding non-predetermined possibilities, we propose a constructive epistemic logic and prove soundness and completeness theorems for it. We extend the p...
متن کاملReasoning in Open Domains
In this paper we modify the semantics of epistemic speci cations (and hence the answer set semantics of extended logic program and disjunctive databases) to allow for reasoning in the absence of domain{closure assumption. This modi cation increases the expressive power of the language and allows one to explicitly state the domain{closure and other assumptions about the domain of discourse in th...
متن کاملType-theoretical Dynamics Exploring Belief Revision in a constructive framework
In the present paper a dynamics for type theory is introduced. The formalization provides epistemic explanations for the basic notions of belief state and belief set by referring to assertion conditions for type-theoretical judgements; it interprets expectations in terms of default assumptions for such a structure and it adapts the usual revision operations and the analogous of the Ramsey test....
متن کاملEpistemic Conditionals and Conditional Epistemics
There has been a murder in the mansion. There are, and we all know that this is so, only three suspects: the gardener, the driver, and the butler. We believe, and we have our reasons for so believing, that if the gardener did not do it, then the driver did. We share belief in this particular conditional, and this conditional is of a particular kind. It is what Quine calls an ‘‘ordinary indicati...
متن کاملRepresenting Imperfect Information of Procedures with Hyper Models
When reasoning about knowledge of procedures under imperfect information, the explicit representation of epistemic possibilities blows up the S5-like models of standard epistemic logic. To overcome this drawback, in this paper, we propose a new logical framework based on compact models without epistemic accessibility relations for reasoning about knowledge of procedures. Inspired by the 3-value...
متن کامل