zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Reduction of unknowns in diophantine representations. (English) Zbl 0773.11077
Authors’ summary: The hardest step to solve Hilbert’s tenth problem is to prove that the exponential relation is diophantine. In the study of decision problems concerning the solvability of diophantine equations with few unknowns, reducing unknowns in diophantine representations plays an important role. In this paper, we give diophantine representations of C=ψ B (A,1) (where ψ 0 (A,1)=0, ψ 1 (A,1)=1, ψ m+1 (A,1)=Aψ m (A,1)-ψ m-1 (A,1)) and W=V B A 1 ,,A k S|TR>0 with only 3 and 5 natural number unknowns respectively, C=ψ B (A,1) (on the condition 1<|B|<|A| 2-1) and W=V B A 1 ,,A k S|T with 4 and 6 integer unknowns respectively.

MSC:
11U05Decidability related to number theory
03B25Decidability of theories; sets of sentences
11U09Connections of number theory with model theory
03C60Model-theoretic algebra