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 related classical principles
Linear extension of partial orders emerged in the late 1920's. Its computer-oriented version, \emph{...
AbstractWe introduce a new and general notion of canonical extension for algebras in the algebraic c...
This paper continues the investigation, started in Lávička and Noguera (Stud Log 105(3): 521–551, 20...
Constructive meaning is given to the assertion that every finite Booleanalgebra is an injective obje...
In their 1951-52 papers [8, 9], Jónsson and Tarski introduced the perfect extension of a Boolean al...
Abstract. Monk [1970] extended the notion of the completion of a Boolean algebra to Boolean algebras...
We look at various preservation theorems of classical logic (first of all, / Los - Tarski theorem) w...
It is well known that the classic ?o?-Tarski preservation theorem fails in the finite: there are fir...
An algebra A = 〈A;F 〉 is a distributive lattice expansion if there are terms ∧, ∨ ∈ TerA, the term ...
Canonical extensions were first studied, in the context of Boolean algebras with operators (BAOs), i...
the canonical extension Aσ and the profinite completion A ̂ of algebras A with a bounded distributiv...
AbstractThe notion of a canonical extension of a lattice with additional operations is introduced. B...
J{\'o}nsson and Tarski's notion of the perfect extension of a Boolean algebra with operators has evo...
We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean al...
We study computably enumerable boolean algebras, focusing on Stone duality and universality phenomen...
Linear extension of partial orders emerged in the late 1920's. Its computer-oriented version, \emph{...
AbstractWe introduce a new and general notion of canonical extension for algebras in the algebraic c...
This paper continues the investigation, started in Lávička and Noguera (Stud Log 105(3): 521–551, 20...
Constructive meaning is given to the assertion that every finite Booleanalgebra is an injective obje...
In their 1951-52 papers [8, 9], Jónsson and Tarski introduced the perfect extension of a Boolean al...
Abstract. Monk [1970] extended the notion of the completion of a Boolean algebra to Boolean algebras...
We look at various preservation theorems of classical logic (first of all, / Los - Tarski theorem) w...
It is well known that the classic ?o?-Tarski preservation theorem fails in the finite: there are fir...
An algebra A = 〈A;F 〉 is a distributive lattice expansion if there are terms ∧, ∨ ∈ TerA, the term ...
Canonical extensions were first studied, in the context of Boolean algebras with operators (BAOs), i...
the canonical extension Aσ and the profinite completion A ̂ of algebras A with a bounded distributiv...
AbstractThe notion of a canonical extension of a lattice with additional operations is introduced. B...
J{\'o}nsson and Tarski's notion of the perfect extension of a Boolean algebra with operators has evo...
We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean al...
We study computably enumerable boolean algebras, focusing on Stone duality and universality phenomen...
Linear extension of partial orders emerged in the late 1920's. Its computer-oriented version, \emph{...
AbstractWe introduce a new and general notion of canonical extension for algebras in the algebraic c...
This paper continues the investigation, started in Lávička and Noguera (Stud Log 105(3): 521–551, 20...