A note on the diagonalizable algebras of PA and ZF

DOI10.1016/0168-0072(93)90202-OzbMath0780.03027OpenAlexW1985542534MaRDI QIDQ685077

V. Yu. Shavrukov

Publication date: 22 September 1993

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(93)90202-o

zbMATH Keywords

diagonalizable algebracomplexity measureLindenbaum sentence algebraPAprovability predicateprovably recursive functionsZF

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Other algebras related to logic (03G25) Gödel numberings and issues of incompleteness (03F40)

Related Items (5)

Topological structure of diagonalizable algebras and corresponding logical properties of theories ⋮ ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS ⋮ Undecidability in diagonalizable algebras ⋮ On a strengthening of the non-isomorphism theorem for provability algebras ⋮ Interpretability over peano arithmetic

Cites Work

• Self-reference and modal logic
• Fixed point algebras
• Calculating self-referential statements
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Deduction-preserving "Recursive Isomorphisms" between theories
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the diagonalizable algebras of PA and ZF