In common natural languages, there are two interpretations of the word "or".
Can you construct a formal logic based on the excluding notion of "or", such that from a contradictory ($A$ and $\mathbb{not}(A)$ is true simultaneously) it doesn't follow, that all formulas are true?
That logic doesn't have to be very strong, but should still look like something which can be used to compute intuitive conclusion rules from some axioms.