Undecidability in diagonalizable algebras
A \textit{diagonalizable algebra} \(\mathfrak D\) is a Boolean algebra \(\mathfrak A\) with an operator \(\square\) satisfying the identities: \(\square (\alpha\rightarrow\beta)\leq\square\alpha\rightarrow\square\beta\), \(\square\alpha\leq\square\square\alpha\), \(\square(\square\alpha\rightarrow\alpha)=\square\alpha\), and \(\square 1=1\) where 1 is the unit of \(\mathfrak A\). The reader should think of the \textit{Lindenbaum sentence algebra} \(\mathfrak A_T\) of a first order theory \(T\) where the operator \(\square_T\) takes a sentence \(\varphi\) to \(Pr_T(\lceil\varphi\rceil)\), assuming \(T\) has a provability predicate. The listed identities correspond to \textit{Löb's Derivability Conditions}. The author studies the first order theories Th\(\mathfrak D_T\) and gives two proofs of the undecidability of Th\(\mathfrak D_T\) for various \(T\)'s. First he proves that if \(T\) is \(\Sigma_1\)-sound then Th\(\mathfrak D_T\) is non-arithmetic. His second proof just yields undecidability, but it applies to a broader class of \(T\)'s and provides sharper upper bounds on undecidable quantifier alternations.
- A generalized notion of weak interpretability and the corresponding modal logic
- A note on the diagonalizable algebras of PA and ZF
- FINITENESS OF $ E(\mathbf{Q})$ AND $ \textrm{Ø}(E,\mathbf{Q})$ FOR A SUBCLASS OF WEIL CURVES
- Fixed point algebras
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 227056 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- Interpretations of the first-order theory of diagonalizable algebras in Peano arithmetic
- Minimal elements of \(\text{И}(H;p)\) and conjugacy of Levi complements in finite Chevalley groups.
- On bimodal logics of provability
- On propositional quantifiers in provability logic
- On the proofs of arithmetical completeness for interpretability logic
- Provability interpretations of modal logic
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Representation and duality theory for diagonalizable algebras. (The algebraization of theories which express Theor. IV.)
- Self-reference and modal logic
- Shavrukov's theorem on the subalgebras of diagonalizable algebras for theories containing \(I\Delta_ 0 + \exp\)
- The finite inseparability of the first-order theory of diagonalisable algebras
- The interpretability logic of Peano arithmetic
- The logic of linear tolerance
- The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic
- The undecidability of the first-order theory of diagonalizable algebras
- Universality of Tag Systems with P = 2
- Decision problems for classes of diagonalizable algebras
- Hyperdiagonalizable algebras
- Undecidability of relatively free Hilbert algebras
- Diophantine undecidability of \({\mathbb{C}{}}(t_ 1,t_ 2)\)
- On the autological character of diagonalizable algebras
- On a strengthening of the non-isomorphism theorem for provability algebras
- Effectively inseparable Boolean algebras in lattices of sentences
- Undecidable theories of Lyndon algebras
- Linear \(\mathrm{GLP}\)-algebras and their elementary theories
- Franco Montagna's work on provability logic and many-valued logic
- scientific article; zbMATH DE number 3882425 (Why is no real title available?)
- scientific article; zbMATH DE number 3928996 (Why is no real title available?)
- Iterated Extensional Rosser's Fixed Points and Hyperhyperdiagonalizable Algebras
- scientific article; zbMATH DE number 733218 (Why is no real title available?)
- scientific article; zbMATH DE number 219032 (Why is no real title available?)
- Fixed points and unfounded chains
- ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS
- A note on the diagonalizable algebras of PA and ZF
- The finite inseparability of the first-order theory of diagonalisable algebras
This page was built for publication: Undecidability in diagonalizable algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4338316)
