Defining Recursive Predicates in Graph Orders
We study the first order theory of structures over graphs i.e. structures of the form ($\mathcal{G},\tau$) where $\mathcal{G}$ is the set of all (isomorphism types of) finite undirected graphs and $\tau$ some vocabulary. We define the notion of a recursive predicate over graphs using Turing Machine...
| 1. Verfasser: | |
|---|---|
| Format: | Artikel |
| Sprache: | English |
| Veröffentlicht: |
Logical Methods in Computer Science e.V.
2018-09-01
|
| Schriftenreihe: | Logical Methods in Computer Science |
| Schlagworte: | |
| Online Zugang: | https://lmcs.episciences.org/3923/pdf |