| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | James H. Schmerl |
Dividing a polygon into two similar polygons.  |
Discrete Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | James H. Schmerl |
Reverse Mathematics and Grundy colorings of graphs. |
Math. Log. Q. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | James H. Schmerl |
Infinite substructure lattices of models of Peano Arithmetic. |
J. Symb. Log. |
2010 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
An Improvement to "A Note on Euclidean Ramsey Theory". |
Discrete & Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon |
Self-Embeddings of Computable Trees. |
Notre Dame Journal of Formal Logic |
2008 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
Nondiversity in substructures. |
J. Symb. Log. |
2008 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
A Note on Euclidean Ramsey Theory. |
Discrete & Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | James H. Schmerl |
Generic automorphisms and graph coloring. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | James H. Schmerl |
Substructure lattices and almost minimal end extensions of models of Peano arithmetic. |
Math. Log. Q. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | James H. Schmerl |
Partitioning large vector spaces. |
J. Symb. Log. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Péter Komjáth, James H. Schmerl |
The Two Points Theorem of Mazurkiewicz. |
J. Comb. Theory, Ser. A |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | James H. Schmerl |
Moving Intersticial Gaps. |
Math. Log. Q. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | James H. Schmerl |
Some Highly Saturated Models of Peano Arithmetic. |
J. Symb. Log. |
2002 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
Automorphism Groups of Models of Peano Arithmetic. |
J. Symb. Log. |
2002 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
Obstacles to Extending Mirsky's Theorem. |
Order |
2002 |
DBLP DOI BibTeX RDF |
locally finite poset, chain, antichain |
| 1 | James H. Schmerl |
Closed Normal Subgroups. |
Math. Log. Q. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | James H. Schmerl |
Graph Coloring and Reverse Mathematics. |
Math. Log. Q. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | James H. Schmerl |
Elementary extensions of models of set theory. |
Arch. Math. Log. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | James H. Schmerl |
Difference Sets and Recursion Theory. |
Math. Log. Q. |
1998 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
Recursive Models and the Divisibility Poset. |
Notre Dame Journal of Formal Logic |
1998 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
What's the Difference? |
Ann. Pure Appl. Logic |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | James H. Schmerl |
PA(aa). |
Notre Dame Journal of Formal Logic |
1995 |
DBLP BibTeX RDF |
|
| 1 | Roman Kossak, James H. Schmerl |
Arithmetically Saturated Models of Arithmetic. |
Notre Dame Journal of Formal Logic |
1995 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
A Reflection Principle and its Applications to Nonstandard Models. |
J. Symb. Log. |
1995 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
The Isomorphism Property for Nonstandard Universes. |
J. Symb. Log. |
1995 |
DBLP BibTeX RDF |
|
| 1 | Ron Blei, Yuval Peres, James H. Schmerl |
Fractional Products of Sets. |
Random Struct. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | James H. Schmerl |
Tiling space with notched cubes. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | James H. Schmerl, William T. Trotter |
Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures. |
Discrete Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | James H. Schmerl |
Partitioning Euclidean Space. |
Discrete & Computational Geometry |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | James H. Schmerl |
A General Framework for Discovering and Proving Theorems of the Erdös-Ko-Rado Type. |
J. Comb. Theory, Ser. A |
1992 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
End Extensions of Models of Arithmetic. |
Notre Dame Journal of Formal Logic |
1992 |
DBLP BibTeX RDF |
|
| 1 | Roman Kossak, James H. Schmerl |
Minimal Satisfaction Classes with an Application to Rigid Models of {Peano} Arithmetic. |
Notre Dame Journal of Formal Logic |
1991 |
DBLP BibTeX RDF |
|
| 1 | Dugald Macpherson, James H. Schmerl |
Binary Relational Structures Having Only Countably Many Nonisomorphic Substructures. |
J. Symb. Log. |
1991 |
DBLP BibTeX RDF |
|
| 1 | H. Jerome Keisler, James H. Schmerl |
Making the Hyperreal Line Both Saturated and Complete. |
J. Symb. Log. |
1991 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
Coinductive aleph0-Categorical Theories. |
J. Symb. Log. |
1990 |
DBLP BibTeX RDF |
|
| 1 | Roman Kossak, Mark E. Nadel, James H. Schmerl |
A Note on the Multiplicative Semigroup of Models of Peano Arithmetic. |
J. Symb. Log. |
1989 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
Partially Ordered Sets and the Independence Property. |
J. Symb. Log. |
1989 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
Large Resplendent Models Generated by Indiscernibles. |
J. Symb. Log. |
1989 |
DBLP BibTeX RDF |
|
| 1 | 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 |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Matt Kaufmann, James H. Schmerl |
Remarks on Weak Notions of Saturation in Models of Peano Arithmetic. |
J. Symb. Log. |
1987 |
DBLP BibTeX RDF |
|
| 1 | Henry A. Kierstead, James H. Schmerl |
The chromatic number of graphs which induce neither K1, 3 nor K5-e. |
Discrete Mathematics |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry A. Kierstead, James H. Schmerl |
Some applications of Vizing's theorem to vertex colorings of graphs. |
Discrete Mathematics |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | James H. Schmerl, Stephen G. Simpson |
On the Role of Ramsey Quantifiers in First Order Arithmetic. |
J. Symb. Log. |
1982 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
Decidability and Finite Axiomatizability of Theories of 0-Categorical Partially Ordered Sets. |
J. Symb. Log. |
1981 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
Decidability and 0-Categoricity of Theories of Partially Ordered Sets. |
J. Symb. Log. |
1980 |
DBLP BibTeX RDF |
|
| 1 | Manuel Lerman, James H. Schmerl |
Theories with Recursive Models. |
J. Symb. Log. |
1979 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
An Axiomatization for a Class of Two-Cardinal Models. |
J. Symb. Log. |
1977 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
Generalizing Special Aronszajn Trees. |
J. Symb. Log. |
1974 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl, Saharon Shelah |
On Power-like Models for Hyperinaccessible Cardinals. |
J. Symb. Log. |
1972 |
DBLP BibTeX RDF |
|
| 1 | James H. Schmerl |
An Elementary Sentence which Has Ordered Models. |
J. Symb. Log. |
1972 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")