#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1976

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- James H. Schmerl, William T. Trotter
- Discrete Mathematics
- 1993

- Manuel Lerman, James H. Schmerl
- J. Symb. Log.
- 1979

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

- Imre Bárány, James H. Schmerl, Stuart J. Sidney, Jorge Urrutia
- Discrete & Computational Geometry
- 1989

A theorem of Neumann-Lara and Urrutia [3] is generalized from the plane to arbitrary n-dimensional Euclidean space R n , solving Problem 2 of [3]. By an n-ball we mean a set of the form { Theorem 1. For each n ≥ 1 there is c n > 0 such that for any finite set X Õ R n there is A Õ X, |A| ≤ 1/ 2 (n+3) , having the following property: if B ⊇ A is an n-ball,… (More)

Finite set theory, here denoted ZF fin , is the theory obtained by replacing the axiom of infinity by its negation in the usual axiomatization of ZF (Zermelo-Fraenkel set theory). An ω-model of ZF fin is a model in which every set has at most finitely many elements (as viewed externally). Mancini and Zambella (2001) employed the Bernays-Rieger method of… (More)

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

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

- James H. Schmerl
- Discrete Mathematics
- 1994

- Hal A. Kierstead, James H. Schmerl
- Discrete Mathematics
- 1986

- Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon
- Notre Dame Journal of Formal Logic
- 2008

We divide the class of infinite computable trees into three types. For the first and second types, 0 computes a nontrivial self-embedding while for the third type 0 computes a nontrivial self-embedding. These results are optimal and we obtain partial results concerning the complexity of nontrivial self-embeddings of infinite computable trees considered up… (More)