The following pages link to (Q4231579):
Displaying 24 items.
- A polynomial encoding provability in pure mathematics (outline of an explicit construction) (Q351271) (← links)
- Hilbert's tenth problem for weak theories of arithmetic (Q685070) (← links)
- Hilbert's tenth problem is of unification type zero (Q688556) (← links)
- What can and cannot be done with Diophantine problems (Q741171) (← links)
- Further results on Hilbert's tenth problem (Q829448) (← links)
- The Matiyasevich theorem. Preliminaries (Q1795565) (← links)
- On Rumely's local-global principle (Q1894971) (← links)
- Basic Diophantine relations (Q2311525) (← links)
- The Hilbert's-tenth-problem operator (Q2414521) (← links)
- Existential Diophantine definability of string length (Q2419123) (← links)
- Unsolvability of some optimization problems (Q2489339) (← links)
- Hilbert's Tenth Problem: What was done and what is to be done (Q2715528) (← links)
- Hilbert's Tenth Problem over number fields, a survey (Q2715530) (← links)
- Plain bases for classes of primitive recursive functions (Q2776813) (← links)
- Does there exist an algorithm which to each Diophantine equation assigns an integer which is greater than the modulus of integer solutions, if these solutions form a finite set? (Q2843817) (← links)
- On the problem of the 10th discriminant (Q2931157) (← links)
- (Q3197911) (← links)
- Undecidable and decidable restrictions of Hilbert's Tenth Problem: images of polynomials vs. images of exponential functions (Q3376536) (← links)
- Extension of Hilbert's tenth problem to some algebraic number fields (Q3470574) (← links)
- Proof of Recursive Unsolvability of Hilbert's Tenth Problem (Q3986352) (← links)
- (Q3992465) (← links)
- Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories (Q4457733) (← links)
- Cocyclic subshifts from Diophantine equations (Q5406325) (← links)
- New Computational Paradigms (Q5717055) (← links)
