A weak completeness theorem for infinite valued first-order logic
暂无分享,去创建一个
This paper contains some results concerning the completeness of a first-order system of infinite valued logic There are under consideration two distinct notions of completeness corresponding to the two notions of validity (see Definition 3) and strong validity (see Definition 4). Both notions of validity, whether based on the unit interval [0, 1] or based on linearly ordered MV-algebras, use the element 1 as the designated truth value. Originally, it was thought by many investigators in the field that one should be able to prove that the set of valid sentences is recursively enumerable. It was first proved by Rutledge in [9] that the set of valid sentences in the monadic first-order infinite valued logic is recursively enumerable.
[1] Andrzej Mostowski,et al. Axiomatizability of some many valued predicate calculi , 1961 .
[2] C. Chang,et al. A new proof of the completeness of the Łukasiewicz axioms , 1959 .
[3] C. Chang,et al. Algebraic analysis of many valued logics , 1958 .
[4] Helena Rasiowa,et al. A proof of the completeness theorem of Grödel , 1950 .