Anshakov-Rychkov Algebras

Notre Dame Journal of Formal Logic 42 (4):211-224 (2001)
  Copy   BIBTEX

Abstract

The aim of this paper is to show that the calculi described by Anshakov and Rychkov are algebraizable in the sense of Blok and Pigozzi. As a consequence, a proof of the strong completeness of these calculi is obtained

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1063372243

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,854

External links

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

Through your library

My notes

Similar books and articles

On Finite-Valued Propositional Logical Calculi.O. Anshakov & S. Rychkov - 1995 - Notre Dame Journal of Formal Logic 36 (4):606-629.
On the Algebraizability of the Implicational Fragment of Abelian Logic.Sam Butchart & Susan Rogerson - 2014 - Studia Logica 102 (5):981-1001.
Calculi for Many-Valued Logics.Michael Kaminski & Nissim Francez - 2021 - Logica Universalis 15 (2):193-226.
Implicit connectives of algebraizable logics.Xavier Caicedo - 2004 - Studia Logica 78 (1-2):155 - 170.
A strong completeness theorem for $3$-valued logic. [REVIEW]H. Goldberg, H. Leblanc & G. Weaver - 1974 - Notre Dame Journal of Formal Logic 15 (2):325-330.
Equivalential and algebraizable logics.Burghard Herrmann - 1996 - Studia Logica 57 (2-3):419 - 436.
A note concerning the many-valued propositional calculi.Bolesław Sobociński - 1961 - Notre Dame Journal of Formal Logic 2 (2):127-128.
Categorical Abstract Algebraic Logic: Models of π-Institutions.George Voutsadakis - 2005 - Notre Dame Journal of Formal Logic 46 (4):439-460.
A simple proof of functional completeness in many-valued logics based on Ł ukasiewicz's $C$ and $N$.Robert E. Clay - 1962 - Notre Dame Journal of Formal Logic 3 (2):114-117.
A strong completeness theorem for 3-valued logic. Part II.Hugues Leblanc - 1977 - Notre Dame Journal of Formal Logic 18:107.

Analytics

Added to PP
2010-08-24

Downloads
47 (#474,327)

6 months
10 (#430,153)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

On Finite-Valued Propositional Logical Calculi.O. Anshakov & S. Rychkov - 1995 - Notre Dame Journal of Formal Logic 36 (4):606-629.

Add more references