A Boolean extension of a frame and a representation of discontinuity

2017 ◽  
Vol 40 (8) ◽  
pp. 1111-1125 ◽  
Author(s):  
Jorge Picado ◽  
Aleš Pultr
Keyword(s):  
2017 ◽  
Vol 160 ◽  
pp. 191-200 ◽  
Author(s):  
Hananeh Aliee ◽  
Emanuele Borgonovo ◽  
Michael Glaß ◽  
Jürgen Teich

1982 ◽  
Vol 91 (3) ◽  
pp. 375-396 ◽  
Author(s):  
A. B. Apps

If M is any algebraic structure, and R is any Boolean ring, then a structure called the (bounded) Boolean power of M by R, denoted MR, can be defined. This construction, which is also called a bounded Boolean extension, is a sort of generalized direct power, and was introduced by Foster in the 1950's (as a refinement of his previous notion of a Boolean extension). In this paper we shall study isomorphism types and automorphisms of Boolean powers of groups, and obtain information about their characteristic subgroups: we shall be chiefly concerned with Boolean powers of finite groups.


2020 ◽  
Author(s):  
Tore Fjetland Øgaard

Abstract Many relevant logics are conservatively extended by Boolean negation. Not all, however. This paper shows an acute form of non-conservativeness, namely that the Boolean-free fragment of the Boolean extension of a relevant logic need not always satisfy the variable-sharing property. In fact, it is shown that such an extension can in fact yield classical logic. For a vast range of relevant logic, however, it is shown that the variable-sharing property, restricted to the Boolean-free fragment, still holds for the Boolean extended logic.


1983 ◽  
Vol 48 (3) ◽  
pp. 841-846 ◽  
Author(s):  
J.L. Bell

The Sikorski Extension Theorem [6] states that, for any Boolean algebra A and any complete Boolean algebra B, any homomorphism of a subalgebra of A into B can be extended to the whole of A. That is,Inj: Any complete Boolean algebra is injective (in the category of Boolean algebras).The proof of Inj uses the axiom of choice (AC); thus the implication AC → Inj can be proved in Zermelo-Fraenkel set theory (ZF). On the other hand, the Boolean prime ideal theoremBPI: Every Boolean algebra contains a prime ideal (or, equivalently, an ultrafilter)may be equivalently stated as:The two element Boolean algebra 2 is injective,and so the implication Inj → BPI can be proved in ZF.In [3], Luxemburg surmises that this last implication cannot be reversed in ZF. It is the main purpose of this paper to show that this surmise is correct. We shall do this by showing that Inj implies that BPI holds in every Boolean extension of the universe of sets, and then invoking a recent result of Monro [5] to the effect that BPI does not yield this conclusion.


1980 ◽  
Vol 110 (2) ◽  
pp. 75-90
Author(s):  
J. Dukarm
Keyword(s):  

1974 ◽  
Vol 39 (1) ◽  
pp. 27-30 ◽  
Author(s):  
Keith J. Devlin

AbstractIn [2], Prikry showed that if κ is a weakly inaccessible cardinal which carries a Rowbottom filter, then there is a Boolean extension of V (the universe), having the same cardinals as V, in which cf(κ) = ω. In this note, we obtain necessary and sufficient conditions which a filter D on κ must possess in order that this may be done.


2013 ◽  
Vol 63 (1) ◽  
Author(s):  
Ján Jakubík ◽  
Judita Lihová

AbstractLet A be a lattice-ordered group, B a generalized Boolean algebra. The Boolean extension A B of A has been investigated in the literature; we will refer to A B as a generalized Specker lattice-ordered group (namely, if A is the linearly ordered group of all integers, then A B is a Specker lattice-ordered group). The paper establishes that some distributivity laws extend from A B to both A and B, and (under certain circumstances) also conversely.


Sign in / Sign up

Export Citation Format

Share Document