First-order Axiomatisations of Representable Relation Algebras Need Formulas of Unbounded Quantifier depth.
Rob EgrotRobin HirschPublished in: J. Symb. Log. (2022)
Keyphrases
- quantifier elimination
- quantifier free
- horn clauses
- first order logic
- constraint propagation
- predicate calculus
- relation algebra
- real numbers
- action theories
- higher order
- depth information
- functional programming
- depth map
- depth images
- logical formulas
- binary relations
- cardinality constraints
- temporal reasoning
- predicate logic
- neural network
- spatial reasoning
- situation calculus
- distributive lattices