Journal of Symbolic Logic 52 (2):473-493 (1987)
|Abstract||his 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 Lowenheim-Skolem theorem. The paper is completely self-contained and includes examples of application to particular many-valued formal systems.|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Gordon Beavers (1993). Automated Theorem Proving for Łukasiewicz Logics. Studia Logica 52 (2):183 - 195.
Michael Kohlhase (1999). Higher-Order Multi-Valued Resolution. Journal of Applied Non-Classical Logics 9 (4):455-477.
Marcelo Tsuji (1998). Many-Valued Logics and Suszko's Thesis Revisited. Studia Logica 60 (2):299-309.
Walter Sinnott-Armstrong & Amit Malhotra (2002). How to Avoid Deviance (in Logic). History and Philosophy of Logic 23 (3):215--36.
Tsutomu Hosoi (1986). Pseudo Two-Valued Evaluation Method for Intermediate Logics. Studia Logica 45 (1):3 - 8.
Bernhard Beckert & Rajeev GorÉ (2001). Free-Variable Tableaux for Propositional Modal Logics. Studia Logica 69 (1):59-96.
Carlos A. OLLER (1999). Paraconsistency and Analyticity. Logic and Logical Philosophy 7 (1):91-99.
Added to index2009-01-28
Total downloads12 ( #101,164 of 722,870 )
Recent downloads (6 months)1 ( #60,917 of 722,870 )
How can I increase my downloads?