On maximal intermediate logics with the disjunction property
For intermediate logics, there is obtained in the paper an algebraic equivalent of the disjunction propertyDP. It is proved that the logic of finite binary trees is not maximal among intermediate logics withDP. Introduced is a logicND, which has the only maximal extension withDP, namely, the logicML of finite problems.
KeywordsMathematical Logic Binary Tree Computational Linguistic Maximal Extension Intermediate Logic
Unable to display preview. Download preview PDF.
- 1.T. Hosoi, H. Ono,Intermediate propositional logics (A survey),J. Tsuda College, 5, (1973) pp. 67–82.Google Scholar
- 2.R. E. Kirk,A result on propositional logics having the disjunction property,Notre Dame Journal of Formal Logic, 23 (1982), pp. 71–74.Google Scholar
- 3.A. V. Kuznetsov,On superintuitionistic logics,Matematičeskie Issledovania, 10, No. 2 (36), (1975), pp. 150–158 (in Russian).Google Scholar
- 4.L. L. Maksimova, D. P. Skvortsov, V. B. Shekhtman,Impossibility of finite axiomatization of Medvedev's logic of finite problems,Doklady AN SSSR, 245, no. 5 (1979), pp. 1051–1054 (in Russian).Google Scholar
- 5.V. V. Rybakov,Modal logics with LM-axioms,Algebra i Logika, 17, no. 4 (1978), pp. 455–467 (in Russian).Google Scholar
- 6.A. Wroński,Intermediate logics and the disjunction property,Reports on Mathematical Logic, 1 (1973), pp. 39–52.Google Scholar
- 7.V. A. Yankov,Construction of a sequence of strongly independent superintuitionistic propositional calculi,Doklady AN SSSR,181, (1968), pp. 33–34 (inRussian).Google Scholar