Name
Abstract | ||
|---|---|---|
It will be shown thatn-separated graphs are model-interpretable into trees, in particular this holds for unary function graphs. Hence metamathematical results for trees carry over to more general graphs. We show that trees are stable in some infinite cardinality, hencen-separated graphs are stable, in particular this holds for unary functions. This generalizes results in [4]. Other examples concern decidability and the finite valency satisfiability property. |
Year | DOI | Venue |
|---|---|---|
1975 | 10.1007/BF02276797 | Arch. Math. Log. |
Keywords | Field | DocType |
satisfiability | Interpretability,Discrete mathematics,Indifference graph,Combinatorics,Unary operation,Satisfiability,Chordal graph,Cardinality,Decidability,Unary function,Mathematics | Journal |
Volume | Issue | ISSN |
17 | 3 | 1432-0665 |
Citations | PageRank | References |
2 | 0.89 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ivan Korec | 1 | 98 | 21.18 |
| Wolfgang Rautenberg | 2 | 90 | 17.27 |