Davis, soldier missionary : a biography of Rev. Jerome D. Davis, D.D., Lieut-Colonel of volunteers and for thirty-nine years a missionary of the American Board of Commissioners for Foreign Missions in Japan

http://www.archive.org/details/davissoldiermiss00davirich

Memorial volume of the first fifty years of the American board of commissioners for foreign missions.

http://www.archive.org/details/memorialvolumeof00andeuoft

Constitution, laws and regulations of the American Board of Commissioners for Foreign Missions.

http://www.archive.org/details/constitutionlaws00ameriala

By-paths to forgotten folks; stories of real life in Baptist home mission fields, by Coe Hayne. Ed. by the Department of missionary education, Board of education of the Northern Baptist convention.

http://www.archive.org/details/bypathstoforgott00haynrich

First ten annual reports of the American Board of Commissioners for Foreign Missions : with other documents of the Board.

http://www.archive.org/details/firsttenannualre00amerrich

Memorial volume of the first fifty years of the American Board of Commissioners for Foreign Missions

http://www.archive.org/details/memorialvolumeof00andeiala

Seventy-five years in the Madura Mission : a history of the mission in South India under the American Board of Commissioners for Foreign Missions, Boston, Massachusetts, U.S.A. / by John S. Chandler.

http://www.archive.org/details/75yearsmadurami00chanuoft

An Infinite Pebble Game and Applications

We generalize the well-known pebble game to infinite dag's, and we use this generalization to give new and shorter proofs of results in different areas of computer science (as diverse as "logic of programs" and "formal language theory"). Our applications here include a proof of a theorem due to Salomaa, asserting the existence of a context-free language with infinite index, and a proof of a theorem due to Tiuryn and Erimbetov, asserting that unbounded memory increases the power of logics of programs. The original proofs by Salomaa, Tiuryn, and Erimbetov, are fairly technical. The proofs by Tiuryn and Erimbetov also involve advanced techniques of model theory, namely, back-and-forth constructions based on a variant of Ehrenfeucht-Fraisse games. By contrast, our proofs are not only shorter, but also elementary. All we need is essentially finite induction and, in the case of the Tiuryn-Erimbetov result, the compactness and completeness of first-order logic.