In this work, we study Hilbert-style proof systems for logics based on the data-aware language CoreDataXPath(↓) where the comparison relation between nodes is not necessarily an equivalence relation. We give a sound and complete axiomatization of the class of tree-like Kripke frames endowed with a general comparison relation between nodes. Modular extensions of this axiomatization are also discussed, including cases where the comparison relation is reflexive, symmetric, transitive and an equivalence. A notable highlight that we recover an axiomatization for CoreDataXPath(↓) (...) over any data-tree when the comparison is by ‘equal data’. Moreover, we prove that all these systems are decidable by leveraging the finite model property of their corresponding frame classes. (shrink)