A(nother) characterization of intuitionistic propositional logic
β Scribed by Rosalie Iemhoff
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 123 KB
- Volume
- 113
- Category
- Article
- ISSN
- 0168-0072
No coin nor oath required. For personal study only.
β¦ Synopsis
In Iemho (J. Symbolic Logic, to appear) we gave a countable basis V for the admissible rules of IPC . Here, we show that there is no proper superintuitionistic logic with the disjunction property for which all rules in V are admissible. This shows that, relative to the disjunction property, IPC is maximal with respect to its set of admissible rules. This characterization of IPC is optimal in the sense that no ΓΏnite subset of V su ces. In fact, it is shown that for any ΓΏnite subset X of V, for one of the proper superintuitionistic logics Dn constructed by De Jongh and Gabbay (J. Symbolic Logic 39 (1974)), all the rules in X are admissible. Moreover, the logic Dn in question is even characterized by X : it is the maximal superintuitionistic logic containing Dn with the disjunction property for which all rules in X are admissible. Finally, the characterization of IPC is proved to be e ective by showing that it is e ectively reducible to an e ective characterization of IPC in terms of the Kleene slash by De Jongh (Kino et al. eds.,
π SIMILAR VOLUMES
## Abstract In this paper we propose a Kripkeβstyle semantics for second order intuitionistic propositional logic and we provide a semantical proof of the disjunction and the explicit definability property. Moreover, we provide a tableau calculus which is sound and complete with respect to such a s