Vol. 115, No. 1, 1984

Recent Issues
Vol. 335: 1
Vol. 334: 1  2
Vol. 334: 1
Vol. 333: 1  2
Vol. 332: 1  2
Vol. 331: 1  2
Vol. 330: 1  2
Vol. 329: 1  2
Online Archive
Volume:
Issue:
     
The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Officers
 
Subscriptions
 
ISSN 1945-5844 (electronic)
ISSN 0030-8730 (print)
 
Special Issues
Author index
To appear
 
Other MSP journals
Recursively enumerable sets and van der Waerden’s theorem on arithmetic progressions

Carl Groos Jockusch, Jr. and Iraj Kalantari

Vol. 115 (1984), No. 1, 143–153
Abstract

Subsets of the set ω of nonnegative integers which possess some algebraic structure are interesting since they are most likely to give number-theoretic information. Arithmetic progressions are one of the simplest structures to observe. Effectiveness of any kind of information is of course an important factor. It seems that a study of possible interrelationships between combinatoric and number-theoretic properties of recursively enumerable (r.e.) subsets of ω might be interesting. In this paper we study van der Waerden’s theorem on arithmetic progressions in this light.

Mathematical Subject Classification 2000
Primary: 03D80
Secondary: 03D25, 03F65, 11B25
Milestones
Received: 21 December 1982
Published: 1 November 1984
Authors
Carl Groos Jockusch, Jr.
Iraj Kalantari