- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A constructive proof of Craig's interpolation lemma for m-valued logic
Studia Logica 38 (3):267 - 275 (1979)
Abstract
The algebraic proof of Craig's interpolation lemma for m-valued logic was given by Rasiowa in [1]. We present here a constructive proof of this lemma, based on a Gentzen type formalization.Other Versions
No versions found
My notes
Similar books and articles
DFC-algorithms for Suszko logic and one-to-one Gentzen type formalizations.Anita Wasilewska - 1984 - Studia Logica 43 (4):395 - 404.
Interpolation in Extensions of First-Order Logic.Guido Gherardi, Paolo Maffezioli & Eugenio Orlandelli - 2020 - Studia Logica 108 (3):619-648.
Craig's interpolation theorem for the intuitionistic logic and its extensions—A semantical approach.Hiroakira Ono - 1986 - Studia Logica 45 (1):19-33.
Weak König's Lemma Implies Brouwer's Fan Theorem: A Direct Proof.Hajime Ishihara - 2006 - Notre Dame Journal of Formal Logic 47 (2):249-252.
A constructive proof of the Craig’s interpolation theorem for QCiore.Victoria Arce Pistone - 2025 - Logic Journal of the IGPL 33 (5).
Bishop's Lemma.Hannes Diener & Matthew Hendtlass - 2018 - Mathematical Logic Quarterly 64 (1-2):49-54.
Full Cut Elimination and Interpolation for Intuitionistic Logic with Existence Predicate.Paolo Maffezioli & Eugenio Orlandelli - 2019 - Bulletin of the Section of Logic 48 (2):137-158.
A Mechanized Proof of Higman’s Lemma by Open Induction.Christian Sternagel - 2020 - In Peter M. Schuster, Monika Seisenberger & Andreas Weiermann, Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory. Cham: Springer Verlag. pp. 339-350.
A proof of axiomatizability of łukasiewicz’s three-valued implicational propositional calculus.T. Prucnal - 1967 - Studia Logica 20 (1):144-144.
An extended joint consistency theorem for a nonconstructive logic of partial terms with definite descriptions.Raymond D. Gumb - 2001 - Studia Logica 69 (2):279-292.
Analytics
Added to PP
2009-01-28
Downloads
131 (#341,963)
6 months
13 (#938,497)
2009-01-28
Downloads
131 (#341,963)
6 months
13 (#938,497)
Historical graph of downloads
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation