Fixed point algebras
A fixed point algebra (FPA) is a pair \(<B,A>\) of Boolean algebras satisfying the following properties: (1) Each \(\alpha \in B\) is a mapping from A into A; (2) Boolean operations in B are pointwise on A; (3) each constant mapping on A is an element of B; (4) each \(\alpha \in B\) has a fixed point in A. The notion of FPA arises from logic: let T be a strong enough theory, \(A_ T\) be the Lindenbaum sentence algebra of T and \(B_ T\) be the set of all mappings from \(A_ T\) into \(A_ T\) which are of the form Ā[p]\(=[Ap]\) for some extensional Ax (here [p] denotes the equivalence class of p modulo provable equivalence and extensional means that \((\vdash_ Tp\leftrightarrow q\) implies \(\vdash_ TAp\leftrightarrow Aq))\). The pair \(<A_ T,B_ T>\) is an FPA, called the Lindenbaum FPA of T. FPAs seem to be suitable for the study of self-reference; in particular, they capture the diagonalizable algebras (DAs). We recall that a DA is a pair \(<A,\tau>\) where A is a Boolean algebra and \(\tau\) is a mapping from A into A satisfying the following equations: \(\tau 1=1\); \(\tau(x\cdot y)=\tau x\cdot \tau y\); \(\tau(\tau x\to x)=\tau x\). (DAs also arise from logic: let \(A_{PA}\) be the Lindenbaum sentence algebra of Peano arithmetic PA, and let \(\tau_{PA}\) be defined by \(\tau_{PA}[P]=[\Pr_{PA}P]\); then \(<A_{PA},\tau_{PA}>\) is a DA). Now, if \(<A,\tau>\) is a DA and B is the set of all polynomials on A in one variable occurring only under the scope of \(\tau\), every element of B has a fixed point, and therefore \(<A\), \(B>\) is an FPA; FPAs of this form are said to be subdiagonalizable. The first part of the paper consists of a review of the main results on DAs, due to the logic group of Siena, to R. Solovay, to D. H. J. de Jongh, and to the author. There are some new theorems: for instance, it is proved that the universal theories of DAs and of the structure \(<A_{PA},\tau_{PA}>\) are decidable. Next finite FPAs are thoroughly investigated; a simple but interesting property of finite FPAs is the uniqueness of fixed points. A more complicated theorem states that every finite FPA satisfying some weak closure properties is subdiagonalizable; since Lindenbaum FPAs are not subdiagonalizable and do not enjoy the property of uniqueness of fixed points, finite FPAs are not suitable for the study of self-referential properties of all extensional formulas. For these reasons, the reviewer sees two problems as left open by this paper: (1) to point out some particularly interesting extensional formulas (other than the provability predicate) and to study the corresponding FPAs; (2) to study infinite FPAs. An interesting list of open problems (together with a complete bibliography on this subject) is also contained in the paper.
- A first course in group theory
- A modal calculus analogous to K4W, based on intuitionistic propositional logic, I^0
- A model of set-theory in which every set of reals is Lebesgue measurable
- An effective fixed-point theorem in intuitionistic diagonalizable algebras. (The algebraization of the theories which express Theor. IX.)
- An inside view of EXP; or, The closed fragment of the provability logic of IΔ0 + Ω1 with a prepositional constant for EXP
- Arithmetization of metamathematics in a general setting
- Calculating self-referential statements
- Calculating self-referential statements. I: Explicit calculations
- Calculating self-referential statements: Guaspari sentences of the first kind
- Commutativity and self-reference
- Fifty years of self-reference in arithmetic
- Fixed points through the finite model property. (The algebraization of the theories which express Theor; XI)
- For every n, the n-freely generated algebra is not functionally free in the equational class of diagonalizable algebras. (The algebraization of theories which express Theor. V.)
- Gödel's diagonalization technique and related properties of theories
- scientific article; zbMATH DE number 3142898 (Why is no real title available?)
- scientific article; zbMATH DE number 3652414 (Why is no real title available?)
- scientific article; zbMATH DE number 3724412 (Why is no real title available?)
- scientific article; zbMATH DE number 3760157 (Why is no real title available?)
- scientific article; zbMATH DE number 3775493 (Why is no real title available?)
- scientific article; zbMATH DE number 3455237 (Why is no real title available?)
- scientific article; zbMATH DE number 3485746 (Why is no real title available?)
- scientific article; zbMATH DE number 3539254 (Why is no real title available?)
- scientific article; zbMATH DE number 3547370 (Why is no real title available?)
- scientific article; zbMATH DE number 3552487 (Why is no real title available?)
- scientific article; zbMATH DE number 3606452 (Why is no real title available?)
- scientific article; zbMATH DE number 3628926 (Why is no real title available?)
- scientific article; zbMATH DE number 3343689 (Why is no real title available?)
- scientific article; zbMATH DE number 3365265 (Why is no real title available?)
- scientific article; zbMATH DE number 3395897 (Why is no real title available?)
- scientific article; zbMATH DE number 3422356 (Why is no real title available?)
- Intuitionistic diagonalizable algebras
- On the algebraization of a Feferman's predicate. (The algebraization of theories which express Theor; X)
- On the autological character of diagonalizable algebras
- On the equational class of diagonalizable algebras. (The algebraization of the theories which express Theor. VI.)
- operators and alternating sentences in arithmetic
- Partially Conservative Extensions of Arithmetic
- Problemi aperti sulle algebre diagonali
- Provability interpretations of modal logic
- Relative Interpretations
- Representation and duality theory for diagonalizable algebras. (The algebraization of theories which express Theor. IV.)
- Rosser sentences
- Solution of a problem of Leon Henkin
- The finite inseparability of the first-order theory of diagonalisable algebras
- The fixed-point theorem for diagonalizable algebras. (The algebraization of the theories which express Theor. III.)
- The Theory of Representation for Boolean Algebras
- The undecidability of the first-order theory of diagonalizable algebras
- The uniqueness of the fixed-point in every diagonalizable algebra. (The algebraization of the theories which express Theor. VIII.)
- Topological aspects of suitable theories
- Un'estensione del teorema di Lob
- Hyperdiagonalizable algebras
- An algebraic study of well-foundedness
- Provability: The emergence of a mathematical modality
- Algebraization of quantifier logics, an introductory overview
- A note on the fixed point for the polynomials of a Boolean algebra with an operator of endomorphism
- Canonical extensions and ultraproducts of polarities
- Varieties of complex algebras
- Equivalence relations induced by extensional formulae: classification by means of a new fixed point property
- A COMPLETENESS RESULT FOR FIXED‐POINT ALGEBRAS
- scientific article; zbMATH DE number 3914320 (Why is no real title available?)
- Iterated Extensional Rosser's Fixed Points and Hyperhyperdiagonalizable Algebras
- scientific article; zbMATH DE number 12779 (Why is no real title available?)
- scientific article; zbMATH DE number 39151 (Why is no real title available?)
- A Hopf fixed point theorem for semi-algebraic maps
- Undecidability in diagonalizable algebras
- Finite fixed point algebras are subdiagonalisable
- A note on the diagonalizable algebras of PA and ZF
- The finite inseparability of the first-order theory of diagonalisable algebras
- The Lindenbaum fixed point algebra is undecidable
This page was built for publication: Fixed point algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3333037)