Hostname: page-component-848d4c4894-p2v8j Total loading time: 0.001 Render date: 2024-05-24T14:47:15.400Z Has data issue: false hasContentIssue false
  • English
  • Français

On Reducibility of Provability in the Primitive Logic [LO]

Published online by Cambridge University Press:  22 January 2016

Jiro Ito
Jiro Ito*
Affiliation:
Toyota Technical College
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Nagoya Mathematical Journal , Volume 37 , March 1970 , pp. 137 - 144
Copyright
Copyright © Editorial Board of Nagoya Mathematical Journal 1970

References

Ono, K., [1] On a practical way of describing formal deductions, Nagoya Math. J., 21 (1962), 115–121.Google Scholar
[2] A certain kind of formal theories, Nagoya Math. J., 25 (1965), 59–86.Google Scholar
[3] On universal character of the primitive logic, Nagoya Math. J., 27 (1966), 331–353.Google Scholar
[4] Reduction of logics to the primitive logic, J, Math. Soc. Jap., Vol. 19, No. 3 (1967), 384–398.Google Scholar
[5] 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.Google Scholar