Complete axiomatizations for XPath fragments

Balmin, 2008, Grouping and optimization of XPath expressions in DB2® pure XML, 1065 Benedikt, 2005, Structural properties of XPath fragments, Theoretical Computer Science, 336, 3, 10.1016/j.tcs.2004.10.030 Blackburn, 2001 Blackburn, 1996, A proof system for finite trees, vol. 1092, 86 Ésik, 2004, A semiring-semimodule generalization of omega-context-free languages, vol. 3113, 68 Fine, 1975, Normal forms in modal logic, Notre Dame Journal of Formal Logic, 16, 229, 10.1305/ndjfl/1093891703 Goldblatt, 1987, Logics of Time and Computation, vol. 7 Gottlob, 2002, Monadic queries over tree-structured data, 189 Gottlob, 2005, Efficient algorithms for processing XPath queries, ACM Transactions on Database Systems, 30, 444, 10.1145/1071610.1071614 Hillenbrand, 1997, Waldmeister: High performance equational deduction, Journal of Automated Reasoning, 18, 265, 10.1023/A:1005872405899 Hirsch, 2007, Peirce algebras and boolean modules, Journal of Logic and Computation, 17, 255, 10.1093/logcom/exl037 Hollenberg, 1997, An equational axiomatization of dynamic negation and relational composition, Journal of Logic, Language and Information, 6, 381, 10.1023/A:1008271805106 Huntington, 1933, Boolean algebra. A correction, Transactions of AMS, 35, 557 Huntington, 1933, New sets of independent postulates for the algebra of logic with special reference to Whitehead and Russell's “Principia Mathematica”, Transactions of AMS, 35, 274 P. Jipsen, Computer-aided investigations of relation algebras, PhD thesis, Mathematics Department, Vanderbilt University, 1992 Kleene, 1956, Representation of events in nerve nets and finite automata, 3 Kozen, 1994, A completeness theorem for Kleene algebras and the algebra of regular events, Information and Computation, 110, 366, 10.1006/inco.1994.1037 Krishnaprasad, 2004, Query rewrite for XML in Oracle XML DB, 1134 Marx, 2004, XPath with conditional axis relations, vol. 2992 Marx, 2005, Semantic characterizations of navigational XPath, SIGMOD Rec., 34, 41, 10.1145/1083784.1083792 McCune McCune, 1997, Solution of the Robbins problem, Journal of Automated Reasoning, 19, 263, 10.1023/A:1005843212881 Moss, 2007, Finite models constructed from canonical formulas, Journal of Philosophical Logic, 36, 605, 10.1007/s10992-007-9052-4 Pratt, 1991, Dynamic algebras: Examples, constructions, applications, Studia Logica, 50, 571, 10.1007/BF00370685 Reynolds, 1992, An axiomatization for Until and Since over the reals without the IRR rule, Studia Logica, 51, 165, 10.1007/BF00370112 Tarski, 1941, On the calculus of relations, Journal of Symbolic Logic, 6, 73, 10.2307/2268577 Tarski, 1987, A Formalization of Set Theory without Variables, vol. 41 ten Cate ten Cate, 2007, The complexity of query containment in expressive fragments of XPath 2.0, 73 ten Cate, 2007, Navigational XPath: Calculus and algebra, SIGMOD Rec., 36, 19, 10.1145/1328854.1328858 ten Cate, 2009, Axiomatizing the logical core of XPath 2.0, Theory of Computing Systems, 44, 561, 10.1007/s00224-008-9151-9 van Benthem, 1996 van Benthem, 2006, Modal frame correspondence and fixed-points, Studia Logica, 83, 133, 10.1007/s11225-006-8301-9 Venema, 1993, Completeness via completeness: Since and until, vol. 229, 279 Venema, 1997, A crash course in arrow logic, 3