Charles Steinhorn

According to our database1, Charles Steinhorn authored at least 17 papers between 1985 and 2016.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
Expansions of o-minimal structures by dense independent sets.
Ann. Pure Appl. Log., 2016

2015
Uncountable Real Closed Fields with PA Integer Parts.
J. Symb. Log., 2015

Pseudofinite structures and simplicity.
J. Math. Log., 2015

2014
Definably extending partial orders in totally ordered structures.
Math. Log. Q., 2014

2013
Extensions of ordered theories by generic predicates.
J. Symb. Log., 2013

2011
Definability in classes of finite structures.
Proceedings of the Finite and Algorithmic Model Theory., 2011

2009
On linearly Ordered Structures of finite Rank.
J. Math. Log., 2009

1997
Extending Partial Orders on o-Minimal Structures to Definable Total Orders.
Math. Log. Q., 1997

1996
On Variants of o-Minimality.
Ann. Pure Appl. Log., 1996

1995
On o-Minimal Expansions of Archimedean Ordered Groups.
J. Symb. Log., 1995

1994
Definable Types in O-Minimal Theories.
J. Symb. Log., 1994

1990
The Nonaxiomatizability of L(Q<sup>2</sup><sub>ℵ<sub>1</sub></sub>) by Finitely Many Schemata.
Notre Dame J. Formal Log., 1990

1989
The Boolean Spectrum of an o-Minimal Theory.
Notre Dame J. Formal Log., 1989

1987
On Dedekind Complete O-Minimal Structures.
J. Symb. Log., 1987

Discrete o-minimal structures.
Ann. Pure Appl. Log., 1987

1986
On the nonaxiomatizability of some logics by finitely many schemas.
Notre Dame J. Formal Log., 1986

1985
A Note on Nonmultidimensional Superstable Theories.
J. Symb. Log., 1985


  Loading...