A Finite Axiomatization For Fork Algebras

Logic Journal of the IGPL 5 (3):1-10 (1997)
  Copy   BIBTEX

Abstract

Proper fork algebras are algebras of binary relations over a structured set. The underlying set has changed from a set of pairs to a set closed under an injective function. In this paper we present a representation theorem for their abstract counterpart, that entails that proper fork algebras — whose underlying set is closed under an injective function — constitute a finitely based variety.1

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,752

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

A Short Proof Of Representability Of Fork Algebras.Viktor Gyuris - 1995 - Logic Journal of the IGPL 3 (5):791-796.
Equational Reasoning in Non-Classical Logics.Marcelo Frias & Ewa Orlowska - 1998 - Journal of Applied Non-Classical Logics 8 (1-2):27-66.
Fork algebraic datatypes.P. Martínez López & G. Baum - 1998 - Logic Journal of the IGPL 6 (4):531-543.
The logic of Peirce algebras.Maarten Rijke - 1995 - Journal of Logic, Language and Information 4 (3):227-250.
The logic of Peirce algebras.Maarten De Rijke - 1995 - Journal of Logic, Language and Information 4 (3):227-250.
Natural dualities for varieties of BL-algebras.Antonio Di Nola & Philippe Niederkorn - 2005 - Archive for Mathematical Logic 44 (8):995-1007.
-}$bounded Wajsberg Algebras With A U- Operator.M. Lattanzi - 2005 - Reports on Mathematical Logic:89-111.
An equational axiomatization of dynamic negation and relational composition.Marco Hollenberg - 1997 - Journal of Logic, Language and Information 6 (4):381-401.
On the independence of the axioms for fork algebras.Paulo As Veloso - 1997 - Bulletin of the Section of Logic 26 (4):197-209.

Analytics

Added to PP
2015-02-04

Downloads
14 (#986,446)

6 months
4 (#778,909)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references