On a problem of Sikorski in the set representability of Boolean algebras

Robert LaGrange

doi:10.4064/cm-30-2-213-218

ScienceGate Book Chapters

JOURNAL ARTICLE

On a problem of Sikorski in the set representability of Boolean algebras

Robert LaGrange

Year: 1974 Journal: Colloquium Mathematicum Vol: 30 (2)Pages: 213-218 Publisher: Polish Academy of Sciences

DOI: 10.4064/cm-30-2-213-218

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Stone's representation theorem for Boolean algebras Free Boolean algebra Complete Boolean algebra Two-element Boolean algebra Boolean algebras canonically defined Set (abstract data type) Boolean algebra Discrete mathematics Algebra over a field Pure mathematics Computer science Algebra representation

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.06

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Advanced Algebra and Logic

Physical Sciences → Computer Science → Computational Theory and Mathematics

Rough Sets and Fuzzy Logic

Physical Sciences → Computer Science → Computational Theory and Mathematics

On a problem of Sikorski in the set representability of Boolean algebras

Metrics

Topics

Related Documents

On partitioner-representability of Boolean algebras

On the strength of the Sikorski extension theorem for Boolean algebras

Some propositions equivalent to the Sikorski Extension Theorem for Boolean algebras

Hopf–Sikorski algebras

Efimovʼs problem and Boolean algebras