James H. Schmerl

发表

Fractional Products of Sets

Yuval Peres, Ron Blei, James H. Schmerl, 1995, Random Struct. Algorithms.

Moving Intersticial Gaps

James H. Schmerl, 2002, Math. Log. Q..

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

James H. Schmerl, Roman Kossak, Henryk Kotlarski, 1993, Ann. Pure Appl. Logic.

Infinite substructure lattices of models of Peano Arithmetic

James H. Schmerl, J. Schmerl, 1993, The Journal of Symbolic Logic.

An Elementary Sentence which Has Ordered Models

James H. Schmerl, 1972, J. Symb. Log..

Self-Embeddings of Computable Trees

James H. Schmerl, Manuel Lerman, Bjørn Kjos-Hanssen, 2008, Notre Dame J. Formal Log..

Automorphism Groups of Countable Arithmetically saturated Models of Peano Arithmetic

James H. Schmerl, 2015, J. Symb. Log..

Closed Normal Subgroups

James H. Schmerl, 2001, Math. Log. Q..

Generalizing special Aronszajn trees

James H. Schmerl, James H. Schmerl, 1974, Journal of Symbolic Logic.

Arithmetically Saturated Models of Arithmetic

James H. Schmerl, Roman Kossak, 1995, Notre Dame J. Formal Log..

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

James H. Schmerl, 1992, J. Comb. Theory, Ser. A.

Theories Having Finitely Many Countable Homogeneous Models

James H. Schmerl, 1986, Math. Log. Q..

Partitioning Euclidean space

James H. Schmerl, 1993, Discret. Comput. Geom..

Theories with recursive models

James H. Schmerl, Manuel Lerman, M. Lerman, 1979, Journal of Symbolic Logic.

Automorphism Groups of saturated Models of Peano Arithmetic

James H. Schmerl, Ermek S. Nurkhaidarov, 2014, J. Symb. Log..

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

James H. Schmerl, Roman Kossak, 1991, Notre Dame J. Formal Log..

Acceptable colorings of Indexed Hyperspaces

James H. Schmerl, 2018, J. Symb. Log..

Graph Coloring and Reverse Mathematics

James H. Schmerl, 2000, Math. Log. Q..

Recursively saturated models generated by indiscernibles

James H. Schmerl, 1985, Notre Dame J. Formal Log..

Decidability and ℵ0-categoricity of theories of partially ordered sets

James H. Schmerl, J. Schmerl, 1980, Journal of Symbolic Logic.

Partitioning large vector spaces

James H. Schmerl, 2003, J. Symb. Log..

Generic automorphisms and graph coloring

James H. Schmerl, 2005, Discret. Math..

Automorphism Groups of Models of Peano Arithmetic

James H. Schmerl, 2002, J. Symb. Log..

Making the Hyperreal Line Both Saturated and Complete

H. Jerome Keisler, James H. Schmerl, H. Keisler, 1991, J. Symb. Log..

On Power-like Models for Hyperinaccessible Cardinals

Saharon Shelah, James H. Schmerl, 1972, J. Symb. Log..

Large Resplendent Models Generated by Indiscernibles

James H. Schmerl, 1989, J. Symb. Log..

Reverse Mathematics and Grundy colorings of graphs

James H. Schmerl, 2010, Math. Log. Q..

PA(aa)

James H. Schmerl, 1995, Notre Dame J. Formal Log..

On the role of Ramsey quantifiers in first order arithmetic

Stephen G. Simpson, James H. Schmerl, S. G. Simpson, 1982, Journal of Symbolic Logic.

A Note on the Multiplicative Semigroup of Models of Peano Arithmetic

James H. Schmerl, Mark E. Nadel, Roman Kossak, 1989, J. Symb. Log..

End Extensions of Models of Arithmetic

James H. Schmerl, 1992, Notre Dame J. Formal Log..

Coinductive aleph0-Categorical Theories

James H. Schmerl, 1990, J. Symb. Log..

Recursive Models and the Divisibility Poset

James H. Schmerl, 1998, Notre Dame J. Formal Log..

Subsets coded in elementary end extensions

James H. Schmerl, 2014, Arch. Math. Log..

Minimal elementary end extensions

James H. Schmerl, 2017, Arch. Math. Log..

A weakly definable type which is not definable

James H. Schmerl, 1993, Arch. Math. Log..

Deciding the chromatic numbers of Algebraic hypergraphs

James H. Schmerl, 2018, J. Symb. Log..

Partially Ordered Sets and the Independence Property

James H. Schmerl, 1989, J. Symb. Log..

The Isomorphism Property for Nonstandard Universes

James H. Schmerl, 1995, J. Symb. Log..

Binary Relational Structures Having Only Countably Many Nonisomorphic Substructures

James H. Schmerl, Dugald Macpherson, 1991, J. Symb. Log..

Cofinal elementary extensions

James H. Schmerl, 2014, Math. Log. Q..

Difference Sets and Recursion Theory

James H. Schmerl, 1998, Math. Log. Q..

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

James H. Schmerl, 2018, Notre Dame J. Formal Log..

The automorphism group of a resplendent model

James H. Schmerl, 2012, Arch. Math. Log..

An Improvement to “A Note on Euclidean Ramsey Theory”

James H. Schmerl, 2010, Discret. Comput. Geom..

A Reflection Principle and its Applications to Nonstandard Models

James H. Schmerl, J. Schmerl, 1995, J. Symb. Log..

Chromatic numbers of algebraic hypergraphs

James H. Schmerl, J. Schmerl, 2014, Comb..

HOW TO CONTROL TYPES

James H. Schmerl, Roman Kossak, 2006 .

Obstacles to Extending Mirsky's Theorem

James H. Schmerl, 2002, Order.

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

James H. Schmerl, 2012, J. Symb. Log..

Elementary extensions of models of set theory

James H. Schmerl, 2000, Arch. Math. Log..

Elementary Cuts in Saturated Models of Peano Arithmetic

James H. Schmerl, 2012, Notre Dame J. Formal Log..

WHAT’S THE DIFFERENCE?

James H. Schmerl, J. Schmerl, Lars Aagaard-Mogensen, 2020, Thresholds.

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

Hal A. Kierstead, James H. Schmerl, H. Kierstead, 1983, Discret. Math..

A Note on Euclidean Ramsey Theory

James H. Schmerl, 2007, Discret. Comput. Geom..

A combinatorial result about points and balls in euclidean space

Jorge Urrutia, Stuart J. Sidney, James H. Schmerl, 1989, Discret. Comput. Geom..

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

James H. Schmerl, 2004, Math. Log. Q..

On Cofinal Submodels and Elementary Interstices

James H. Schmerl, Roman Kossak, 2012, Notre Dame J. Formal Log..

Remarks on Self-Extending Models

James H. Schmerl, 1976, Math. Log. Q..

An Axiomatization for a Class of Two-Cardinal Models

James H. Schmerl, 1977, J. Symb. Log..

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

William T. Trotter, James H. Schmerl, J. Schmerl, 1993, Discret. Math..

Tiling space with notched cubes

James H. Schmerl, 1994, Discret. Math..

The chromatic number of graphs which induce neither K1, 3 nor K5-e

Hal A. Kierstead, James H. Schmerl, H. Kierstead, 1986, Discret. Math..

Uncountable Real Closed Fields with PA Integer Parts

James H. Schmerl, Charles Steinhorn, David Marker, 2015, J. Symb. Log..

Some Highly Saturated Models of Peano Arithmetic

James H. Schmerl, 2002, J. Symb. Log..

Dividing a polygon into two similar polygons

James H. Schmerl, J. Schmerl, 2011, Discret. Math..

Remarks on Weak Notions of Saturation in Models of Peano Arithmetic

James H. Schmerl, Matt Kaufmann, 1987, J. Symb. Log..

The Two Points Theorem of Mazurkiewicz

James H. Schmerl, Péter Komjáth, 2002, J. Comb. Theory, Ser. A.

Nondiversity in substructures

James H. Schmerl, 2008, J. Symb. Log..

Saturation and simple extensions of models of peano arithmetic

James H. Schmerl, Matt Kaufmann, Matt Kaufmann, 1984, Ann. Pure Appl. Log..

Decidability and Finite Axiomatizability of Theories of 0-Categorical Partially Ordered Sets

James H. Schmerl, 1981, J. Symb. Log..

The Diversity of Minimal Cofinal Extensions

James H. Schmerl, 2021 .

Models of Peano Arithmetic and a question of Sikorski on ordered fields

James H. Schmerl, 1985 .

Countable homogeneous partially ordered sets

James H. Schmerl, J. Schmerl, 1979 .

Coinductive ℵ 0 -categorical theories

James H. Schmerl, 1990 .

The Structure of Models of Peano Arithmetic

James H. Schmerl, Roman Kossak, 2006 .

On κ-like structures which embed stationary and closed unbounded subsets

James H. Schmerl, 1976 .

Minimal spanning trees

James H. Schmerl, 2003 .

The undecidability of theories of groupoids with an extra predicate

James H. Schmerl, Solomon Garfunkel, 1974 .

ℵ₀-categorical distributive lattices of finite breadth

James H. Schmerl, 1983 .

Logic Year 1979–80

Robert I. Soare, James H. Schmerl, Manuel Lerman, 1981 .

Arborescent structures. II. Interpretability in the theory of trees

James H. Schmerl, J. Schmerl, 1981 .

A decidable $ℵ_0$-categorical theory with a non-recursive Ryll-Nardzewski function

James H. Schmerl, 1978 .

Recursion Theoretic Aspects of Graphs and Orders

James H. Schmerl, J. Schmerl, 1985 .

Reverse mathematics and graph coloring: eliminating diagonalization

Stephen G. Simpson, James H. Schmerl, S. G. Simpson, 2016 .

Jump number and width

James H. Schmerl, Pavol Hell, Weixuan Li, 1986 .

The Automorphism Group of an Arithmetically Saturated Model of Peano Arithmetic

James H. Schmerl, Roman Kossak, 1995 .

Recursively saturated, rather classless models of peano arithmetic

James H. Schmerl, 1981 .

Self-Embeddings of Computable Trees

James H. Schmerl, Manuel Lerman, Bjørn Kjos-Hanssen, 2008 .

Recursive colorings of graphs

James H. Schmerl, 1980 .

Decidability and Finite Axiomatizability of Theories of $\aleph_0$-Categorical Partially Ordered Sets

James H. Schmerl, 1981 .

ω-Models of finite set theory

James H. Schmerl, Albert Visser, Ali Enayat, 2008 .

Peano arithmetic and hyper-Ramsey logic

James H. Schmerl, 1986 .

A partition property characterizing cardinals hyperinaccessible of finite type

James H. Schmerl, 1974 .