The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes
most navigational features of XPath 2.0 (complex counting conditions and data joins are not supported, as they lead to undecidability).
The second aim is to provide a list of equations completely axiomatizing query equivalence in this language (i.e., all other
query equivalences can be derived from these).

Disclaimer/Complaints regulations

If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let
the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible
and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands.
You will be contacted as soon as possible.