Further results on infinite valued predicate logic
- 1 June 1964
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 29 (2) , 69-78
- https://doi.org/10.2307/2270410
Abstract
In a previous paper [1] Chang and the present author presented a system of infinite valued predicate logic, the truth values being the closed interval [0, 1] of real numbers. That paper was the result of an investigation attempting to establish the completeness of the system using the real number 1 as the sole designated value. In fact, we fell short of our mark and proved a weakened form of completeness utilizing positive segments, [0, a], of linearly ordered abelian groups as admissible truth values. A result of Scarpellini [8], however, showing that the set of well-formed formulas of infinite valued logic valid (with respect to the sole designated real number 1) is not recursively enumerable indicates the above mentioned result is the best possible.Keywords
This publication has 8 references indexed in Scilit:
- A weak completeness theorem for infinite valued first-order logicThe Journal of Symbolic Logic, 1963
- Axiomatizability of some many valued predicate calculiFundamenta Mathematicae, 1961
- A new proof of the completeness of the Łukasiewicz axiomsTransactions of the American Mathematical Society, 1959
- Algebraic analysis of many valued logicsTransactions of the American Mathematical Society, 1958
- Fragments of many-valued statement calculiTransactions of the American Mathematical Society, 1958
- Complete TheoriesThe Mathematical Gazette, 1957
- A theorem about infinite-valued sentential logicThe Journal of Symbolic Logic, 1951
- Sur les ensembles définissables de nombres réelsFundamenta Mathematicae, 1931