The church in Corea by Mark Napier Trollope, Bp. of Korea

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

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

A modern pioneer in Korea the life story of Henry G. Appenzeller

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

For the faith, life of Just de Brenteniáeres, martyred in Korea, March 8, 1866; adapted from the French of C. Appert, by Florence Gilmore.

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

The island empire of the East : being a short history of Japan and missionary work therein with special reference to the mission of the M.S.C.C. / by Rev. J. Cooper Robinson ; with an introduction by the lord bishop of Algoma.

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

Japanese women speak : a message from the Christian women of Japan to the Christian women of America / by Michi Kawai, Ochimi Kubushiro ; cover design and frontispiece by the Japanese artist Rokuyåo.

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

An Examination of a Church-Based Recovery Program on the Quality of Physical and Spiritual Life of Mentally Ill Persons in Korea

This study explores the effectiveness of a Church-based recovery program for the mentally ill in Korea where many Christian communities view mental illness as evidence of sin. Building on theological and psychological literature, an empirical study was conducted with participants in the alternative program of the Han-ma-um community. Data analysis revealed that this program, which views mental disorders as illness rather than sin, helps participants build self-respect and enables families to provide support as they move toward recovery. Based on this empirical examination, recommendations for refinement and expansion of the program and avenues for future research are proposed.

Fixed Point vs. First-Order Logic on Finite Ordered Structures with Unary Relations

We prove that first order logic is strictly weaker than fixed point logic over every infinite classes of finite ordered structures with unary relations: Over these classes there is always an inductive unary relation which cannot be defined by a first-order formula, even when every inductive sentence (i.e., closed formula) can be expressed in first-order over this particular class. Our proof first establishes a property valid for every unary relation definable by first-order logic over these classes which is peculiar to classes of ordered structures with unary relations. In a second step we show that this property itself can be expressed in fixed point logic and can be used to construct a non-elementary unary relation.

Efficient Support for Common Relations in Lightweight Formal Reasoning Systems

In work that involves mathematical rigor, there are numerous benefits to adopting a representation of models and arguments that can be supplied to a formal reasoning or verification system: reusability, automatic evaluation of examples, and verification of consistency and correctness. However, accessibility has not been a priority in the design of formal verification tools that can provide these benefits. In earlier work [Lap09a], we attempt to address this broad problem by proposing several specific design criteria organized around the notion of a natural context: the sphere of awareness a working human user maintains of the relevant constructs, arguments, experiences, and background materials necessary to accomplish the task at hand. This work expands one aspect of the earlier work by considering more extensively an essential capability for any formal reasoning system whose design is oriented around simulating the natural context: native support for a collection of mathematical relations that deal with common constructs in arithmetic and set theory. We provide a formal definition for a context of relations that can be used to both validate and assist formal reasoning activities. We provide a proof that any algorithm that implements this formal structure faithfully will necessary converge. Finally, we consider the efficiency of an implementation of this formal structure that leverages modular implementations of well-known data structures: balanced search trees and transitive closures of hypergraphs.