| 2007 |
|---|
| 44 | EE | James H. Schmerl:
A Note on Euclidean Ramsey Theory.
Discrete & Computational Geometry 38(1): 155-167 (2007) |
| 2005 |
|---|
| 43 | EE | James H. Schmerl:
Generic automorphisms and graph coloring.
Discrete Mathematics 291(1-3): 235-242 (2005) |
| 2004 |
|---|
| 42 | EE | James H. Schmerl:
Substructure lattices and almost minimal end extensions of models of Peano arithmetic.
Math. Log. Q. 50(6): 533-539 (2004) |
| 2002 |
|---|
| 41 | EE | Péter Komjáth,
James H. Schmerl:
The Two Points Theorem of Mazurkiewicz.
J. Comb. Theory, Ser. A 99(2): 371-376 (2002) |
| 40 | | James H. Schmerl:
Automorphism Groups of Models of Peano Arithmetic.
J. Symb. Log. 67(4): 1249-1264 (2002) |
| 39 | | James H. Schmerl:
Some Highly Saturated Models of Peano Arithmetic.
J. Symb. Log. 67(4): 1265-1273 (2002) |
| 38 | EE | James H. Schmerl:
Moving Intersticial Gaps.
Math. Log. Q. 48(2): 283-296 (2002) |
| 37 | EE | James H. Schmerl:
Obstacles to Extending Mirsky's Theorem.
Order 19(2): 209-211 (2002) |
| 2001 |
|---|
| 36 | EE | James H. Schmerl:
Closed Normal Subgroups.
Math. Log. Q. 47(4): 489-492 (2001) |
| 2000 |
|---|
| 35 | EE | James H. Schmerl:
Elementary extensions of models of set theory.
Arch. Math. Log. 39(7): 509-514 (2000) |
| 34 | EE | James H. Schmerl:
Graph Coloring and Reverse Mathematics.
Math. Log. Q. 46(4): 543-548 (2000) |
| 1998 |
|---|
| 33 | | James H. Schmerl:
What's the Difference?
Ann. Pure Appl. Logic 93(1-3): 255-261 (1998) |
| 32 | | James H. Schmerl:
Difference Sets and Recursion Theory.
Math. Log. Q. 44: 515-521 (1998) |
| 31 | | James H. Schmerl:
Recursive Models and the Divisibility Poset.
Notre Dame Journal of Formal Logic 39(1): 140-148 (1998) |
| 1995 |
|---|
| 30 | | James H. Schmerl:
The Isomorphism Property for Nonstandard Universes.
J. Symb. Log. 60(2): 512-516 (1995) |
| 29 | | James H. Schmerl:
A Reflection Principle and its Applications to Nonstandard Models.
J. Symb. Log. 60(4): 1137-1152 (1995) |
| 28 | | Roman Kossak,
James H. Schmerl:
Arithmetically Saturated Models of Arithmetic.
Notre Dame Journal of Formal Logic 36(4): 531-546 (1995) |
| 27 | | James H. Schmerl:
PA(aa).
Notre Dame Journal of Formal Logic 36(4): 560-569 (1995) |
| 26 | | Ron Blei,
Yuval Peres,
James H. Schmerl:
Fractional Products of Sets.
Random Struct. Algorithms 6(1): 113-120 (1995) |
| 1994 |
|---|
| 25 | EE | James H. Schmerl:
Tiling space with notched cubes.
Discrete Mathematics 133(1-3): 225-235 (1994) |
| 1993 |
|---|
| 24 | | Roman Kossak,
Henryk Kotlarski,
James H. Schmerl:
On Maximal Subgroups of the Automorphism Group of a Countable Recursively Saturated Model of PA.
Ann. Pure Appl. Logic 65(2): 125-148 (1993) |
| 23 | | James H. Schmerl:
Partitioning Euclidean Space.
Discrete & Computational Geometry 10: 101-106 (1993) |
| 22 | EE | James H. Schmerl,
William T. Trotter:
Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures.
Discrete Mathematics 113(1-3): 191-205 (1993) |
| 1992 |
|---|
| 21 | | James H. Schmerl:
A General Framework for Discovering and Proving Theorems of the Erdös-Ko-Rado Type.
J. Comb. Theory, Ser. A 61(2): 252-262 (1992) |
| 20 | | James H. Schmerl:
End Extensions of Models of Arithmetic.
Notre Dame Journal of Formal Logic 33(2): 216-220 (1992) |
| 1991 |
|---|
| 19 | | H. Jerome Keisler,
James H. Schmerl:
Making the Hyperreal Line Both Saturated and Complete.
J. Symb. Log. 56(3): 1016-1025 (1991) |
| 18 | | Dugald Macpherson,
James H. Schmerl:
Binary Relational Structures Having Only Countably Many Nonisomorphic Substructures.
J. Symb. Log. 56(3): 876-884 (1991) |
| 17 | | Roman Kossak,
James H. Schmerl:
Minimal Satisfaction Classes with an Application to Rigid Models of {Peano} Arithmetic.
Notre Dame Journal of Formal Logic 32(3): 392-398 (1991) |
| 1990 |
|---|
| 16 | | James H. Schmerl:
Coinductive aleph0-Categorical Theories.
J. Symb. Log. 55(3): 1130-1137 (1990) |
| 1989 |
|---|
| 15 | | Imre Bárány,
James H. Schmerl,
Stuart J. Sidney,
Jorge Urrutia:
A Combinatorial Result About Points and Balls in Euclidean Space.
Discrete & Computational Geometry 4: 259-262 (1989) |
| 14 | | James H. Schmerl:
Partially Ordered Sets and the Independence Property.
J. Symb. Log. 54(2): 396-401 (1989) |
| 13 | | Roman Kossak,
Mark E. Nadel,
James H. Schmerl:
A Note on the Multiplicative Semigroup of Models of Peano Arithmetic.
J. Symb. Log. 54(3): 936-940 (1989) |
| 12 | | James H. Schmerl:
Large Resplendent Models Generated by Indiscernibles.
J. Symb. Log. 54(4): 1382-1388 (1989) |
| 1987 |
|---|
| 11 | | Matt Kaufmann,
James H. Schmerl:
Remarks on Weak Notions of Saturation in Models of Peano Arithmetic.
J. Symb. Log. 52(1): 129-148 (1987) |
| 1986 |
|---|
| 10 | EE | Henry A. Kierstead,
James H. Schmerl:
The chromatic number of graphs which induce neither K1, 3 nor K5-e.
Discrete Mathematics 58(3): 253-262 (1986) |
| 1983 |
|---|
| 9 | EE | Henry A. Kierstead,
James H. Schmerl:
Some applications of Vizing's theorem to vertex colorings of graphs.
Discrete Mathematics 45(2-3): 277-285 (1983) |
| 1982 |
|---|
| 8 | | James H. Schmerl,
Stephen G. Simpson:
On the Role of Ramsey Quantifiers in First Order Arithmetic.
J. Symb. Log. 47(2): 423-435 (1982) |
| 1981 |
|---|
| 7 | | James H. Schmerl:
Decidability and Finite Axiomatizability of Theories of 0-Categorical Partially Ordered Sets.
J. Symb. Log. 46(1): 101-120 (1981) |
| 1980 |
|---|
| 6 | | James H. Schmerl:
Decidability and 0-Categoricity of Theories of Partially Ordered Sets.
J. Symb. Log. 45(3): 585-611 (1980) |
| 1979 |
|---|
| 5 | | Manuel Lerman,
James H. Schmerl:
Theories with Recursive Models.
J. Symb. Log. 44(1): 59-76 (1979) |
| 1977 |
|---|
| 4 | | James H. Schmerl:
An Axiomatization for a Class of Two-Cardinal Models.
J. Symb. Log. 42(2): 174-178 (1977) |
| 1974 |
|---|
| 3 | | James H. Schmerl:
Generalizing Special Aronszajn Trees.
J. Symb. Log. 39(4): 732-740 (1974) |
| 1972 |
|---|
| 2 | | James H. Schmerl:
An Elementary Sentence which Has Ordered Models.
J. Symb. Log. 37(3): 521-530 (1972) |
| 1 | | James H. Schmerl,
Saharon Shelah:
On Power-like Models for Hyperinaccessible Cardinals.
J. Symb. Log. 37(3): 531-537 (1972) |
