Abstract
In the present paper, we would like to show a theorem concerning with reducibility of provability in the primitive logic. This theorem seems to suggest a procedure to find the proof-note of a given proposition which is provable in the primitive logic.
Publisher
Cambridge University Press (CUP)
Reference5 articles.
1. On universal character of the primitive logic, Nagoya Math. J., 27 (1966), 331–353.
2. On a Practical Way of Describing Formal Deductions
3. A Certain Kind of Formal Theories
4. A study on formal deductions in the primitive logic, Nagoya Math. J., 31 (1968), 1–14. J. Ito, [1] Studies on mechanical deductions part 1, Jour. Toyota Technical College, Vol. 1 (1968), 41–49.
5. Reduction of logics to the primitive logic, J, Math. Soc. Jap., Vol. 19, No. 3 (1967), 384–398.