Abstract
It is shown that the theories of the following classes become undecidable in stationary logic: Well orderings with one unary predicate, linear orderings, and Boolean algebras. This is done by interpreting the theory of symmetric reflexive graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have