Some propositions equivalent to the Sikorski Extension Theorem for Boolean algebras

John Bell

doi:10.4064/fm-130-1-51-55

ScienceGate Book Chapters

JOURNAL ARTICLE

Some propositions equivalent to the Sikorski Extension Theorem for Boolean algebras

John Bell

Year: 1988 Journal: Fundamenta Mathematicae Vol: 130 (1)Pages: 51-55 Publisher: Polish Academy of Sciences

DOI: 10.4064/fm-130-1-51-55

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Stone's representation theorem for Boolean algebras Extension (predicate logic) Complete Boolean algebra Boolean algebras canonically defined Free Boolean algebra Two-element Boolean algebra Discrete mathematics Interior algebra Algebra over a field Pure mathematics Division algebra Algebra representation Computer science

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.05

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Advanced Algebra and Logic

Physical Sciences → Computer Science → Computational Theory and Mathematics

Logic, Reasoning, and Knowledge

Physical Sciences → Computer Science → Artificial Intelligence

Formal Methods in Verification

Physical Sciences → Computer Science → Computational Theory and Mathematics

Some propositions equivalent to the Sikorski Extension Theorem for Boolean algebras

Metrics

Topics

Related Documents

On the strength of the Sikorski extension theorem for Boolean algebras

THE LOOMIS–SIKORSKI THEOREM FOR -ALGEBRAS

ON AN EXTENSION THEOREM OF n-SEPARABLE BOOLEAN ALGEBRAS

On an extension theorem by Sikorski

A set-theoretical equivalent of the prime ideal theorem for Boolean algebras