Journal of Symbolic Logic 52 (2):473-493 (1987)
| Authors |
|
| 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.
|
| Keywords | tabeau methods |
| Categories | (categorize this paper) |
| DOI | 10.2307/2274395 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
PhilArchive copy
Upload a copy of this paper Check publisher's policy Papers currently archived: 54,740
External links
- From the Publisher via CrossRef (no proxy)
- projecteuclid.org
(no proxy) - projecteuclid.org [2] (no proxy)
- journals.cambridge.org (no proxy)
- jstor.org (no proxy)
- jstor.org [2] (no proxy)
- jstor.org [3] (no proxy)
- cambridge.org (no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
Citations of this work BETA
Maximal Weakly-Intuitionistic Logics.A. M. Sette & Walter A. Carnielli - 1995 - Studia Logica 55 (1):181 - 203.
On Partial and Paraconsistent Logics.Reinhard Muskens - 1999 - Notre Dame Journal of Formal Logic 40 (3):352-374.
Systematic Construction of Natural Deduction Systems for Many-Valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1993 - In Proceedings of The Twenty-Third International Symposium on Multiple-Valued Logic, 1993. Los Alamitos, CA: IEEE Press. pp. 208-213.
Elimination of Cuts in First-Order Finite-Valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1994 - Journal of Information Processing and Cybernetics EIK 29 (6):333-355.
Proof Theory of Finite-Valued Logics.Richard Zach - 1993 - Dissertation, Technische Universität Wien
View all 22 citations / Add more citations
Similar books and articles
Automated Theorem Proving for Łukasiewicz Logics.Gordon Beavers - 1993 - Studia Logica 52 (2):183 - 195.
Free-Variable Tableaux for Propositional Modal Logics.Bernhard Beckert & Rajeev GorÉ - 2001 - Studia Logica 69 (1):59-96.
Pseudo Two-Valued Evaluation Method for Intermediate Logics.Tsutomu Hosoi - 1986 - Studia Logica 45 (1):3 - 8.
How to Avoid Deviance (in Logic).Walter Sinnott-Armstrong & Amit Malhotra - 2002 - History and Philosophy of Logic 23 (3):215--36.
Many-Valued Logics and Suszko's Thesis Revisited.Marcelo Tsuji - 1998 - Studia Logica 60 (2):299-309.
Higher-Order Multi-Valued Resolution.Michael Kohlhase - 1999 - Journal of Applied Non-Classical Logics 9 (4):455-477.
Cut-Free Ordinary Sequent Calculi for Logics Having Generalized Finite-Valued Semantics.Arnon Avron, Jonathan Ben-Naim & Beata Konikowska - 2007 - Logica Universalis 1 (1):41-70.
Analytics
Added to PP index
2009-01-28
Total views
64 ( #151,650 of 2,386,866 )
Recent downloads (6 months)
3 ( #262,029 of 2,386,866 )
2009-01-28
Total views
64 ( #151,650 of 2,386,866 )
Recent downloads (6 months)
3 ( #262,029 of 2,386,866 )
How can I increase my downloads?
Downloads
