On Finite-Valued Propositional Logical Calculi

Notre Dame Journal of Formal Logic 36 (4):606-629 (1995)
  Copy   BIBTEX

Abstract

In this paper we describe, in a purely algebraic language, truth-complete finite-valued propositional logical calculi extending the classical Boolean calculus. We also give a new proof of the Completeness Theorem for such calculi. We investigate the quasi-varieties of algebras playing an analogous role in the theory of these finite-valued logics to the role played by the variety of Boolean algebras in classical logic

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

External links

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

Through your library

Similar books and articles

Axiom schemes for m-valued propositional calculi.J. B. Rosser & A. R. Turquette - 1945 - Journal of Symbolic Logic 10 (3):61-82.
A note concerning the many-valued propositional calculi.Bolesław Sobociński - 1961 - Notre Dame Journal of Formal Logic 2 (2):127-128.
Finiteness in infinite-valued łukasiewicz logic.Stefano Aguzzoli & Agata Ciabattoni - 2000 - Journal of Logic, Language and Information 9 (1):5-29.

Analytics

Added to PP
2010-08-24

Downloads
19 (#679,913)

6 months
1 (#1,028,709)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Non-transitive Correspondence Analysis.Yaroslav Petrukhin & Vasily Shangin - 2023 - Journal of Logic, Language and Information 32 (2):247-273.
Four-Valued Logics BD and DM4: Expansions.Alexander S. Karpenko - 2017 - Bulletin of the Section of Logic 46 (1/2).
Anshakov-Rychkov Algebras.Olga Ambas - 2001 - Notre Dame Journal of Formal Logic 42 (4):211-224.

Add more citations