Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  Boolean algebras
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Cellularity of free products of Boolean algebras (or topologies)

100%
Shelah S.
Fundamenta Mathematicae
|
2000
|
tom 166
|
nr 1-2
153-208
EN
The aim this paper is to present an answer to Problem 1 of Monk [10], [11]. We do this by proving in particular that if μ is a strong limit singular cardinal, $θ = (2^{cf(μ)})^+$ and $2^μ = μ^+$ then there are Boolean algebras $\mathbb{B}_1,\mathbb{B}_2$ such that $c(\mathbb{B}_1) = μ, c(\mathbb{B}_2) < θ but c(\mathbb{B}_1*\mathbb{B}_2)=μ^+$. Further we improve this result, deal with the method and the necessity of the assumptions. In particular we prove that if $\mathbb{B}$ is a ccc Boolean algebra and $μ^{ℶ_ω} ≤ λ = cf(λ) ≤ 2^μ$ then $\mathbb{B}$ satisfies the λ-Knaster condition (using the "revised GCH theorem").
2
Content available remote

Generalized co-annihilator of BL-algebras

100%
Meng B. L., Xin X. L.
Open Mathematics
|
2015
|
tom 13
|
nr 1
EN
In BL-algebras we introduce the concept of generalized co-annihilators as a generalization of coannihilator and the set of the form x-1F where F is a filter, and study basic properties of generalized co-annihilators. We also introduce the notion of involutory filters relative to a filter F and prove that the set of all involutory filters relative to a filter with respect to the suit operations is a complete Boolean lattice and BL-algebra. We use the technology of generalized co-annihilators to give characterizations of prime filters and minimal prime filters, respectively. In particular, we give a representation of co-annihilators in the quotient algebra of a BL-algebra L via a filter F by means of generalized co-annihilators relative to F in L:
3
Content available remote

The isomorphism relation between tree-automatic Structures

84%
Finkel O., Todorčević S.
Open Mathematics
|
2010
|
tom 8
|
nr 2
299-313
EN
An ω-tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism problem for ω-tree-automatic structures. We prove first that the isomorphism relation for ω-tree-automatic boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups, nilpotent groups of class n ≥ 2) is not determined by the axiomatic system ZFC. Then we prove that the isomorphism problem for ω-tree-automatic boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups, nilpotent groups of class n ≥ 2) is neither a Σ21-set nor a Π21-set.
4
Content available remote

On what I do not understand (and have something to say): Part I

67%
Shelah S.
Fundamenta Mathematicae
|
2000
|
tom 166
|
nr 1-2
1-82
EN
This is a non-standard paper, containing some problems in set theory I have in various degrees been interested in. Sometimes with a discussion on what I have to say; sometimes, of what makes them interesting to me, sometimes the problems are presented with a discussion of how I have tried to solve them, and sometimes with failed tries, anecdotes and opinions. So the discussion is quite personal, in other words, egocentric and somewhat accidental. As we discuss many problems, history and side references are erratic, usually kept to a minimum ("see ..." means: see the references there and possibly the paper itself). The base were lectures in Rutgers, Fall '97, and reflect my knowledge then. The other half, [122], concentrating on model theory, will subsequently appear. I thank Andreas Blass and Andrzej Rosłanowski for many helpful comments.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.