The decidability of one-variable propositional calculi

Notre Dame Journal of Formal Logic 20 (2):438-450 (1979)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The strong decidability of cut-logics. I. Partial propositional calculi.E. William Chapin - 1971 - Notre Dame Journal of Formal Logic 12 (3):322-328.
Many-one degrees associated with partial propositional calculi.W. E. Singletary - 1974 - Notre Dame Journal of Formal Logic 15 (2):335-343.
Involution as a basis for propositional calculi.M. B. Smyth - 1974 - Notre Dame Journal of Formal Logic 15 (4):569-588.
Creative definitions in propositional calculi.V. Frederick Rickey - 1975 - Notre Dame Journal of Formal Logic 16 (2):273-294.
Propositional sequence-calculi for inconsistent systems.Andrés R. Raggio - 1968 - Notre Dame Journal of Formal Logic 9 (4):359-366.
Necessity and some non-modal propositional calculi.Biswambhar Pahi - 1973 - Notre Dame Journal of Formal Logic 14 (3):401-404.
Results regarding the axiomatization of partial propositional calculi.W. E. Singletary - 1968 - Notre Dame Journal of Formal Logic 9 (3):193-211.
A note concerning the many-valued propositional calculi.Bolesław Sobociński - 1961 - Notre Dame Journal of Formal Logic 2 (2):127-128.

Analytics

Added to PP
2010-08-24

Downloads
25 (#884,004)

6 months
8 (#594,873)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references