James H. Schmerl

73 papers Journal 73

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	The pentagon as a Substructure Lattice of Models of Peano Arithmetic. J. Symb. Log. James H. Schmerl
2022	J	`jnl`	CP-generic expansions of models of Peano Arithmetic. Math. Log. Q. Athar Abdul-Quader, James H. Schmerl
2018	J	`jnl`	Acceptable colorings of Indexed Hyperspaces. J. Symb. Log. James H. Schmerl
2018	J	`jnl`	Deciding the chromatic numbers of Algebraic hypergraphs. J. Symb. Log. James H. Schmerl
2018	J	`jnl`	More Automorphism Groups of Countable, Arithmetically Saturated Models of Peano Arithmetic. Notre Dame J. Formal Log. James H. Schmerl
2017	J	`jnl`	Chromatic numbers of algebraic hypergraphs. Comb. James H. Schmerl
2017	J	`jnl`	Minimal elementary end extensions. Arch. Math. Log. James H. Schmerl
2015	J	`jnl`	Automorphism Groups of Countable Arithmetically saturated Models of Peano Arithmetic. J. Symb. Log. James H. Schmerl
2015	J	`jnl`	Uncountable Real Closed Fields with PA Integer Parts. J. Symb. Log. David Marker, James H. Schmerl, Charles Steinhorn
2014	J	`jnl`	Automorphism Groups of saturated Models of Peano Arithmetic. J. Symb. Log. Ermek S. Nurkhaidarov, James H. Schmerl
2014	J	`jnl`	Cofinal elementary extensions. Math. Log. Q. James H. Schmerl
2014	J	`jnl`	Subsets coded in elementary end extensions. Arch. Math. Log. James H. Schmerl
2012	J	`jnl`	A generalization of Sierpiński's paradoxical decompositions: Coloring semialgebraic grids. J. Symb. Log. James H. Schmerl
2012	J	`jnl`	Elementary Cuts in Saturated Models of Peano Arithmetic. Notre Dame J. Formal Log. James H. Schmerl
2012	J	`jnl`	On Cofinal Submodels and Elementary Interstices. Notre Dame J. Formal Log. Roman Kossak, James H. Schmerl
2012	J	`jnl`	The automorphism group of a resplendent model. Arch. Math. Log. James H. Schmerl
2011	J	`jnl`	Dividing a polygon into two similar polygons. Discret. Math. James H. Schmerl
2010	J	`jnl`	An Improvement to "A Note on Euclidean Ramsey Theory". Discret. Comput. Geom. James H. Schmerl
2010	J	`jnl`	Infinite substructure lattices of models of Peano Arithmetic. J. Symb. Log. James H. Schmerl
2010	J	`jnl`	Reverse Mathematics and Grundy colorings of graphs. Math. Log. Q. James H. Schmerl
2008	J	`jnl`	Nondiversity in substructures. J. Symb. Log. James H. Schmerl
2008	J	`jnl`	Self-Embeddings of Computable Trees. Notre Dame J. Formal Log. Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon
2007	J	`jnl`	A Note on Euclidean Ramsey Theory. Discret. Comput. Geom. James H. Schmerl
2005	J	`jnl`	Generic automorphisms and graph coloring. Discret. Math. James H. Schmerl
2004	J	`jnl`	Substructure lattices and almost minimal end extensions of models of Peano arithmetic. Math. Log. Q. James H. Schmerl
2003	J	`jnl`	Partitioning large vector spaces. J. Symb. Log. James H. Schmerl
2002	J	`jnl`	Automorphism Groups of Models of Peano Arithmetic. J. Symb. Log. James H. Schmerl
2002	J	`jnl`	Moving Intersticial Gaps. Math. Log. Q. James H. Schmerl
2002	J	`jnl`	Obstacles to Extending Mirsky's Theorem. Order James H. Schmerl
2002	J	`jnl`	Some Highly Saturated Models of Peano Arithmetic. J. Symb. Log. James H. Schmerl
2002	J	`jnl`	The Two Points Theorem of Mazurkiewicz. J. Comb. Theory A Péter Komjáth, James H. Schmerl
2001	J	`jnl`	Closed Normal Subgroups. Math. Log. Q. James H. Schmerl
2000	J	`jnl`	Elementary extensions of models of set theory. Arch. Math. Log. James H. Schmerl
2000	J	`jnl`	Graph Coloring and Reverse Mathematics. Math. Log. Q. James H. Schmerl
1998	J	`jnl`	Difference Sets and Recursion Theory. Math. Log. Q. James H. Schmerl
1998	J	`jnl`	Recursive Models and the Divisibility Poset. Notre Dame J. Formal Log. James H. Schmerl
1998	J	`jnl`	What's the Difference? Ann. Pure Appl. Log. James H. Schmerl
1995	J	`jnl`	A Reflection Principle and its Applications to Nonstandard Models. J. Symb. Log. James H. Schmerl
1995	J	`jnl`	Arithmetically Saturated Models of Arithmetic. Notre Dame J. Formal Log. Roman Kossak, James H. Schmerl
1995	J	`jnl`	Fractional Products of Sets. Random Struct. Algorithms Ron Blei, Yuval Peres, James H. Schmerl
1995	J	`jnl`	PA(aa). Notre Dame J. Formal Log. James H. Schmerl
1995	J	`jnl`	The Isomorphism Property for Nonstandard Universes. J. Symb. Log. James H. Schmerl
1994	J	`jnl`	The Regularity of Some 1-Additive Sequences. J. Comb. Theory A James H. Schmerl, Eugene Spiegel
1994	J	`jnl`	Tiling space with notched cubes. Discret. Math. James H. Schmerl
1993	J	`jnl`	A weakly definable type which is not definable. Arch. Math. Log. James H. Schmerl
1993	J	`jnl`	Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures. Discret. Math. James H. Schmerl, William T. Trotter
1993	J	`jnl`	On Maximal Subgroups of the Automorphism Group of a Countable Recursively Saturated Model of PA. Ann. Pure Appl. Logic Roman Kossak, Henryk Kotlarski, James H. Schmerl
1993	J	`jnl`	Partitioning Euclidean Space. Discret. Comput. Geom. James H. Schmerl
1992	J	`jnl`	A General Framework for Discovering and Proving Theorems of the Erdös-Ko-Rado Type. J. Comb. Theory A James H. Schmerl
1992	J	`jnl`	End Extensions of Models of Arithmetic. Notre Dame J. Formal Log. James H. Schmerl
1991	J	`jnl`	Binary Relational Structures Having Only Countably Many Nonisomorphic Substructures. J. Symb. Log. Dugald Macpherson, James H. Schmerl
1991	J	`jnl`	Making the Hyperreal Line Both Saturated and Complete. J. Symb. Log. H. Jerome Keisler, James H. Schmerl
1991	J	`jnl`	Minimal Satisfaction Classes with an Application to Rigid Models of Peano Arithmetic. Notre Dame J. Formal Log. Roman Kossak, James H. Schmerl
1990	J	`jnl`	Coinductive aleph J. Symb. Log. James H. Schmerl
1989	J	`jnl`	A Combinatorial Result About Points and Balls in Euclidean Space. Discret. Comput. Geom. Imre Bárány, James H. Schmerl, Stuart J. Sidney, Jorge Urrutia
1989	J	`jnl`	A Note on the Multiplicative Semigroup of Models of Peano Arithmetic. J. Symb. Log. Roman Kossak, Mark E. Nadel, James H. Schmerl
1989	J	`jnl`	Large Resplendent Models Generated by Indiscernibles. J. Symb. Log. James H. Schmerl
1989	J	`jnl`	Partially Ordered Sets and the Independence Property. J. Symb. Log. James H. Schmerl
1987	J	`jnl`	Remarks on Weak Notions of Saturation in Models of Peano Arithmetic. J. Symb. Log. Matt Kaufmann, James H. Schmerl
1986	J	`jnl`	The chromatic number of graphs which induce neither K Discret. Math. Henry A. Kierstead, James H. Schmerl
1986	J	`jnl`	Theories Having Finitely Many Countable Homogeneous Models. Math. Log. Q. James H. Schmerl
1985	J	`jnl`	Recursively saturated models generated by indiscernibles. Notre Dame J. Formal Log. James H. Schmerl
1984	J	`jnl`	Saturation and simple extensions of models of peano arithmetic. Ann. Pure Appl. Log. Matt Kaufmann, James H. Schmerl
1983	J	`jnl`	Some applications of Vizing's theorem to vertex colorings of graphs. Discret. Math. Henry A. Kierstead, James H. Schmerl
1982	J	`jnl`	On the Role of Ramsey Quantifiers in First Order Arithmetic. J. Symb. Log. James H. Schmerl, Stephen G. Simpson
1981	J	`jnl`	Decidability and Finite Axiomatizability of Theories of J. Symb. Log. James H. Schmerl
1980	J	`jnl`	Decidability and J. Symb. Log. James H. Schmerl
1979	J	`jnl`	Theories with Recursive Models. J. Symb. Log. Manuel Lerman, James H. Schmerl
1977	J	`jnl`	An Axiomatization for a Class of Two-Cardinal Models. J. Symb. Log. James H. Schmerl
1976	J	`jnl`	Remarks on Self-Extending Models. Math. Log. Q. James H. Schmerl
1974	J	`jnl`	Generalizing Special Aronszajn Trees. J. Symb. Log. James H. Schmerl
1972	J	`jnl`	An Elementary Sentence which Has Ordered Models. J. Symb. Log. James H. Schmerl
1972	J	`jnl`	On Power-like Models for Hyperinaccessible Cardinals. J. Symb. Log. James H. Schmerl, Saharon Shelah