Completeness theorems for some intermediate predicate calculi |
| |
Authors: | Pierluigi Minari |
| |
Institution: | 1. Istituto di Filosofia, Università di Firenze, Firenze, Italy
|
| |
Abstract: | We give completeness results — with respect to Kripke's semantic — for the negation-free intermediate predicate calculi: (1) $$\begin{gathered} BD = positive predicate calculus PQ + B:(\alpha \to \beta )v(\beta \to \alpha ) \hfill \\ + D:\forall x\left( {a\left( x \right)v\beta } \right) \to \forall xav\beta \hfill \\ \end{gathered}$$ (2) $$T_n D = PQ + T_n :\left( {a_0 \to a_1 } \right)v \ldots v\left( {a_n \to a_{n + 1} } \right) + D\left( {n \geqslant 0} \right)$$ and the superintuitionistic predicate calculus: (3) $$B^1 DH_2^ \urcorner = BD + intuitionistic negation + H_2^ \urcorner : \urcorner \forall xa \to \exists x \urcorner a.$$ The central point is the completeness proof for (1), which is obtained modifying Klemke's construction 3]. For a general account on negation-free intermediate predicate calculi — see Casari-Minari 1]; for an algebraic treatment of some superintuitionistic predicate calculi involving schemasB andD — see Horn 4] and Görnemann 2]. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|