The decidability of certain intermediate propositional logics
- 23 July 1968
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 33 (2) , 258-264
- https://doi.org/10.2307/2269871
Abstract
Acquaintance with [11] and [8] will be assumed. Let be the alphabet →, &, ν, ┐, (,), A1, A2, … where →(I), &(C), ν (D) and ┐(N) are called the connectives. The letters appearing in parentheses are the names of the connectives. A1, A2 … are the atoms.Definition 1.1. A string S is an ICDN word iff there is a finite sequence of strings S1 … Sn = S such that for i, 1 ≤ i ≤ n, either S1 is an atom or S1 is one of the forms (S1→Sk), (S1 & Sk), (S1, ν Sk) or ┐S1,j, k ≤ i.Keywords
This publication has 6 references indexed in Scilit:
- On Finite LogicsIndagationes Mathematicae, 1967
- On Intermediate Propositional LogicsIndagationes Mathematicae, 1965
- On formulas of one variable in intuitionistic propositional calculusThe Journal of Symbolic Logic, 1960
- On the existence of finite models and decision procedures for propositional calculiMathematical Proceedings of the Cambridge Philosophical Society, 1958
- Eine Unableitbarkeitsbeweismethode für den Intuitionistischen AussagenkalkülArchive for Mathematical Logic, 1957
- Some theorems about the sentential calculi of Lewis and HeytingThe Journal of Symbolic Logic, 1948