Charles Steinhorn

发表

The Nonaxiomatizability of L(Q2ℵ1) by Finitely Many Schemata

Saharon Shelah, Charles Steinhorn, 1990, Notre Dame J. Formal Log..

Definability in classes of finite structures

Dugald Macpherson, Charles Steinhorn, 2011, Finite and Algorithmic Model Theory.

Pseudofinite structures and simplicity

Dugald Macpherson, Charles Steinhorn, Darío García, 2015, J. Math. Log..

Discrete o-minimal structures

Anand Pillay, Charles Steinhorn, 1987, Ann. Pure Appl. Log..

Finite and Algorithmic Model Theory

Javier Esparza, Christian Michaux, Charles Steinhorn, 2011, London Mathematical Society Lecture Note Series.

Extensions of ordered theories by generic predicates

Chris Miller, Alfred Dolich, Charles Steinhorn, 2013, J. Symb. Log..

Finite and Algorithmic Model Theory: Bibliography

Javier Esparza, Christian Michaux, Charles Steinhorn, 2011 .

Definable Types in O-Minimal Theories

Charles Steinhorn, David Marker, 1994, J. Symb. Log..

On Variants of o-Minimality

Dugald Macpherson, Charles Steinhorn, 1996, Ann. Pure Appl. Log..

Expansions of o-minimal structures by dense independent sets

Chris Miller, Alfred Dolich, Charles Steinhorn, 2016, Ann. Pure Appl. Log..

A Note on Nonmultidimensional Superstable Theories

Anand Pillay, Charles Steinhorn, 1985, J. Symb. Log..

On linearly Ordered Structures of finite Rank

Alf Onshuus, Charles Steinhorn, 2009, J. Math. Log..

The Boolean Spectrum of an o-Minimal Theory

Carlo Toffalori, Charles Steinhorn, 1989, Notre Dame J. Formal Log..

Finite and Algorithmic Model Theory: Preface

Javier Esparza, Christian Michaux, Charles Steinhorn, 2011 .

Tame Topology and O-Minimal Structures

Charles Steinhorn, C. Steinhorn, 2008 .

On o-minimal expansions of Archimedean ordered groups

Michael C. Laskowski, Charles Steinhorn, C. Steinhorn, 1995, Journal of Symbolic Logic.

On Dedekind Complete O-Minimal Structures

Anand Pillay, Charles Steinhorn, 1987, J. Symb. Log..

1995–1996 annual meeting of the association for symbolic logic

Phokion G. Kolaitis, Harvey Friedman, Richard A. Shore, 1996 .

On the nonaxiomatizability of some logics by finitely many schemas

Saharon Shelah, Charles Steinhorn, 1986, Notre Dame J. Formal Log..

Uncountable Real Closed Fields with PA Integer Parts

James H. Schmerl, Charles Steinhorn, David Marker, 2015, J. Symb. Log..

Extending Partial Orders on o-Minimal Structures to Definable Total Orders

Dugald Macpherson, Charles Steinhorn, 1997, Math. Log. Q..

Definably extending partial orders in totally ordered structures

Charles Steinhorn, Janak Ramakrishnan, 2014, Math. Log. Q..

2021 WINTER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC

Antonio Montalbán, Charles Steinhorn, Aleksandra Kwiatkowska, 2021, The Bulletin of Symbolic Logic.

Between Groups and rings

Anand Pillay, Charles Steinhorn, A. Pillay, 1989 .

Structures having o-minimal open core

Chris Miller, Alfred Dolich, Charles Steinhorn, 2009 .

Logic: from foundations to applications: European logic colloquium

Wilfrid Hodges, John K. Truss, Martin Hyland, 1996 .

Exercises on Local Weight

John T. Baldwin, Charles Steinhorn, 1987 .

Borel Structures for First-order and Extended Logics

Charles Steinhorn, 1985 .

ONE-DIMENSIONAL ASYMPTOTIC CLASSES OF FINITE STRUCTURES

Dugald Macpherson, Charles Steinhorn, C. Steinhorn, 2008 .

Weakly o-minimal structures and real closed fields

Dugald Macpherson, Charles Steinhorn, David Marker, 2000 .

Finite and Algorithmic Model Theory: Definability in classes of finite structures

Dugald Macpherson, Charles Steinhorn, 2011 .

1 Definability in classes of finite structures

Dugald Macpherson, Charles Steinhorn, 2011 .