default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharles Steinhorn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j16]Alfred Dolich, Chris Miller, Charles Steinhorn:
Expansions of o-minimal structures by dense independent sets. Ann. Pure Appl. Log. 167(8): 684-706 (2016)- 2015
- [j15]Darío García
, Dugald Macpherson, Charles Steinhorn:
Pseudofinite structures and simplicity. J. Math. Log. 15(1): 1550002:1-1550002:41 (2015) - [j14]David Marker, James H. Schmerl, Charles Steinhorn:
Uncountable Real Closed Fields with PA Integer Parts. J. Symb. Log. 80(2): 490-502 (2015) - 2014
- [j13]Janak Ramakrishnan, Charles Steinhorn:
Definably extending partial orders in totally ordered structures. Math. Log. Q. 60(3): 205-210 (2014) - 2013
- [j12]Alfred Dolich, Chris Miller, Charles Steinhorn:
Extensions of ordered theories by generic predicates. J. Symb. Log. 78(2): 369-387 (2013) - 2011
- [p1]Dugald Macpherson, Charles Steinhorn:
Definability in classes of finite structures. Finite and Algorithmic Model Theory 2011: 140-176 - [e1]Javier Esparza, Christian Michaux, Charles Steinhorn:
Finite and Algorithmic Model Theory. London Mathematical Society Lecture Note Series 379, Cambridge University Press 2011, ISBN 978-0-521-71820-2 [contents]
2000 – 2009
- 2009
- [j11]Alf Onshuus, Charles Steinhorn:
On linearly Ordered Structures of finite Rank. J. Math. Log. 9(2) (2009)
1990 – 1999
- 1997
- [j10]Dugald Macpherson, Charles Steinhorn:
Extending Partial Orders on o-Minimal Structures to Definable Total Orders. Math. Log. Q. 43: 456-464 (1997) - 1996
- [j9]Dugald Macpherson, Charles Steinhorn:
On Variants of o-Minimality. Ann. Pure Appl. Log. 79(2): 165-209 (1996) - 1995
- [j8]Michael C. Laskowski, Charles Steinhorn:
On o-Minimal Expansions of Archimedean Ordered Groups. J. Symb. Log. 60(3): 817-831 (1995) - 1994
- [j7]David Marker, Charles Steinhorn:
Definable Types in O-Minimal Theories. J. Symb. Log. 59(1): 185-198 (1994) - 1990
- [j6]Saharon Shelah, Charles Steinhorn:
The Nonaxiomatizability of L(Q2ℵ1) by Finitely Many Schemata. Notre Dame J. Formal Log. 31(1): 1-13 (1990)
1980 – 1989
- 1989
- [j5]Charles Steinhorn, Carlo Toffalori:
The Boolean Spectrum of an o-Minimal Theory. Notre Dame J. Formal Log. 30(2): 197-206 (1989) - 1987
- [j4]Anand Pillay, Charles Steinhorn:
Discrete o-minimal structures. Ann. Pure Appl. Log. 34(3): 275-289 (1987) - [j3]Anand Pillay, Charles Steinhorn:
On Dedekind Complete O-Minimal Structures. J. Symb. Log. 52(1): 156-164 (1987) - 1986
- [j2]Saharon Shelah, Charles Steinhorn:
On the nonaxiomatizability of some logics by finitely many schemas. Notre Dame J. Formal Log. 27(1): 1-11 (1986) - 1985
- [j1]Anand Pillay, Charles Steinhorn:
A Note on Nonmultidimensional Superstable Theories. J. Symb. Log. 50(4): 1020-1024 (1985)
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-10-07 22:19 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:
