Rinaldi, Davide and Wessel, Daniel - Extension by Conservation. Sikorski's Theorem

lmcs:2611 - Logical Methods in Computer Science, October 30, 2018, Volume 14, Issue 4
Extension by Conservation. Sikorski's Theorem

Authors: Rinaldi, Davide and Wessel, Daniel

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.


Source : oai:arXiv.org:1612.07345
DOI : 10.23638/LMCS-14(4:8)2018
Volume: Volume 14, Issue 4
Published on: October 30, 2018
Submitted on: December 23, 2016
Keywords: Computer Science - Logic in Computer Science


Share

Consultation statistics

This page has been seen 17 times.
This article's PDF has been downloaded 9 times.