Hostname: page-component-848d4c4894-nr4z6 Total loading time: 0 Render date: 2024-05-23T23:56:24.225Z Has data issue: false hasContentIssue false
  • English
  • Français

A Formalism for the Classical Sentence-Logic

Published online by Cambridge University Press:  22 January 2016

Katuzi Ono
Katuzi Ono*
Affiliation:
Mathematical Institute, Nagoya University
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.

I have introduced in my paper [1] a formalism for lower order predicate logics in which any sequence of variables and brackets (‘[’ and ‘]’) can be regarded as a meaningful (well-formed) sentence. Also, in my paper [2], I have introduced another formalism of the same kind for a certain kind of predicate logics of higher order. Can we introduce a formalism of the same kind properly for sentence logics too? Since sentence logics can be regarded as a sub-system of predicate logics, we are apt to consider that our device introduced in [1] works well for sentence logics too.

Type
Research Article
Information
Nagoya Mathematical Journal , Volume 28 , October 1966 , pp. 69 - 71
Copyright
Copyright © Editorial Board of Nagoya Mathematical Journal 1966

References

[1] Ono, K., A formalism for primitive logic and mechanical proof-checking, Nagoya Math. J., 26 (1966), 195–203.CrossRefGoogle Scholar
[2] Ono, K., Reinforced logic, Nagoya Math. J., 28 (1966) 15–25.CrossRefGoogle Scholar
[3] Ono, K., On universal character of the primitive logic, Nagoya Math. J., 27-1 (1966), 331–353.CrossRefGoogle Scholar