Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-27T05:02:57.986Z Has data issue: false hasContentIssue false
  • English
  • Français

An investigation of the propositional calculus used in a particular system of logic

Published online by Cambridge University Press:  24 October 2008

R. Harrop
R. Harrop
Affiliation:
King's CollegeNewcastle upon Tyne
Get access Rights & Permissions [Opens in a new window]

Extract

This paper contains a summary of some of the results obtained by the author during a study of the propositional part (denoted by A) of a system of free-from-contradiction, type-free logic set up in 1950 by Ackermann (1). It is shown that in its original form the calculus does not possess the desired properties with respect to equivalence of formulae. A calculus A′, which it is shown may be considered as a ‘minimal’ satisfactory extension of A, is constructed. A′ is compared and contrasted with an alternative form A″ of A given by Ackermann in a paper published in 1952 (2). It is proved that A″ is a proper extension of A′. Among the properties of A′ and A″ which are obtained is the resuit that neither calculus possesses a finite complete model. Reference is made to the solution of the decision problem for A, and it is indicated that it is thought that the corresponding problems can probably be solved for A′ and A″. The proofs of many of the results mentioned in the paper are, if given in detail, rather long. In such cases, from space considerations, only outline proofs are given. Complete proofs are contained in (5), which reference also contains several additional properties of the calculi considered.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 50 , Issue 4 , October 1954 , pp. 495 - 512
Copyright
Copyright © Cambridge Philosophical Society 1954

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Ackermann, W.Widerspruchsfreier Aufbau der Logik I. J. symbolic Logic, 15 (1950), 33–57.Google Scholar
(2)Ackermann, W.Widerspruchsfreier Aufbau einer typen-freien Logik (Erweitertes System). Math. Z. 55 (1952), 364–84.Google Scholar
(3)Curry, H. B.On the use of dots as brackets in logical expressions. J. symbolic Logic, 2 (1937), 26–8.Google Scholar
(4)Gödel, K.Zum Intuitionistischen Aussagenkalkül. Ergebn. Math. 4 (1932), 40.Google Scholar
(5)Hahrop, R. An investigation of the propositional calculus used in a particular System of logic. Ph.D. Dissertation (Cambridge, 1953).Google Scholar
(6)Kemeny, J. G.Models of logical Systems. J. eymbolic Logic, 13 (1948), 16–30.Google Scholar
(7)Eukasiewicz, J. and Tabski, A.Untersuchungen über der Aussagenkalkül. C.R. Soc. Sci. Varsovie, Classe III, 23 (1930), 30–50.Google Scholar
(8)Rosser, J. B. and Turquette, A. R.Axiom systems for M-valued propositional calculi. J. symbolic Logic, 10 (1945), 61–82.Google Scholar