Boolean algebras of elementary characteristic (1, 0, 1) with computable set of atoms and computable ideal of atomic elements

We prove that for a computable Boolean algebra of elementary characteristic (1, 0, 1) with computable set of atoms and computable ideal of atomic elements there is a strongly computable isomorphic copy of it. The result is generalized to Boolean algebras of elementary characteristic ( n , 0, 1). Bib...

Full description

Saved in:
Bibliographic Details
Published in:Journal of mathematical sciences (New York, N.Y.) N.Y.), 2012-10, Vol.186 (3), p.461-465
Main Author: Leont’eva, M. N.
Format: Article
Language:English
Subjects:
Algebra
Analysis
Mathematics
Mathematics and Statistics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We prove that for a computable Boolean algebra of elementary characteristic (1, 0, 1) with computable set of atoms and computable ideal of atomic elements there is a strongly computable isomorphic copy of it. The result is generalized to Boolean algebras of elementary characteristic ( n , 0, 1). Bibliography: 7 titles.
ISSN:1072-3374
1573-8795
DOI:10.1007/s10958-012-1000-3