#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2007

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Latifa Faouzi, William Kocay, Gérard Lopez, Hamza Si Kaddour
- Ars Comb.
- 2007

- Jan Pelant, Robert Bonnet, Latifa Faouzi, Mohamed Ben Abdellah, Jan Kochanowski
- 2008

Given a partially ordered set P there exists the most general Boolean algebra F̂ (P ) which contains P as a generating set, called the free Boolean algebra over P . We study free Boolean algebras over posets of the form P = P0 ∪ P1, where P0, P1 are well orderings. We call them nearly ordinal algebras. Answering a question of Maurice Pouzet, we show that… (More)

- Mustapha Alami, Mohamed Bekkali, Latifa Faouzi, Driss Zhani
- Annals of Mathematics and Artificial Intelligence
- 2007

In Free poset Boolean algebra F(P ), uniqueness of normal form of non-zero elements is proved and the notion of support of a non-zero element is, therefore, well defined. An Inclusion–Exclusion-like formula is given by defining, for each non-zero element x, $\overline{\mu}(x)$ using support of x ∈F(P ) in a very natural way.

- Latifa Faouzi
- Contributions to Discrete Mathematics
- 2007

Assuming Martin’s Axiom and א1 < 2 א0 , we show that, for any κ, λ < 20 and any almost disjoint family {ai : i < λ} of countable subsets of κ, there is a partition {pn : n ∈ ω} of κ so that pn ∩ ai is finite for each 〈i, n〉 ∈ λ × ω.

- ‹
- 1
- ›