90 likes | 218 Views
Trachtenbrot’s Theorem. The following problem is undecidable . Given: A sentence of first order logic Question: Is satisfiable in a finite structure?. Theorem of Matyasevich. The following problem is undecidable
E N D
The following problem is undecidable Given: A sentence of first order logic Question: Is satisfiable in a finite structure?
Theorem of Matyasevich The following problem is undecidable Given: A polynomial of multiple natural varibales and integer coefficients Ques: Does have a zero, i.e., do there exist natural numbers s Hilbert’s 10th Problem
Proof: Reduction of Hilbert’s 10th problem to the problem is a given first order sentence is satisfiable in the finite. The form of Hilbert’s problem: Given: Two multivariate polynomials of degree with all coefficients equal 1. Question: D have a natural solution?
Reduction • For each variable in the equation we create a unary relation symbol
For each monomial we use: • A constant • An -ary relation symbol
That sentence enforces And additionally the relation contains only tuples beginning with
We add a -ary relation symbol and a sentence " is a 1-1 mapping From the set of all tuples in relations r Onto the set of all tuples in relations r