Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-20T04:30:39.668Z Has data issue: false hasContentIssue false
  • English
  • Français

A formalization of the C-O propositional calculus

Published online by Cambridge University Press:  24 October 2008

Alan Rose
Alan Rose
Affiliation:
King's CollegeAberdeen
Get access Rights & Permissions [Opens in a new window]

Extract

In this paper we formalize the two-valued propositional calculus with implication and the logical constant 0 (denoting a false statement), as primitives. We can define the logical constant 1 (denoting a true statement), by

and we can define negation by NP = df. CP0.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 47 , Issue 4 , October 1951 , pp. 635 - 636
Copyright
Copyright © Cambridge Philosophical Society 1951

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

* Łukasiewicz, Jan, ‘The shortest axiom of the implicational calculus of propositions’, Proc. Roy. Irish Acad. (A), 52 (1948), 25–33.Google Scholar

* Łukasiewiez, Jan and Tarski, Alfred, ‘Untersuchungen über den Aussagenkalkül’, C.R. Soc. Sci. Varsovie, Classe iii, 23 (1930), 30–50.Google Scholar