A Failure of Quantifier Elimination (2007)
Angus Macintyre, David Marker, Let L
uld actually eliminate quantifiers in the language L an [ flogg [ fx q : q 2 Qg. Here we show that although exp and log are interdefinable, log is essential for quantifer elimination. Theorem. Let...
On Founding the Theory of Algorithms (1998)
machines and implementations The first definition of an abstract machine was given by Turing, in the classic [20]. Without repeating here the well-known definition (e.g., see [6]), 13 we recall that...
On Founding the Theory of Algorithms (1998)
Yiannis Moschovakis My, Yiannis N. Moschovakis, Let L
machines and implementations The first definition of an abstract machine was given by Turing, in the classic [20]. Without repeating here the well-known definition (e.g., see [6]), we recall that...
A Basic Family Of Iteration Functions For Polynomial Root Finding And Its Characterizations (1997)
Bahman Kalantari, Iraj Kalantari, Rahim Zaare-nahandi, X)=j!. For I, Let L
Let p(x) be a polynomial of degree n 2 with coefficients in a subfield K of the complex numbers. For each natural number m 2, let Lm (x) be the m2m lower triangular matrix whose diagonal entries are...