Currently displaying 1 – 8 of 8

Showing per page

Order by Relevance | Title | Year of publication

Countable partitions of the sets of points and lines

James Schmerl — 1999

Fundamenta Mathematicae

The following theorem is proved, answering a question raised by Davies in 1963. If L 0 L 1 L 2 . . . is a partition of the set of lines of n , then there is a partition n = S 0 S 1 S 2 . . . such that | S i | 2 whenever L i . There are generalizations to some other, higher-dimensional subspaces, improving recent results of Erdős, Jackson Mauldin.

On regular interstices and selective types in countable arithmetically saturated models of Peano Arithmetic

Teresa BigorajskaHenryk KotlarskiJames Schmerl — 1998

Fundamenta Mathematicae

We continue the earlier research of [1]. In particular, we work out a class of regular interstices and show that selective types are realized in regular interstices. We also show that, contrary to the situation above definable elements, the stabilizer of an element inside M(0) whose type is selective need not be maximal.

Covering the plane with sprays

James H. Schmerl — 2010

Fundamenta Mathematicae

For any three noncollinear points c₀,c₁,c₂ ∈ ℝ², there are sprays S₀,S₁,S₂ centered at c₀,c₁,c₂ that cover ℝ². This improves the result of de la Vega in which c₀,c₁,c₂ were required to be the vertices of an equilateral triangle.

Some 2-point sets

James H. Schmerl — 2010

Fundamenta Mathematicae

Chad, Knight & Suabedissen [Fund. Math. 203 (2009)] recently proved, assuming CH, that there is a 2-point set included in the union of countably many concentric circles. This result is obtained here without any additional set-theoretic hypotheses.

Page 1

Download Results (CSV)