Lou van den Dries

According to our database1, Lou van den Dries authored at least 20 papers between 1984 and 2013.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Toward a Model Theory for Transseries.
Notre Dame J. Formal Log., 2013

2011
Invariant measures on groups satisfying various chain conditions.
J. Symb. Log., 2011

2010
Division rings whose vector spaces are pseudofinite.
J. Symb. Log., 2010

2009
Arithmetic complexity.
ACM Trans. Comput. Log., 2009

2004
Is the Euclidean algorithm optimal among its peers?
Bull. Symb. Log., 2004

2003
The laws of integer divisibility, and solution sets of linear divisibility conditions.
J. Symb. Log., 2003

Generating the Greatest Common Divisor, and Limitations of Primitive Recursive Algorithms.
Found. Comput. Math., 2003

2001
Logarithmic-exponential series.
Ann. Pure Appl. Log., 2001

1998
Correction to "T-Convexity and Tame Extensions II".
J. Symb. Log., 1998

1997
T-Convexity and Tame Extensions II.
J. Symb. Log., 1997

1995
T-Convexity and Tame Extensions.
J. Symb. Log., 1995

1992
Quantifier Elimination for Modules with Scalar Variables.
Ann. Pure Appl. Log., 1992

1989
Definable Equivalence Relations on Algebraically Closed Fields.
J. Symb. Log., 1989

Dimension of Definable Sets, Algebraic Boundedness and Henselian Fields.
Ann. Pure Appl. Log., 1989

1988
On the Structure of Semialgebraic Sets Over p-Adic Fields.
J. Symb. Log., 1988

On the Elementary Theory of Restricted Elementary Functions.
J. Symb. Log., 1988

Alfred Tarski's Elimination Theory for Real Closed Fields.
J. Symb. Log., 1988

1987
An application of tarskis principle to absolute Galois groups of function fields.
Ann. Pure Appl. Log., 1987

1985
Decidable Regularly Closed Fields of Algebraic Numbers.
J. Symb. Log., 1985

1984
Algebraic Theories with Definable Skolem Functions.
J. Symb. Log., 1984


  Loading...