Spelling suggestions: "subject:"heorem"" "subject:"atheorem""
21 |
Mechanising heterogeneous reasoning in theorem proversUrbas, Matej January 2014 (has links)
No description available.
|
22 |
Exploring Agreeability in Tree SocietiesFletcher, Sarah 01 May 2009 (has links)
Let S be a collection of convex sets in Rd with the property that any subcollection of d − 1 sets has a nonempty intersection. Helly’s Theorem states that ∩s∈S S is nonempty. In a forthcoming paper, Berg et al. (Forthcoming) interpret the one dimensional version of Helly’s Theorem in the context of voting in a society. They look at the effect that different intersection properties have on the proportion of a society that must agree on some point or issue. In general, we define a society as some underlying space X and a collection S of convex sets on the space. A society is (k, m)-agreeable if every m-element subset of S has a k-element subset with a nonempty intersection. The agreement number of a society is the size of the largest subset of S with a nonempty intersection. In my work I focus on the case where X is a tree and the convex sets in S are subtrees. I have developed a reduction method that makes these tree societies more tractable. In particular, I have used this method to show that the agreement number of (2, m)-agreeable tree societies is at least 1 |S | and 3 that the agreement number of (k, k + 1)-agreeable tree societies is at least |S|−1.
|
23 |
Generating pseudo-random theorems for testing theorem proversDarwish, Nevin Mahmoud, 1952- January 1978 (has links)
No description available.
|
24 |
Dimension of certain cleft binomial rings /Montgomery, Martin, January 2006 (has links)
Thesis (Ph. D.)--University of Oregon, 2006. / Typescript. Includes vita and abstract. Includes bibliographical references (leaf 77). Also available for download via the World Wide Web; free to University of Oregon users.
|
25 |
A method in proofs of undefinability with applications to functions in the arithmetic of natural numbers.Bouvère, Karel Louis de. January 1959 (has links)
Academic Thesis--Amsterdam. / Without thesis statement. Bibliography: p. 59-60.
|
26 |
Hyperresolution for resolution logicsGhazizadeh, Behrad. January 1999 (has links)
Thesis (M. Sc.)--York University, 1999. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 76-77). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://wwwlib.umi.com/cr/yorku/fullcit?pMQ39193.
|
27 |
Should the Pythagorean Theorem Actually be Called the 'Pythagorean' TheoremMoledina, Amreen 05 December 2013 (has links)
This paper investigates whether it is reasonable to bestow credit to one person or group for the famed theorem that relates to the side lengths of any right-angled triangle, a theorem routinely referred to as the “Pythagorean Theorem”. The author investigates the first-documented occurrences of the theorem, along with its first proofs. In addition, proofs that stem from different branches of mathematics and science are analyzed in an effort to display that credit for the development of the theorem should be shared amongst its many contributors rather than crediting the whole of the theorem to one man and his supporters.
|
28 |
Generating pseudo-random theorems for testing theorem proversDarwish, Nevin Mahmoud, 1952- January 1978 (has links)
No description available.
|
29 |
Physiologically based pharmacokinetic modeling in risk assessment : development of Bayesian population methods /Jonsson, Fredrik, January 1900 (has links)
Diss. (sammanfattning) Uppsala : Univ., 2001. / Härtill 5 uppsatser.
|
30 |
Limit recursion and Gö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
|
Page generated in 0.0242 seconds