Academic Thesis--Amsterdam. / Without thesis statement. Bibliography: p. 59-60.

Thesis (Ph. D.)--Oregon State University, 1986. / Typescript (photocopy). Includes bibliographical references (leaves 72-74). Also available on the World Wide Web.

Thesis (M.A.)--Boston University / A comprehensive study of proof of Green's theorem is presented. A classical approach to the proof of the theorem has been compared with a more generalized form of the proof. Chapter I is devoted to defining curves and regions. Definitions of a regular curve, a regular region, Jordan curve, and Jordan rectifiable curves are presented [TRUNCATED]

No description available.

Formal methods are techniques that are firmly based in mathematics, they can be used to specify and verify computer systems. Formal techniques offer many advantages, including correctness and productivity over less formal ones. Wide acceptance of these methods is hindered by their relatively difficult notations and theories. This thesis takes the view that the availability of usable tools that support formal techniques plays an important role in promoting their use by a wider community of software engineers.

No description available.

A unit resolution theorem proving system is developed and compared with the previous work of C.L. Chang. This thesis includes a description of a particular approach to unit resolution and a description of the resulting program and its effectiveness. / Science, Faculty of / Computer Science, Department of / Graduate

The problem of the automatic generation of logical consequences of a set of axioms is examined. The merging subsumption linear strategy has been shown complete with respect to that problem. A generalization of a set of support strategy is given, and the completeness of merging subsumption linear strategy with set of support is proved. The merging-linear-A-ordered strategy and the merging linear-C-ordered strategy have been shown to be incomplete. Relations between unit strategy and input strategy have been examined. A little review of the ‘interesting theorem’ is given. / Science, Faculty of / Computer Science, Department of / Graduate

"Of considerable interest among mathematicians is the problem of the determination of primality of positive integers. For a small integer, N, we may say that N is prime or composite merely by trying to divide N by all primes less than or equal to the square root of N since if N is composite, one of its factors must be [less than or equal to] the square root of N. However, if N is large this test loses its practicality and we must resort to a more feasible method. It is the purpose of this paper to trace and show the development of such methods"--Introduction. / "June, 1959." / Typescript. / "Submitted to the Graduate Council of Florida State University in partial fulfillment of the requirements for the degree of Master of Science." / Advisor: Paul J. McCarthy, Professor Directing Paper. / Includes bibliographical references (leaf 28).

No description available.