|
|
Subject:
Model theory - combinatorics of directed graphs
Category: Science > Math Asked by: mathdude123-ga List Price: $100.00 |
Posted:
29 Apr 2005 13:48 PDT
Expires: 09 May 2005 02:14 PDT Question ID: 515939 |
For phi a first order sentence in the signature of directed graphs, let D_n(phi) be the set of directed graphs with node set {1,...,n} which satify phi. Show that there are first order sentences phi and theta in the signature of directed graphs such that lim(n->infinity) |D_n(phi ^ theta)| / |D_n(phi)| is irrational. Desired timeframe: 5 days | |
|
|
There is no answer at this time. |
|
Subject:
Re: Model theory - combinatorics of directed graphs
From: mathtalk-ga on 04 May 2005 08:20 PDT |
In connection with first-order theories and formal logic, a "signature" refers to the predicates and function symbols (including constants) which determine the language of a formal first-order theory. For this and more background see: [First-order Model Theory] http://plato.stanford.edu/entries/modeltheory-fo/ Hence the signature of "directed graphs" would seem to mean simply that the language has a single 2-place predicate E(x,y) whose interpretation for a directed graph is intended to be the existance of an edge from x to y. Here one thinks of using the formula phi to impose some structure on the models which satisfy it, then picking formula theta to guarantee the irrationality of the limit required in the Question. Hint: The fraction of permutations of n things which are derangements tends, as n goes to infinity, to 1/e. regards, mathtalk-ga |
If you feel that you have found inappropriate content, please let us know by emailing us at answers-support@google.com with the question ID listed above. Thank you. |
Search Google Answers for |
Google Home - Answers FAQ - Terms of Service - Privacy Policy |