Article contents
On the definition of an infinitely-many-valued predicate calculus1
Published online by Cambridge University Press: 12 March 2014
Extract
This paper presents a class of plausible definitions for validity of formulas in the infinitely-many-valued extension of the Łukasiewicz predicate calculus, and shows that all of them are equivalent. This extended system is discussed in some form in [3] and [4]; the questions discussed here are raised rather briefly in the latter.
We first describe the formal framework for the validity definition. The symbols to be used are the following: the connectives + and ‐, which are the strong disjunction B of [2] and negation respectively; the predicate variables Pi for i ∈ I, where I may be taken as the integers; the existential quantifiers E(J), where J⊆I, and I may be thought of as the index set on the individual variables, which however do not appear explicitly in this formulation.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1960
Footnotes
From a thesis in partial fulfillment of the requirements for the degree of Ph.D. in Mathematics at Cornell University. The author wishes to thank Professors E. P. Specker and J. Barkley Rosser for their helpful suggestions. The preparation of this paper was supported in part by the U. S. Navy under contract No. NONR-401(20)-NR 043–167 monitored by the ONR, and in part by IBM.
References
- 3
- Cited by