On the equational class of diagonalizable algebras

Studia Logica 34 (4):321 - 331 (1975)
  Copy   BIBTEX

Abstract

It is well-known that, in Peano arithmetic, there exists a formula Theor (x) which numerates the set of theorems and that this formula satisfies Hilbert-Bernays derivability conditions. Recently R. Magari has suggested an algebraization of the properties of Theor, introducing the concept of diagonalizable algebra (see [7]): of course this algebraization can be applied to all these theories in which there exists a predicate with analogous properties. In this paper, by means of methods of universal algebra, we study the equational class of diagonalizable algebras, proving, among other things, that the set of identities satisfied by Theor which are consequences of the known ones is decidable

Other Versions

No versions found

Links

PhilArchive



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

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
38 (#592,348)

6 months
14 (#227,991)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Introduction to mathematical logic.Elliott Mendelson - 1964 - Princeton, N.J.,: Van Nostrand.
Solution of a problem of Leon Henkin.M. H. Löb - 1955 - Journal of Symbolic Logic 20 (2):115-118.
Universal Algebra.George Grätzer - 1982 - Studia Logica 41 (4):430-431.

Add more references