We discussed briefly Church’s and Trakhtenbrot’s theorems: The set of logically valid sentences and the set of sentences valid in all finite models are undecidable. More precisely: If is a language that contains either a binary symbol or the language of arithmetic, then the set of theorems of reduces to the set of validities of , so this set is (r.e. and) undecidable. For the same , we can axiomatize the behavior of a given Turing machine on a given input (by a similar argument to the association of a semi-Thue system to each Turing machine) in such a way that this axiomatization has a finite model iff the machine converges on this input, thus the halting problem reduces to the complement of the set of finite validities, so this last set is (co-r.e. and) undecidable.

We defined Post correspondence systems and showed that the problem of determining whether such a system admits a solution is unsolvable. Two applications to the theory of formal languages follow: There is no algorithm to test whether 2 given context-free grammars have disjoint languages, and there is no algorithm to test whether a given context-free grammar is ambiguous.

This entry was posted on Friday, March 2nd, 2007 at 2:11 pm and is filed under 117b: Computability theory. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

A database of number fields, by Jürgen Klüners and Gunter Malle. (Note this is not the same as the one mentioned in this answer.) The site also provides links to similar databases.

As the other answer indicates, the yes answer to your question is known as the De Bruijn-Erdős theorem. This holds regardless of the size of the graph. The De Bruijn–Erdős theorem is a particular instance of what in combinatorics we call a compactness argument or Rado's selection principle, and its truth can be seen as a consequence of the topological c […]

Every $P_c$ has the size of the reals. For instance, suppose $\sum_n a_n=c$ and start by writing $\mathbb N=A\cup B$ where $\sum_{n\in A}a_n$ converges absolutely (to $a$, say). This is possible because $a_n\to 0$: Let $m_0

Consider a subset $\Omega$ of $\mathbb R$ of size $\aleph_1$ and ordered in type $\omega_1$. (This uses the axiom of choice.) Let $\mathcal F$ be the $\sigma$-algebra generated by the initial segments of $\Omega$ under the well-ordering (so all sets in $\mathcal F$ are countable or co-countable), with the measure that assigns $0$ to the countable sets and $1 […]

You assume $\omega_\alpha\subseteq M$ and $X\in M$ so that $X$ belongs to the transitive collapse of $M$ (because if $\pi$ is the collapsing map, $\pi(X)=\pi[X]=X$. You assume $|M|=\aleph_\alpha$ so that the transitive collapse of $M$ has size $\aleph_\alpha$. Since you also have that this transitive collapse is of the form $L_\beta$ for some $\beta$, it fol […]

No, this is not possible. Dave L. Renfro wrote an excellent historical Essay on nowhere analytic $C^\infty$ functions in two parts (with numerous references). See here: 1 (dated May 9, 2002 6:18 PM), and 2 (dated May 19, 2002 8:29 PM). As indicated in part 1, in Zygmunt Zahorski. Sur l'ensemble des points singuliers d'une fonction d'une variab […]

I don't think you need too much in terms of prerequisites. An excellent reference is MR3616119. Tomkowicz, Grzegorz(PL-CEG2); Wagon, Stan(1-MACA-NDM). The Banach-Tarski paradox. Second edition. With a foreword by Jan Mycielski. Encyclopedia of Mathematics and its Applications, 163. Cambridge University Press, New York, 2016. xviii+348 pp. ISBN: 978-1-10 […]

For the second problem, write $x=-3+x'$ and so on. You have $x'+y'+z'=17$ and $x',\dots$ are nonnegative, a case you know how to solve. You can also solve the first problem this way; now you would set $x=1+x'$, etc.