Under consideration for publication in Math. Struct. in Comp. Science General Conditions for Full Abstraction

Full abstraction, i.e. that a function preserves equivalence from source to target, has been used extensively as a correctness criterion for mappings between models of computation. I here show that with fixed equivalences, fully abstract functions almost always exist. Also, with the function and one of the equivalences fixed the other equivalence can almost always be found. 1