Systematization of finite many-valued logics through the method of tableaux
- 1 June 1987
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 52 (2), 473-493
- https://doi.org/10.2307/2274395
Abstract
This paper presents a unified treatment of the propositional and first-order many-valued logics through the method of tableaux. It is shown that several important results on the proof theory and model theory of those logics can be obtained in a general way.We obtain, in this direction, abstract versions of the completeness theorem, model existence theorem (using a generalization of the classical analytic consistency properties), compactness theorem and Löwenheim-Skolem theorem.The paper is completely self-contained and includes examples of application to particular many-valued formal systems.Keywords
This publication has 5 references indexed in Scilit:
- an algorithm for axiomatizing every finite logic**The paper was presented at the International Symposium on Multiple-Valued Logic, Morgantown, West Virginia, U.S.A., May, 1974. An abstract of this paper is published in [3].Published by Elsevier ,1977
- The number of maximal closed classes in the set of functions over a finite domainJournal of Combinatorial Theory, Series A, 1973
- First-Order Logic. By R.M. Smullyan. Pp. 158. 75s. 1968. (Springer-Verlag-Berlin).The Mathematical Gazette, 1970
- First-Order LogicPublished by Springer Nature ,1968
- A UNIFYING PRINCIPAL IN QUANTIFICATION THEORYProceedings of the National Academy of Sciences, 1963