# James H. Schmerl

Orcid: 0000-0003-0545-8339
According to our database

Collaborative distances:

^{1}, James H. Schmerl authored at least 72 papers between 1972 and 2022.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2022

Math. Log. Q., 2022

2018

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

Notre Dame J. Formal Log., 2018

J. Symb. Log., 2018

J. Symb. Log., 2018

2017

Comb., 2017

Arch. Math. Log., 2017

2015

Automorphism Groups of Countable Arithmetically saturated Models of Peano Arithmetic.

J. Symb. Log., 2015

J. Symb. Log., 2015

2014

Math. Log. Q., 2014

J. Symb. Log., 2014

Arch. Math. Log., 2014

2012

Notre Dame J. Formal Log., 2012

Notre Dame J. Formal Log., 2012

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

J. Symb. Log., 2012

Arch. Math. Log., 2012

2011

Discret. Math., 2011

2010

Math. Log. Q., 2010

J. Symb. Log., 2010

Discret. Comput. Geom., 2010

2008

Notre Dame J. Formal Log., 2008

J. Symb. Log., 2008

2007

Discret. Comput. Geom., 2007

2005

Discret. Math., 2005

2004

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

Math. Log. Q., 2004

2003

J. Symb. Log., 2003

2002

Order, 2002

Math. Log. Q., 2002

J. Symb. Log., 2002

J. Symb. Log., 2002

J. Comb. Theory A, 2002

2001

Math. Log. Q., 2001

2000

Math. Log. Q., 2000

Arch. Math. Log., 2000

1998

Notre Dame J. Formal Log., 1998

Math. Log. Q., 1998

Ann. Pure Appl. Log., 1998

1995

Random Struct. Algorithms, 1995

Notre Dame J. Formal Log., 1995

Notre Dame J. Formal Log., 1995

J. Symb. Log., 1995

J. Symb. Log., 1995

1994

The Regularity of Some 1-Additive Sequences.

J. Comb. Theory A, 1994

Discret. Math., 1994

1993

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

Discret. Math., 1993

Discret. Comput. Geom., 1993

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

Ann. Pure Appl. Logic, 1993

Arch. Math. Log., 1993

1992

Notre Dame J. Formal Log., 1992

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

J. Comb. Theory A, 1992

1991

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

Notre Dame J. Formal Log., 1991

Binary Relational Structures Having Only Countably Many Nonisomorphic Substructures.

J. Symb. Log., 1991

J. Symb. Log., 1991

1990

J. Symb. Log., 1990

1989

J. Symb. Log., 1989

J. Symb. Log., 1989

J. Symb. Log., 1989

Discret. Comput. Geom., 1989

1987

J. Symb. Log., 1987

1986

Math. Log. Q., 1986

The chromatic number of graphs which induce neither K<sub>1, 3</sub> nor K<sub>5</sub>-e.

Discret. Math., 1986

1985

Notre Dame J. Formal Log., 1985

1984

Ann. Pure Appl. Log., 1984

1983

Discret. Math., 1983

1982

J. Symb. Log., 1982

1981

Decidability and Finite Axiomatizability of Theories of <sub>0</sub>-Categorical Partially Ordered Sets.

J. Symb. Log., 1981

1980

J. Symb. Log., 1980

1979

J. Symb. Log., 1979

1977

J. Symb. Log., 1977

1976

Math. Log. Q., 1976

1974

J. Symb. Log., 1974

1972

J. Symb. Log., 1972

J. Symb. Log., 1972