Latifa Faouzi

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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)
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.
  • 1