We observe that the known fact that the difference logic and the hybrid logic with universal modality have the same expressive power on Kripke frames can be strengthened for a far ...
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted v...