Possibility theory offers a general framework for dealing with default rules of the form "generally, if p, then q" which are modelled by constraints expressing that having p and q true is strictly more possible than having p and not q true. Then possibilistic logic offers an inference machinery for default reasoning which obeys classical postulates for nonmonotonic reasoning including rational ...

1.1. The Iwasawa-Greenberg Main Conjecture. Let p be an odd prime. Let Q ⊂ C be the algebraic closure of Q in C. We fix an embedding Q ↪→ Qp. For simplicity we also fix an isomorphism Qp ∼= C compatible with the inclusion of Q into both. We let Q∞ be the cyclotomic Zp-extension of Q and ΓQ := Gal(Q∞/Q) its Galois group. The reciprocity map of class field theory identifies 1 + pZp with ΓQ; we le...

We introduce a new kind of causality between events of a distributed system that takes the nature of the events into account. More precisely, we distinguish between read (receive) and write (send) operations, yielding a relation called . We clarify the intuition of our causality relation through examples, and we compare it with classical models of causality. Also, we show that it is better suit...