- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The finite inseparability of the first-order theory of diagonalisable algebras
Studia Logica 41 (4):347 - 349 (1982)
Abstract
In a recent paper, Montagna proved the undecidability of the first-order theory of diagonalisable algebras. This result is here refined — the set of finitely refutable sentences is shown effectively inseparable from the set of theorems. The proof is quite simple.My notes
Similar books and articles
Finite algebras of relations are representable on finite sets.H. Andréka, I. Hodkinson & I. Németi - 1999 - Journal of Symbolic Logic 64 (1):243-267.
Symmetrical Heyting algebras with a finite order type of operators.Luisa Iturrioz - 1995 - Studia Logica 55 (1):89 - 98.
Nonfinite axiomatizability results for cylindric and relation algebras.Roger D. Maddux - 1989 - Journal of Symbolic Logic 54 (3):951-974.
The logic of Peirce algebras.Maarten De Rijke - 1995 - Journal of Logic, Language and Information 4 (3):227-250.
The undecidability of the first-order theory of diagonalizable algebras.Franco Montagna - 1980 - Studia Logica 39 (4):355 - 359.
Decidability problem for finite Heyting algebras.Katarzyna Idziak & Pawel M. Idziak - 1988 - Journal of Symbolic Logic 53 (3):729-735.
The number of one-generated cylindric set algebras of dimension greater than two.Jean A. Larson - 1985 - Journal of Symbolic Logic 50 (1):59-71.
Weakly higher order cylindric algebras and finite axiomatization of the representables.I. Németi & A. Simon - 2009 - Studia Logica 91 (1):53 - 62.
Decidability of cylindric set algebras of dimension two and first-order logic with two variables.Maarten Marx & Szabolcs Mikulás - 1999 - Journal of Symbolic Logic 64 (4):1563-1572.
Analytics
Added to PP
2009-01-28
Downloads
30 (#517,657)
6 months
5 (#652,053)
2009-01-28
Downloads
30 (#517,657)
6 months
5 (#652,053)
Historical graph of downloads
Citations of this work
Undecidability in diagonalizable algebras.V. Yu Shavrukov - 1997 - Journal of Symbolic Logic 62 (1):79-116.
The lindenbaum fixed point algebra is undecidable.V. Yu Shavrukov - 1991 - Studia Logica 50 (1):143-147.
Franco Montagna’s Work on Provability Logic and Many-valued Logic.Lev Beklemishev & Tommaso Flaminio - 2016 - Studia Logica 104 (1):1-46.
References found in this work
Representation and duality theory for diagonalizable algebras.Roberto Magari - 1975 - Studia Logica 34 (4):305 - 313.
The fixed-point theorem for diagonalizable algebras.Claudio Bernardi - 1975 - Studia Logica 34 (3):239 - 251.
Sentences true in all constructive models.R. L. Vaught - 1960 - Journal of Symbolic Logic 25 (1):39-53.
The undecidability of the first-order theory of diagonalizable algebras.Franco Montagna - 1980 - Studia Logica 39 (4):355 - 359.
Review: Abraham Robinson, Complete Theories. [REVIEW]Robert L. Vaught - 1960 - Journal of Symbolic Logic 25 (2):172-174.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-5tf24 uwo