Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-25T03:24:32.223Z Has data issue: false hasContentIssue false

Formalisations of further ℵ0-valued Łukasiewicz propositional calculi

Published online by Cambridge University Press:  12 March 2014

Alan Rose*
Affiliation:
University of Nottingham, Nottingham, NG7 2RD, England

Extract

It has been shown that, for all rational numbers r such that 0≤ r ≤ 1, the ℵ0-valued Łukasiewicz propositional calculus whose designated truth-values are those truth-values x such that rx ≤ 1 may be formalised completely by means of finitely many axiom schemes and primitive rules of procedure. We shall consider now the case where r is rational, 0≥r≤1 and the designated truth-values are those truth-values x such that rx≤1.

We note that, in the subcase of the previous case where r = 1, a complete formalisation is given by the following four axiom schemes together with the rule of modus ponens (with respect to C),

the functor A being defined in the usual way. The functors B, K, L will also be considered to be defined in the usual way. Let us consider now the functor Dαβ such that if P, Dαβ take the truth-values x, dαβ(x) respectively, α, β are relatively prime integers and r = α/β then

It follows at once from a theorem of McNaughton that the functor Dαβ is definable in terms of C and N in an effective way. If r = 0 we make the definition

We note first that if x ≤ α/β then dαβ(x)≤(β + 1)α/β − α = α/β. Hence

Let us now define the functions dnαβ(x) (n = 0,1,…) by

Since

it follows easily that

and that

Thus, if x is designated, x − α/β > 0 and, if n > − log(x − α/β)/log(β + 1), then (β + 1)n(x−α/β) > 1.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1978

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]Chang, C. C., Proof of an axiom of Łukasiewicz, Transactions of the American Mathematical Society, vol. 87 (1958), pp. 5556.Google Scholar
[2]Lukasiewicz, J. and Tarski, A., Untersuchungen über den Aussagenkalkül, Comptes Rendus des Séances de la Société des Sciences et des Lettres de Varsovie. Classe III, vol. 23 (1930), pp. 3050.Google Scholar
[3]McNaughton, R., A theorem about infinite-valued sentential logic, this Journal, vol. 16 (1951), pp. 113.Google Scholar
[4]Meredith, C. A., The dependence of an axiom of Łukasiewicz, Transactions of the American Mathematical Society, vol. 87 (1958), p. 54.Google Scholar
[5]Rose, A., Formalisations of some ℵ0-valued Łukasiewicz prepositional calculi, Lecture Notes in Mathematics, vol. 70, Springer-Verlag, Berlin and New York, 1968, pp. 269271.Google Scholar
[6]Rose, A. and Rosser, J. B., Fragments of many-valued statement calculi, Transactions of the American Mathematical Society, vol. 87 (1958), pp. 153.CrossRefGoogle Scholar
[7]Rosser, J. B. and Turquette, A. R., Many-valued logics, North-Holland, Amsterdam, 1952.Google Scholar
[8]Tarski, A., Logic, semantics, metamathematics, Oxford University Press, London, 1956.Google Scholar
[9]Turing, A. M., On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, Second Series, vol. 42 (1936), pp. 230265.Google Scholar