Model abstraction for finite state automata is helpful for decreasing computational complexity and improving comprehensibility for the verification and control synthesis of discrete-event systems (DES ...

We improve a result of Hjorth concerning the nature of thin analytic equivalence relations. The key lemma uses a weakly compact cardinal to construct certain nonstandard models, which Hjorth obtained ...

The study of computable structures and equivalence relations lies at the intersection of computability theory, algebra and logic, and provides essential insights into the classification and decision ...