zbMATH — the first resource for mathematics

General conditions for full abstraction. (English) Zbl 1361.68085
Summary: Full abstraction, i.e. that a function preserves equivalence from a source to a 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.

68Q05 Models of computation (Turing machines, etc.) (MSC2010)
Full Text: DOI
[1] DOI: 10.1007/978-3-540-68679-8_29 · Zbl 1143.68470
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.