Decidable Boolean algebras of low level

Annals of Pure and Applied Logic 94 (1-3):75-95 (1998)
  Copy   BIBTEX

Abstract

We will study the question about decidability for Boolean algebras with first elementary characteristic one. The main problem is sufficient conditions for decidability of Boolean algebras with recursive representation for extended signature by definable predicates. We will use the base definitions on recursive and constructive models from [2, 4–6, 10, 11] but on Boolean algebras from [1, 8]

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(97)00068-7

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 96,689

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: Sergei S. Goncharov, Countable Boolean Algebras and Decidability. [REVIEW]Valentina Harizanov - 1998 - Journal of Symbolic Logic 63 (3):1188-1190.
Semi-Cohen Boolean algebras.Bohuslav Balcar, Thomas Jech & Jindřich Zapletal - 1997 - Annals of Pure and Applied Logic 87 (3):187-208.
Inseparability in recursive copies.Kevin J. Davey - 1994 - Annals of Pure and Applied Logic 68 (1):1-52.
A construction of Boolean algebras from first-order structures.Sabine Koppelberg - 1993 - Annals of Pure and Applied Logic 59 (3):239-256.
Decidability of topological quasi-Boolean algebras.Yiheng Wang, Zhe Lin & Minghui Ma - 2024 - Journal of Applied Non-Classical Logics 34 (2):269-293.
Weak elimination of imaginaries for Boolean algebras.Roman Wencel - 2005 - Annals of Pure and Applied Logic 132 (2-3):247-270.
Recursive and r.e. quotient Boolean algebras.John J. Thurber - 1994 - Archive for Mathematical Logic 33 (2):121-129.
Δ20-categoricity in Boolean algebras and linear orderings.Charles F. D. McCoy - 2003 - Annals of Pure and Applied Logic 119 (1-3):85-120.
Decidability problem for finite Heyting algebras.Katarzyna Idziak & Pawel M. Idziak - 1988 - Journal of Symbolic Logic 53 (3):729-735.

Analytics

Added to PP
2014-01-16

Downloads
40 (#447,672)

6 months
4 (#1,515,946)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Recursive isomorphism types of recursive Boolean algebras.J. B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):572-594.
Hiearchies of Boolean algebras.Lawrence Feiner - 1970 - Journal of Symbolic Logic 35 (3):365-374.
Recursive Boolean algebras with recursive atoms.Jeffrey B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):595-616.
Every recursive boolean algebra is isomorphic to one with incomplete atoms.Rod Downey - 1993 - Annals of Pure and Applied Logic 60 (3):193-206.
Constructive Models.I͡Uriĭ Leonidovich Ershov - 2000 - Consultants Bureau. Edited by S. S. Goncharov.

Add more references