Extension by Conservation. Sikorski's Theorem
Logic in Computer Science
2023-06-22 v5
Abstract
Constructive meaning is given to the assertion that every finite Boolean algebra is an injective object in the category of distributive lattices. To this end, we employ Scott's notion of entailment relation, in which context we describe Sikorski's extension theorem for finite Boolean algebras and turn it into a syntactical conservation result. As a by-product, we can facilitate proofs of several related classical principles.
Keywords
Cite
@article{arxiv.1612.07345,
title = {Extension by Conservation. Sikorski's Theorem},
author = {Davide Rinaldi and Daniel Wessel},
journal= {arXiv preprint arXiv:1612.07345},
year = {2023}
}