James H. Schmerl

Publication Activity (10 Years)

Years Active: 1972-2022
Publications (10 Years): 6

Top Topics

Decomposition Methods

Default Theories

Top Venues

Arch. Math. Log.

Publications

Athar Abdul-Quader, James H. Schmerl
CP-generic expansions of models of Peano Arithmetic. Math. Log. Q. 68 (2) (2022)
James H. Schmerl
Deciding the chromatic numbers of Algebraic hypergraphs. J. Symb. Log. 83 (1) (2018)
James H. Schmerl
More Automorphism Groups of Countable, Arithmetically Saturated Models of Peano Arithmetic. Notre Dame J. Formal Log. 59 (4) (2018)
James H. Schmerl
Acceptable colorings of Indexed Hyperspaces. J. Symb. Log. 83 (4) (2018)
James H. Schmerl
Chromatic numbers of algebraic hypergraphs. Comb. 37 (5) (2017)
James H. Schmerl
Minimal elementary end extensions. Arch. Math. Log. 56 (5-6) (2017)
James H. Schmerl
Automorphism Groups of Countable Arithmetically saturated Models of Peano Arithmetic. J. Symb. Log. 80 (4) (2015)
David Marker, James H. Schmerl, Charles Steinhorn
Uncountable Real Closed Fields with PA Integer Parts. J. Symb. Log. 80 (2) (2015)
James H. Schmerl
Subsets coded in elementary end extensions. Arch. Math. Log. 53 (5-6) (2014)
Ermek S. Nurkhaidarov, James H. Schmerl
Automorphism Groups of saturated Models of Peano Arithmetic. J. Symb. Log. 79 (2) (2014)
James H. Schmerl
Cofinal elementary extensions. Math. Log. Q. 60 (1-2) (2014)
James H. Schmerl
A generalization of Sierpiński's paradoxical decompositions: Coloring semialgebraic grids. J. Symb. Log. 77 (4) (2012)
James H. Schmerl
Elementary Cuts in Saturated Models of Peano Arithmetic. Notre Dame J. Formal Log. 53 (1) (2012)
Roman Kossak, James H. Schmerl
On Cofinal Submodels and Elementary Interstices. Notre Dame J. Formal Log. 53 (3) (2012)
James H. Schmerl
The automorphism group of a resplendent model. Arch. Math. Log. 51 (5-6) (2012)
James H. Schmerl
Dividing a polygon into two similar polygons. Discret. Math. 311 (4) (2011)
James H. Schmerl
An Improvement to "A Note on Euclidean Ramsey Theory". Discret. Comput. Geom. 43 (2) (2010)
James H. Schmerl
Reverse Mathematics and Grundy colorings of graphs. Math. Log. Q. 56 (5) (2010)
James H. Schmerl
Infinite substructure lattices of models of Peano Arithmetic. J. Symb. Log. 75 (4) (2010)
Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon
Self-Embeddings of Computable Trees. Notre Dame J. Formal Log. 49 (1) (2008)
James H. Schmerl
Nondiversity in substructures. J. Symb. Log. 73 (1) (2008)
James H. Schmerl
A Note on Euclidean Ramsey Theory. Discret. Comput. Geom. 38 (1) (2007)
James H. Schmerl
Generic automorphisms and graph coloring. Discret. Math. 291 (1-3) (2005)
James H. Schmerl
Substructure lattices and almost minimal end extensions of models of Peano arithmetic. Math. Log. Q. 50 (6) (2004)
James H. Schmerl
Partitioning large vector spaces. J. Symb. Log. 68 (4) (2003)
James H. Schmerl
Some Highly Saturated Models of Peano Arithmetic. J. Symb. Log. 67 (4) (2002)
James H. Schmerl
Obstacles to Extending Mirsky's Theorem. Order 19 (2) (2002)
James H. Schmerl
Moving Intersticial Gaps. Math. Log. Q. 48 (2) (2002)
James H. Schmerl
Automorphism Groups of Models of Peano Arithmetic. J. Symb. Log. 67 (4) (2002)
Péter Komjáth, James H. Schmerl
The Two Points Theorem of Mazurkiewicz. J. Comb. Theory, Ser. A 99 (2) (2002)
James H. Schmerl
Closed Normal Subgroups. Math. Log. Q. 47 (4) (2001)
James H. Schmerl
Graph Coloring and Reverse Mathematics. Math. Log. Q. 46 (4) (2000)
James H. Schmerl
Elementary extensions of models of set theory. Arch. Math. Log. 39 (7) (2000)
James H. Schmerl
Difference Sets and Recursion Theory. Math. Log. Q. 44 (1998)
James H. Schmerl
What's the Difference? Ann. Pure Appl. Log. 93 (1-3) (1998)
James H. Schmerl
Recursive Models and the Divisibility Poset. Notre Dame J. Formal Log. 39 (1) (1998)
James H. Schmerl
PA(aa). Notre Dame J. Formal Log. 36 (4) (1995)
Ron Blei, Yuval Peres, James H. Schmerl
Fractional Products of Sets. Random Struct. Algorithms 6 (1) (1995)
Roman Kossak, James H. Schmerl
Arithmetically Saturated Models of Arithmetic. Notre Dame J. Formal Log. 36 (4) (1995)
James H. Schmerl
A Reflection Principle and its Applications to Nonstandard Models. J. Symb. Log. 60 (4) (1995)
James H. Schmerl
The Isomorphism Property for Nonstandard Universes. J. Symb. Log. 60 (2) (1995)
James H. Schmerl
Tiling space with notched cubes. Discret. Math. 133 (1-3) (1994)
James H. Schmerl, Eugene Spiegel
The Regularity of Some 1-Additive Sequences. J. Comb. Theory, Ser. A 66 (1) (1994)
James H. Schmerl, William T. Trotter
Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures. Discret. Math. 113 (1-3) (1993)
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) (1993)
James H. Schmerl
A weakly definable type which is not definable. Arch. Math. Log. 32 (6) (1993)
James H. Schmerl
Partitioning Euclidean Space. Discret. Comput. Geom. 10 (1993)
James H. Schmerl
End Extensions of Models of Arithmetic. Notre Dame J. Formal Log. 33 (2) (1992)
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) (1992)
Roman Kossak, James H. Schmerl
Minimal Satisfaction Classes with an Application to Rigid Models of Peano Arithmetic. Notre Dame J. Formal Log. 32 (3) (1991)
Dugald Macpherson, James H. Schmerl
Binary Relational Structures Having Only Countably Many Nonisomorphic Substructures. J. Symb. Log. 56 (3) (1991)
H. Jerome Keisler, James H. Schmerl
Making the Hyperreal Line Both Saturated and Complete. J. Symb. Log. 56 (3) (1991)
James H. Schmerl
-Categorical Theories. J. Symb. Log. 55 (3) (1990)
James H. Schmerl
Partially Ordered Sets and the Independence Property. J. Symb. Log. 54 (2) (1989)
James H. Schmerl
Large Resplendent Models Generated by Indiscernibles. J. Symb. Log. 54 (4) (1989)
Imre Bárány, James H. Schmerl, Stuart J. Sidney, Jorge Urrutia
A Combinatorial Result About Points and Balls in Euclidean Space. Discret. Comput. Geom. 4 (1989)
Roman Kossak, Mark E. Nadel, James H. Schmerl
A Note on the Multiplicative Semigroup of Models of Peano Arithmetic. J. Symb. Log. 54 (3) (1989)
Matt Kaufmann, James H. Schmerl
Remarks on Weak Notions of Saturation in Models of Peano Arithmetic. J. Symb. Log. 52 (1) (1987)
Henry A. Kierstead, James H. Schmerl
-e. Discret. Math. 58 (3) (1986)
James H. Schmerl
Theories Having Finitely Many Countable Homogeneous Models. Math. Log. Q. 32 (7-9) (1986)
James H. Schmerl
Recursively saturated models generated by indiscernibles. Notre Dame J. Formal Log. 26 (2) (1985)
Matt Kaufmann, James H. Schmerl
Saturation and simple extensions of models of peano arithmetic. Ann. Pure Appl. Log. 27 (2) (1984)
Henry A. Kierstead, James H. Schmerl
Some applications of Vizing's theorem to vertex colorings of graphs. Discret. Math. 45 (2-3) (1983)
James H. Schmerl, Stephen G. Simpson
On the Role of Ramsey Quantifiers in First Order Arithmetic. J. Symb. Log. 47 (2) (1982)
James H. Schmerl
-Categorical Partially Ordered Sets. J. Symb. Log. 46 (1) (1981)
James H. Schmerl
-Categoricity of Theories of Partially Ordered Sets. J. Symb. Log. 45 (3) (1980)
Manuel Lerman, James H. Schmerl
Theories with Recursive Models. J. Symb. Log. 44 (1) (1979)
James H. Schmerl
An Axiomatization for a Class of Two-Cardinal Models. J. Symb. Log. 42 (2) (1977)
James H. Schmerl
Remarks on Self-Extending Models. Math. Log. Q. 22 (1) (1976)
James H. Schmerl
Generalizing Special Aronszajn Trees. J. Symb. Log. 39 (4) (1974)
James H. Schmerl, Saharon Shelah
On Power-like Models for Hyperinaccessible Cardinals. J. Symb. Log. 37 (3) (1972)
James H. Schmerl
An Elementary Sentence which Has Ordered Models. J. Symb. Log. 37 (3) (1972)