James H. Schmerl

According to our database, James H. Schmerl authored at least 72 papers between 1972 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

CP-generic expansions of models of Peano Arithmetic.

Athar Abdul-Quader, James H. Schmerl

Math. Log. Q., 2022

2018

More Automorphism Groups of Countable, Arithmetically Saturated Models of Peano Arithmetic.

James H. Schmerl

Notre Dame J. Formal Log., 2018

Acceptable colorings of Indexed Hyperspaces.

James H. Schmerl

J. Symb. Log., 2018

Deciding the chromatic numbers of Algebraic hypergraphs.

James H. Schmerl

J. Symb. Log., 2018

2017

Chromatic numbers of algebraic hypergraphs.

James H. Schmerl

Comb., 2017

Minimal elementary end extensions.

James H. Schmerl

Arch. Math. Log., 2017

2015

Automorphism Groups of Countable Arithmetically saturated Models of Peano Arithmetic.

James H. Schmerl

J. Symb. Log., 2015

Uncountable Real Closed Fields with PA Integer Parts.

David Marker, James H. Schmerl, Charles Steinhorn

J. Symb. Log., 2015

2014

Cofinal elementary extensions.

James H. Schmerl

Math. Log. Q., 2014

Automorphism Groups of saturated Models of Peano Arithmetic.

Ermek S. Nurkhaidarov, James H. Schmerl

J. Symb. Log., 2014

Subsets coded in elementary end extensions.

James H. Schmerl

Arch. Math. Log., 2014

2012

Elementary Cuts in Saturated Models of Peano Arithmetic.

James H. Schmerl

Notre Dame J. Formal Log., 2012

On Cofinal Submodels and Elementary Interstices.

Roman Kossak, James H. Schmerl

Notre Dame J. Formal Log., 2012

A generalization of Sierpiński's paradoxical decompositions: Coloring semialgebraic grids.

James H. Schmerl

J. Symb. Log., 2012

The automorphism group of a resplendent model.

James H. Schmerl

Arch. Math. Log., 2012

2011

Dividing a polygon into two similar polygons.

James H. Schmerl

Discret. Math., 2011

2010

Reverse Mathematics and Grundy colorings of graphs.

James H. Schmerl

Math. Log. Q., 2010

Infinite substructure lattices of models of Peano Arithmetic.

James H. Schmerl

J. Symb. Log., 2010

An Improvement to "A Note on Euclidean Ramsey Theory".

James H. Schmerl

Discret. Comput. Geom., 2010

2008

Self-Embeddings of Computable Trees.

Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon

Notre Dame J. Formal Log., 2008

Nondiversity in substructures.

James H. Schmerl

J. Symb. Log., 2008

2007

A Note on Euclidean Ramsey Theory.

James H. Schmerl

Discret. Comput. Geom., 2007

2005

Generic automorphisms and graph coloring.

James H. Schmerl

Discret. Math., 2005

2004

Substructure lattices and almost minimal end extensions of models of Peano arithmetic.

James H. Schmerl

Math. Log. Q., 2004

2003

Partitioning large vector spaces.

James H. Schmerl

J. Symb. Log., 2003

2002

Obstacles to Extending Mirsky's Theorem.

James H. Schmerl

Order, 2002

Moving Intersticial Gaps.

James H. Schmerl

Math. Log. Q., 2002

Some Highly Saturated Models of Peano Arithmetic.

James H. Schmerl

J. Symb. Log., 2002

Automorphism Groups of Models of Peano Arithmetic.

James H. Schmerl

J. Symb. Log., 2002

The Two Points Theorem of Mazurkiewicz.

Péter Komjáth, James H. Schmerl

J. Comb. Theory, Ser. A, 2002

2001

Closed Normal Subgroups.

James H. Schmerl

Math. Log. Q., 2001

2000

Graph Coloring and Reverse Mathematics.

James H. Schmerl

Math. Log. Q., 2000

Elementary extensions of models of set theory.

James H. Schmerl

Arch. Math. Log., 2000

1998

Recursive Models and the Divisibility Poset.

James H. Schmerl

Notre Dame J. Formal Log., 1998

Difference Sets and Recursion Theory.

James H. Schmerl

Math. Log. Q., 1998

What's the Difference?

James H. Schmerl

Ann. Pure Appl. Log., 1998

1995

Fractional Products of Sets.

Ron Blei, Yuval Peres, James H. Schmerl

Random Struct. Algorithms, 1995

PA(aa).

James H. Schmerl

Notre Dame J. Formal Log., 1995

Arithmetically Saturated Models of Arithmetic.

Roman Kossak, James H. Schmerl

Notre Dame J. Formal Log., 1995

A Reflection Principle and its Applications to Nonstandard Models.

James H. Schmerl

J. Symb. Log., 1995

The Isomorphism Property for Nonstandard Universes.

James H. Schmerl

J. Symb. Log., 1995

1994

The Regularity of Some 1-Additive Sequences.

James H. Schmerl, Eugene Spiegel

J. Comb. Theory, Ser. A, 1994

Tiling space with notched cubes.

James H. Schmerl

Discret. Math., 1994

1993

Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures.

James H. Schmerl, William T. Trotter

Discret. Math., 1993

Partitioning Euclidean Space.

James H. Schmerl

Discret. Comput. Geom., 1993

On Maximal Subgroups of the Automorphism Group of a Countable Recursively Saturated Model of PA.

Roman Kossak, Henryk Kotlarski, James H. Schmerl

Ann. Pure Appl. Logic, 1993

A weakly definable type which is not definable.

James H. Schmerl

Arch. Math. Log., 1993

1992

End Extensions of Models of Arithmetic.

James H. Schmerl

Notre Dame J. Formal Log., 1992

A General Framework for Discovering and Proving Theorems of the Erdös-Ko-Rado Type.

James H. Schmerl

J. Comb. Theory, Ser. A, 1992

1991

Minimal Satisfaction Classes with an Application to Rigid Models of Peano Arithmetic.

Roman Kossak, James H. Schmerl

Notre Dame J. Formal Log., 1991

Binary Relational Structures Having Only Countably Many Nonisomorphic Substructures.

Dugald Macpherson, James H. Schmerl

J. Symb. Log., 1991

Making the Hyperreal Line Both Saturated and Complete.

H. Jerome Keisler, James H. Schmerl

J. Symb. Log., 1991

1990

Coinductive aleph₀-Categorical Theories.

James H. Schmerl

J. Symb. Log., 1990

1989

Large Resplendent Models Generated by Indiscernibles.

James H. Schmerl

J. Symb. Log., 1989

Partially Ordered Sets and the Independence Property.

James H. Schmerl

J. Symb. Log., 1989

A Note on the Multiplicative Semigroup of Models of Peano Arithmetic.

Roman Kossak, Mark E. Nadel, James H. Schmerl

J. Symb. Log., 1989

A Combinatorial Result About Points and Balls in Euclidean Space.

Imre Bárány, James H. Schmerl, Stuart J. Sidney, Jorge Urrutia

Discret. Comput. Geom., 1989

1987

Remarks on Weak Notions of Saturation in Models of Peano Arithmetic.

Matt Kaufmann, James H. Schmerl

J. Symb. Log., 1987

1986

Theories Having Finitely Many Countable Homogeneous Models.

James H. Schmerl

Math. Log. Q., 1986

The chromatic number of graphs which induce neither K_{1, 3} nor K₅-e.

Henry A. Kierstead, James H. Schmerl

Discret. Math., 1986

1985

Recursively saturated models generated by indiscernibles.

James H. Schmerl

Notre Dame J. Formal Log., 1985

1984

Saturation and simple extensions of models of peano arithmetic.

Matt Kaufmann, James H. Schmerl

Ann. Pure Appl. Log., 1984

1983

Some applications of Vizing's theorem to vertex colorings of graphs.

Henry A. Kierstead, James H. Schmerl

Discret. Math., 1983

1982

On the Role of Ramsey Quantifiers in First Order Arithmetic.

James H. Schmerl, Stephen G. Simpson

J. Symb. Log., 1982

1981

Decidability and Finite Axiomatizability of Theories of ₀-Categorical Partially Ordered Sets.

James H. Schmerl

J. Symb. Log., 1981

1980

Decidability and ₀-Categoricity of Theories of Partially Ordered Sets.

James H. Schmerl

J. Symb. Log., 1980

1979

Theories with Recursive Models.

Manuel Lerman, James H. Schmerl

J. Symb. Log., 1979

1977

An Axiomatization for a Class of Two-Cardinal Models.

James H. Schmerl

J. Symb. Log., 1977

1976

Remarks on Self-Extending Models.

James H. Schmerl

Math. Log. Q., 1976

1974

Generalizing Special Aronszajn Trees.

James H. Schmerl

J. Symb. Log., 1974

1972

On Power-like Models for Hyperinaccessible Cardinals.

James H. Schmerl, Saharon Shelah

J. Symb. Log., 1972

An Elementary Sentence which Has Ordered Models.

James H. Schmerl

J. Symb. Log., 1972