Δ20-categoricity in Boolean algebras and linear orderings

Annals of Pure and Applied Logic 119 (1-3):85-120 (2003)
  Copy   BIBTEX

Abstract

We characterize Δ20-categoricity in Boolean algebras and linear orderings under some extra effectiveness conditions. We begin with a study of the relativized notion in these structures

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(02)00035-0

Links

PhilArchive



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

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

< i> Δ_< sub> 2< sup> 0-categoricity in Boolean algebras and linear orderings.Charles F. D. McCoy - 2003 - Annals of Pure and Applied Logic 119 (1-3):85-120.
Elementary embedding between countable Boolean algebras.Robert Bonnet & Matatyahu Rubin - 1991 - Journal of Symbolic Logic 56 (4):1212-1229.
Some Boolean Algebras with Finitely Many Distinguished Ideals I.Regina Aragón - 1995 - Mathematical Logic Quarterly 41 (4):485-504.
The metamathematics of scattered linear orderings.P. Clote - 1989 - Archive for Mathematical Logic 29 (1):9-20.
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.
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.
A recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
Boolean algebras in ast.Klaus Schumacher - 1992 - Mathematical Logic Quarterly 38 (1):373-382.
Definable sets in Boolean-ordered o-minimal structures. I.Ludomir Newelski & Roman Wencel - 2001 - Journal of Symbolic Logic 66 (4):1821-1836.
The number of openly generated Boolean algebras.Stefan Geschke & Saharon Shelah - 2008 - Journal of Symbolic Logic 73 (1):151-164.

Analytics

Added to PP
2014-01-16

Downloads
18 (#814,090)

6 months
5 (#638,139)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On Δ 2 0 -categoricity of equivalence relations.Rod Downey, Alexander G. Melnikov & Keng Meng Ng - 2015 - Annals of Pure and Applied Logic 166 (9):851-880.
Abelian p-groups and the Halting problem.Rodney Downey, Alexander G. Melnikov & Keng Meng Ng - 2016 - Annals of Pure and Applied Logic 167 (11):1123-1138.

View all 9 citations / Add more citations

References found in this work

Generic copies of countable structures.Chris Ash, Julia Knight, Mark Manasse & Theodore Slaman - 1989 - Annals of Pure and Applied Logic 42 (3):195-205.
Recursive isomorphism types of recursive Boolean algebras.J. B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):572-594.
Effective model theory vs. recursive model theory.John Chisholm - 1990 - Journal of Symbolic Logic 55 (3):1168-1191.
Computability theory and linear orders.Rod Downey - 1998 - In I͡Uriĭ Leonidovich Ershov (ed.), Handbook of Recursive Mathematics. Elsevier. pp. 138--823.
Recursive linear orders with recursive successivities.Michael Moses - 1984 - Annals of Pure and Applied Logic 27 (3):253-264.

Add more references