0

Does anyone have any good examples or know where I could find examples of transforming simple structures from graph theory into predicate logic?

  • what do mean with "transforming"? – russoo Jan 21 '15 at 16:30
  • encoding e.g if you were talking about points and lines, in logical terms it would be something like {p^1, L^1 , lO^2} where p is a point, L a line and Lo meaning lies on –  Jan 21 '15 at 16:36
  • Yes. If $R$ is a binary relation symbol of your logical language, you can interpret the formula $xRy$ as: the nodes $x$ and $y$ of a given graph are connected via an edge of the graph. In order to fully understand how formal logic can be used to formalize statements about mathematical objects like graphs, you should study an introductory textbook about mathematical logic. – russoo Jan 21 '15 at 16:46
  • ok, are there any examples of this sort of thing out there? I just need to practise. –  Jan 21 '15 at 16:51

1 Answers1

1

For graphs, you can see :