The finite inseparability of the first-order theory of diagonalisable algebras (Q795036): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Representation and duality theory for diagonalizable algebras. (The algebraization of theories which express Theor. IV.) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The undecidability of the first-order theory of diagonalizable algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4068699 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fixed point algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Provability interpretations of modal logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sentences true in all constructive models / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00403334 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2048339526 / rank | |||
Normal rank |
Latest revision as of 09:31, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The finite inseparability of the first-order theory of diagonalisable algebras |
scientific article |
Statements
The finite inseparability of the first-order theory of diagonalisable algebras (English)
0 references
1982
0 references
In this paper, the author proves the finite inseparability of the first order theory of diagonalizable algebras (shortly: DAs). DAs constitute the algebraic analogue of the modal logic of provability, and can be considered as an algebraic approach to the study of the provability predicate for Peano Arithmetic or related theories. Smoryński's proof uses a result of \textit{Yu. L. Ershov} and \textit{M. A. Taj'tslin}, who proved the finite inseparability of the theory of distributive lattices [Algebra Logika, Sem. 2, No.5, 37-41 (1963; Zbl 0192.056)]. The undecidability of the first order theory of diagonalizable algebras was proved by the reviewer by direct means [Stud. Logica 39, 355-359 (1980; Zbl 0463.03016)]. Of course, Smoryński's result is stronger (it implies the undecidability of the first order theory of finite DAs); however, it does not solve the problem of the decidability or undecidability of the Lindenbaum DA of Peano Arithmetic.
0 references
finite inseparability
0 references
first order theory of diagonalizable algebras
0 references
modal logic of provability
0 references
provability predicate for Peano Arithmetic
0 references