No CrossRef data available.
Article contents
A Remark on Peirce’s Law
Published online by Cambridge University Press: 22 January 2016
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.
Before stating the purpose, we explain some propositional logics treated in this paper. The logical symbols we use are: implication →, conjunction ∧, disjunction ∨, and the propositional constant ⋏ denoting contradiction.
- Type
- Research Article
- Information
- Copyright
- Copyright © Editorial Board of Nagoya Mathematical Journal 1968
References
[1]
Miura, S. and Nagata, S.. Certain method for generating a series of logics, Nagoya Math. J., Vol. 31 (1968), 125–129.Google Scholar
[2]
Nagata, S.. A series of successive modifications of Peirce’s rule, Proc. Japan Acad., Vol. 42 (1966), 859–861.Google Scholar
[3]
Ono, K.. On universal character of the primitive logic, Nagoya Math. J., Vol. 27 (1966), 331–353.Google Scholar
[4]
Troelstra, A.S.. On intermediate propositional logics, Indag. Math., Vol. 27 (1965), 141–152.Google Scholar
[5]
Tugué, T.. A lemma for negationless propositional logics and its applications, Nagoya Math. J., Vol. 30 (1967), 303–308.Google Scholar