L. P. Belluce and C. C. Chang. A weak completeness theorem for infinite valued first-order logic. The journal of symbolic logic, vol. 28 no. 1 , pp. 43–50

Journal of Symbolic Logic 36 (2):332 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270291

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,503

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A Weak Completeness Theorem for Infinite Valued First-Order Logic.Bruno Scarpellini, L. P. Belluce & C. C. Chang - 1971 - Journal of Symbolic Logic 36 (2):332.
A weak completeness theorem for infinite valued first-order logic.L. P. Belluce & C. C. Chang - 1963 - Journal of Symbolic Logic 28 (1):43-50.
Review: L. P. Belluce, Further Results on Infinite Valued Predicate Logic. [REVIEW]Bruno Scarpellini - 1971 - Journal of Symbolic Logic 36 (2):332-332.
Semantical Completeness of First-Order Predicate Logic and the Weak Fan Theorem.Victor N. Krivtsov - 2015 - Studia Logica 103 (3):623-638.
Review: C.C. Chang, Algebraization of Infinitely Many-Valued Logic; C. C. Chang, Algebraic Analysis of Many Valued Logics; C. C. Chang, A New Proof of the Completeness of the Lukasiewicz Axioms. [REVIEW]Alfred Horn - 1971 - Journal of Symbolic Logic 36 (1):159-160.
Further results on infinite valued predicate logic.L. P. Belluce - 1964 - Journal of Symbolic Logic 29 (2):69-78.
Further Results on Infinite Valued Predicate Logic.L. P. Belluce - 1971 - Journal of Symbolic Logic 36 (2):332-332.
Rational Pavelka predicate logic is a conservative extension of łukasiewicz predicate logic.Petr Hájek, Jeff Paris & John Shepherdson - 2000 - Journal of Symbolic Logic 65 (2):669-682.
Rational Pavelka Predicate Logic is a Conservative Extension of Lukasiewicz Predicate Logic.Petr Hajek, Jeff Paris & John Shepherdson - 2000 - Journal of Symbolic Logic 65 (2):669-682.
Algorithmic logic. Multiple-valued extensions.Helena Rasiowa - 1979 - Studia Logica 38 (4):317 - 335.
An elementary proof of Chang's completeness theorem for the infinite-valued calculus of Lukasiewicz.Roberto Cignoli & Daniele Mundici - 1997 - Studia Logica 58 (1):79-97.
C. C. Chang. Algebraization of infinitely many-valued logic. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 144–146. - C. C. Chang. Algebraic analysis of many valued logics. Transactions of the American Mathematical Society, vol. 88 , pp. 467–490. - C. C. Chang. A new proof of the completeness of the Łukasiewicz axioms. Transactions of the American Mathematical Society, vol. 93 , pp. 74–80. [REVIEW]Alfred Horn - 1971 - Journal of Symbolic Logic 36 (1):159-160.
Finiteness in infinite-valued łukasiewicz logic.Stefano Aguzzoli & Agata Ciabattoni - 2000 - Journal of Logic, Language and Information 9 (1):5-29.
Algebras of intervals and a logic of conditional assertions.Peter Milne - 2004 - Journal of Philosophical Logic 33 (5):497-548.
A constructive proof of McNaughton's theorem in infinite-valued logic.Daniele Mundici - 1994 - Journal of Symbolic Logic 59 (2):596-602.

Analytics

Added to PP
2016-06-30

Downloads
25 (#627,007)

6 months
5 (#629,992)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references