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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,881

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

Some Boolean Algebras with Finitely Many Distinguished Ideals I.Regina Aragón - 1995 - Mathematical Logic Quarterly 41 (4):485-504.
Decidability problem for finite Heyting algebras.Katarzyna Idziak & Pawel M. Idziak - 1988 - Journal of Symbolic Logic 53 (3):729-735.
The theory of Boolean algebras with an additional binary operation.Bronis?aw Tembrowski - 1983 - Studia Logica 42 (4):389 - 405.
Boolean deductive systems of BL-algebras.Esko Turunen - 2001 - Archive for Mathematical Logic 40 (6):467-473.
Countably-categorical Boolean algebras with distinguished ideals.D. E. Pal'chunov - 1987 - Studia Logica 46 (2):121 - 135.
Hyper-Archimedean BL-algebras are MV-algebras.Esko Turunen - 2007 - Mathematical Logic Quarterly 53 (2):170-175.
Free Algebras in Varieties of Glivenko MTL-Algebras Satisfying the Equation 2(x²) = (2x)².Roberto Cignoli & Antoni Torrens Torrell - 2006 - Studia Logica 83 (1-3):157 - 181.
More constructions for Boolean algebras.Saharon Shelah - 2002 - Archive for Mathematical Logic 41 (5):401-441.
Partial Boolean algebras in a broader sense.Janusz Czelakowski - 1979 - Studia Logica 38 (1):1 - 16.
Boolean algebras in ast.Klaus Schumacher - 1992 - Mathematical Logic Quarterly 38 (1):373-382.
The number of openly generated Boolean algebras.Stefan Geschke & Saharon Shelah - 2008 - Journal of Symbolic Logic 73 (1):151-164.
Plain semi-post algebras as a poset-based generalization of post algebras and their representability.Nguyen Cat Ho & Helena Rasiowa - 1989 - Studia Logica 48 (4):509 - 530.
An algebraic study of well-foundedness.Robert Goldblatt - 1985 - Studia Logica 44 (4):423 - 437.

Analytics

Added to PP
2014-01-16

Downloads
37 (#431,226)

6 months
1 (#1,471,540)

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