An algebraic study of well-foundedness

Studia Logica 44 (4):423 - 437 (1985)
  Copy   BIBTEX

Abstract

A foundational algebra ( , f, ) consists of a hemimorphism f on a Boolean algebra with a greatest solution to the condition f(x). The quasi-variety of foundational algebras has a decidable equational theory, and generates the same variety as the complex algebras of structures (X, R), where f is given by R-images and is the non-wellfounded part of binary relation R.The corresponding results hold for algebras satisfying =0, with respect to complex algebras of wellfounded binary relations. These algebras, however, generate the variety of all ( ,f) with f a hemimorphism on ).

Links

PhilArchive



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

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
39 (#398,894)

6 months
10 (#251,846)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Power of a Propositional Constant.Robert Goldblatt & Tomasz Kowalski - 2014 - Journal of Philosophical Logic 43 (1):133-152.
The Power of a Propositional Constant.Robert Goldblatt & Tomasz Kowalski - 2012 - Journal of Philosophical Logic (1):1-20.
A Computational Learning Semantics for Inductive Empirical Knowledge.Kevin T. Kelly - 2014 - In Alexandru Baltag & Sonja Smets (eds.), Johan van Benthem on Logic and Information Dynamics. Springer International Publishing. pp. 289-337.
Johan van Benthem on Logic and Information Dynamics.Alexandru Baltag & Sonja Smets (eds.) - 2014 - Cham, Switzerland: Springer International Publishing.

View all 6 citations / Add more citations

References found in this work

Algebraic semantics for modal logics I.E. J. Lemmon - 1966 - Journal of Symbolic Logic 31 (1):46-65.
Algebraic semantics for modal logics II.E. J. Lemmon - 1966 - Journal of Symbolic Logic 31 (2):191-218.

Add more references