The following pages link to James H. Schmerl (Q190265):
Displayed 50 items.
- Subsets coded in elementary end extensions (Q403405) (← links)
- Elementary cuts in saturated models of Peano arithmetic (Q424574) (← links)
- The automorphism group of a resplendent model (Q453194) (← links)
- Dividing a polygon into two similar polygons (Q626758) (← links)
- The two points theorem of Mazurkiewicz (Q696919) (← links)
- Obstacles to extending Mirsky's theorem (Q698450) (← links)
- Item:Q190265 (redirect page) (← links)
- Isomorphic incidence algebras (Q757451) (← links)
- Saturation and simple extensions of models of Peano arithmetic (Q762144) (← links)
- A remark on a theorem of Erdős (Q783233) (← links)
- Item:Q190265 (redirect page) (← links)
- On the size of jump-critical ordered sets (Q802585) (← links)
- An improvement to ``A note on Euclidean Ramsey theory'' (Q848663) (← links)
- Self-embeddings of computable trees (Q1049747) (← links)
- Models of Peano arithmetic and a question of Sikorski on ordered fields (Q1065791) (← links)
- Ordered sets with small width and large jump number (Q1074605) (← links)
- The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\) (Q1078192) (← links)
- Jump number and width (Q1103654) (← links)
- A combinatorial result about points and balls in Euclidean space (Q1120834) (← links)
- Countable homogeneous partially ordered sets (Q1134166) (← links)
- On \(\aleph_0\)-categoricity of filtered Boolean extensions (Q1135845) (← links)
- Correction to ''Peano models with many generic classes'' (Q1152360) (← links)
- Recursively saturated models generated by indiscernibles (Q1165236) (← links)
- Minimal satisfaction classes with an application to rigid models of Peano arithmetic (Q1182707) (← links)
- A general framework for discovering and proving theorems of the Erdős- Ko-Rado type (Q1200000) (← links)
- End extensions of models of arithmetic (Q1203781) (← links)
- Theories with only a finite number of existentially complete models (Q1243712) (← links)
- What's the difference (Q1295379) (← links)
- A weakly definable type which is not definable (Q1313603) (← links)
- On maximal subgroups of the automorphism group of a countable recursively saturated model of PA (Q1314639) (← links)
- The regularity of some 1-additive sequences (Q1323839) (← links)
- The order dimension of relatively free lattices (Q1325967) (← links)
- Tiling space with notched cubes (Q1336703) (← links)
- More automorphism groups of countable, arithmetically saturated models of Peano arithmetic (Q1633892) (← links)
- On cofinal submodels and elementary interstices (Q1762352) (← links)
- Generic automorphisms and graph coloring (Q1772278) (← links)
- Some applications of Vizing's theorem to vertex colorings of graphs (Q1839256) (← links)
- Arithmetically saturated models of arithmetic (Q1913628) (← links)
- \(\text{PA} (aa)\) (Q1913630) (← links)
- Chromatic numbers of algebraic hypergraphs (Q1990885) (← links)
- The diversity of minimal cofinal extensions (Q2108579) (← links)
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures (Q2366019) (← links)
- A note on Euclidean Ramsey theory (Q2385141) (← links)
- Minimal elementary end extensions (Q2402959) (← links)
- Peano models with many generic classes (Q2562079) (← links)
- Coloring ${\mathbb R}^n$ (Q2759050) (← links)
- (Q2765571) (← links)
- Semialgebraic graphs having countable list-chromatic numbers (Q2790252) (← links)
- AUTOMORPHISM GROUPS OF COUNTABLE ARITHMETICALLY SATURATED MODELS OF PEANO ARITHMETIC (Q2795926) (← links)
- AUTOMORPHISM GROUPS OF SATURATED MODELS OF PEANO ARITHMETIC (Q2921010) (← links)