default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLou van den Dries
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j20]Matthias Aschenbrenner
, Lou van den Dries, Joris van der Hoeven:
Toward a Model Theory for Transseries. Notre Dame J. Formal Log. 54(3-4): 279-310 (2013)- 2011
- [j19]Vinicius Cifú Lopes, Lou van den Dries:
Invariant measures on groups satisfying various chain conditions. J. Symb. Log. 76(1): 209-226 (2011) - 2010
- [j18]Vinicius Cifú Lopes, Lou van den Dries:
Division rings whose vector spaces are pseudofinite. J. Symb. Log. 75(3): 1087-1090 (2010)
2000 – 2009
- 2009
- [j17]Lou van den Dries, Yiannis N. Moschovakis:
Arithmetic complexity. ACM Trans. Comput. Log. 10(1): 2:1-2:49 (2009) - 2004
- [j16]Lou van den Dries, Yiannis N. Moschovakis:
Is the Euclidean algorithm optimal among its peers? Bull. Symb. Log. 10(3): 390-418 (2004) - 2003
- [j15]Lou van den Dries:
Generating the Greatest Common Divisor, and Limitations of Primitive Recursive Algorithms. Found. Comput. Math. 3(3): 297-324 (2003) - [j14]Lou van den Dries, A. J. Wilkie:
The laws of integer divisibility, and solution sets of linear divisibility conditions. J. Symb. Log. 68(2): 503-526 (2003) - 2001
- [j13]Lou van den Dries, Angus Macintyre, David Marker:
Logarithmic-exponential series. Ann. Pure Appl. Log. 111(1-2): 61-113 (2001)
1990 – 1999
- 1998
- [j12]Lou van den Dries:
Correction to "T-Convexity and Tame Extensions II". J. Symb. Log. 63(4): 1597 (1998) - 1997
- [j11]Lou van den Dries:
T-Convexity and Tame Extensions II. J. Symb. Log. 62(1): 14-34 (1997) - 1995
- [j10]Lou van den Dries, Adam H. Lewenberg:
T-Convexity and Tame Extensions. J. Symb. Log. 60(1): 74-102 (1995) - 1992
- [j9]Lou van den Dries, Jan E. Holly:
Quantifier Elimination for Modules with Scalar Variables. Ann. Pure Appl. Log. 57(2): 161-179 (1992)
1980 – 1989
- 1989
- [j8]Lou van den Dries:
Dimension of Definable Sets, Algebraic Boundedness and Henselian Fields. Ann. Pure Appl. Log. 45(2): 189-209 (1989) - [j7]Lou van den Dries, David Marker, Gary Martin:
Definable Equivalence Relations on Algebraically Closed Fields. J. Symb. Log. 54(3): 928-935 (1989) - 1988
- [j6]Lou van den Dries:
Alfred Tarski's Elimination Theory for Real Closed Fields. J. Symb. Log. 53(1): 7-19 (1988) - [j5]Lou van den Dries:
On the Elementary Theory of Restricted Elementary Functions. J. Symb. Log. 53(3): 796-808 (1988) - [j4]Philip Scowcroft, Lou van den Dries:
On the Structure of Semialgebraic Sets Over p-Adic Fields. J. Symb. Log. 53(4): 1138-1164 (1988) - 1987
- [j3]Lou van den Dries, Paulo Ribenboim:
An application of tarskis principle to absolute Galois groups of function fields. Ann. Pure Appl. Log. 33: 83-107 (1987) - 1985
- [j2]Lou van den Dries, Rick L. Smith:
Decidable Regularly Closed Fields of Algebraic Numbers. J. Symb. Log. 50(2): 468-475 (1985) - 1984
- [j1]Lou van den Dries:
Algebraic Theories with Definable Skolem Functions. J. Symb. Log. 49(2): 625-629 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
