Login / Signup

The First-Order Theory of Lexicographic Path Orderings is Undecidable.

Hubert ComonRalf Treinen
Published in: Theor. Comput. Sci. (1997)
Keyphrases
  • higher order
  • theoretical basis
  • shortest path
  • sufficient conditions
  • first order logic
  • neural network
  • computational model
  • theoretical framework
  • general theory
  • datalog programs