On the algebraization of a Feferman's predicate

Studia Logica 37 (3):221 - 236 (1978)
  Copy   BIBTEX

Abstract

This paper is devoted to the algebraization of an arithmetical predicate introduced by S. Feferman. To this purpose we investigate the equational class of Boolean algebras enriched with an operation (g=rtail), which translates such predicate, and an operation τ, which translates the usual predicate Theor. We deduce from the identities of this equational class some properties of (g=rtail) and some ties between (g=rtail) and τ; among these properties, let us point out a fixed-point theorem for a sufficiently large class of (g=rtail)-τ polynomials. The last part of this paper concerns the duality theory for (g=rtail)-τ algebras

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,574

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
36 (#447,497)

6 months
2 (#1,206,551)

Historical graph of downloads
How can I increase my downloads?