Global ETD Search

31	Physiologically based pharmacokinetic modeling in risk assessment : development of Bayesian population methods / Jonsson, Fredrik, January 1900 (has links) Diss. (sammanfattning) Uppsala : Univ., 2001. / Härtill 5 uppsatser. Bayes theorem. Yrkesmedicin.
32	Limit recursion and Gödel's incompleteness theorem / Randall, Allan F. January 2006 (has links) Thesis (M.A.)--York University, 2006. Graduate Programme in Philosophy. / Typescript. Includes bibliographical references (leaves 125-133). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR29605 Gödel's theorem. Recursive functions.
33	A method in proofs of undefinability with applications to functions in the arithmetic of natural numbers. Bouvère, Karel Louis de. January 1959 (has links) Academic Thesis--Amsterdam. / Without thesis statement. Bibliography: p. 59-60.
34	Central limit theorems for associated random fields with applications / Kim, Tae-sung, January 1985 (has links) Thesis (Ph. D.)--Oregon State University, 1986. / Typescript (photocopy). Includes bibliographical references (leaves 72-74). Also available on the World Wide Web. Central limit theorem.
35	Green's theorem and Jordan rectifiable curve Moon, Yonghyo Jun January 1963 (has links) 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] Mathematics Green's theorem
36	A novel term rewriting strategy for certain hierarchical AC-algebraic systems Okoli, Ifeyinwa January 1989 (has links) No description available. 510 Theorem proving
37	Formal software development tools : an investigation into usability Kadoda, Gada F. January 1997 (has links) 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. 005 Theorem provers
38	Some application of the virial theorem and its generalizations Bangadu, Ezekiel Adeniyi January 1966 (has links) No description available. Virial theorem ; Quantum theory
39	A unit resolution theorem proving system LeQuesne, Peter Neave January 1972 (has links) 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 Automatic theorem proving.
40	On the completeness of linear strategies in automatic consequence finding Minicozzi, Eliana January 1972 (has links) 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 Automatic theorem proving.

Search results