609 research outputs found

    The use of data-mining for the automatic formation of tactics

    Get PDF
    This paper discusses the usse of data-mining for the automatic formation of tactics. It was presented at the Workshop on Computer-Supported Mathematical Theory Development held at IJCAR in 2004. The aim of this project is to evaluate the applicability of data-mining techniques to the automatic formation of tactics from large corpuses of proofs. We data-mine information from large proof corpuses to find commonly occurring patterns. These patterns are then evolved into tactics using genetic programming techniques

    Existence, knowledge & truth in mathematics

    Get PDF
    This thesis offers an overview of some current work in the philosophy of mathematics, in particular of work on the metaphysical, epistemological, and semantic problems associated with mathematics, and it also offers a theory about what type of entities numbers are. Starting with a brief look at the historical and philosophical background to the problems of knowledge of mathematical facts and entities, the thesis then tackles in depth, and ultimately rejects as flawed, the work in this area of Hartry Field, Penelope Maddy, Jonathan Lowe, John Bigelow, and also some aspects of the work of Philip Kitcher and David Armstrong. Rejecting both nominalism and physicalism, but accepting accounts from Bigelow and Armstrong that numbers can be construed as relations, the view taken in this work is that mathematical objects, numbers in particular, are universals, and as such are mind dependent entities. It is important to the arguments leading to this conception of mathematical objects, that there is a notion of aspectual seeing involved in mathematical conception. Another important feature incorporated is the notion, derived from Anscombe, of an intentional object. This study finishes by sketching what appears to be a fruitful line of enquiry with some significant advantages over the other accounts discussed. The line taken is that the natural numbers are mind dependent intentional relations holding between intentional individuals, and that other classes of number - the rationals, the reals, and so on - are mind dependent intentional relations holding between other intentional relations. The distinction in type between the natural numbers and the rest, is the intuitive one that is drawn naturally in language between the objects referred to by the so-called count nouns, and the objects referred to by the so-called mass nouns

    Hilbert's thesis : some considerations about formalizations of mathematics

    Get PDF
    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 1982.MICROFICHE COPY AVAILABLE IN ARCHIVES AND HUMANITIESBibliography: leaves 175-176.by Lon A. Berk.Ph.D

    From axiomatization to generalizatrion of set theory

    Get PDF
    The thesis examines the philosophical and foundational significance of Cohen's Independence results. A distinction is made between the mathematical and logical analyses of the "set" concept. It is argued that topos theory is the natural generalization of the mathematical theory of sets and is the appropriate foundational response to the problems raised by Cohen's results. The thesis is divided into three parts. The first is a discussion of the relationship between "informal" mathematical theories and their formal axiomatic realizations this relationship being singularly problematic in the case of set theory. The second part deals with the development of the set concept within the mathemtical approach. In particular Skolem's reformulation of Zermlelo's notion of "definite properties". In the third part an account is given of the emergence and development of topos theory. Then the considerations of the first two parts are applied to demonstrate that the shift to topos theory, specifically in its guise of LST (local set theory), is the appropriate next step in the evolution of the concept of set, within the mathematical approach, in the light of the significance of Cohen's Independence results

    The continuum hypothesis : independence and truth-value

    Get PDF
    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Philosophy, 1974.MIT Humanities Library copy: issued in two vols.Leaf number 84 used twice. Also issued as a two-volume set.Includes bibliographical references (leaves 217-258).by Thomas S. Weston.Ph.D

    Glosarium Matematika

    Get PDF
    273 p.; 24 cm

    The Universality Problem

    Get PDF
    The theme of this thesis is to explore the universality problem in set theory in connection to model theory, to present some methods for finding universality results, to analyse how these methods were applied, to mention some results and to emphasise some philosophical interrogations that these aspects entail. A fundamental aspect of the universality problem is to find what determines the existence of universal objects. That means that we have to take into consideration and examine the methods that we use in proving their existence or nonexistence, the role of cardinal arithmetic, combinatorics etc. The proof methods used in the mathematical part will be mostly set-theoretic, but some methods from model theory and category theory will also be present. A graph might be the simplest, but it is also one of the most useful notions in mathematics. We show that there is a faithful functor F from the category L of linear orders to the category G of graphs that preserves model theoretic-related universality results (classes of objects having universal models in exactly the same cardinals, and also having the same universality spectrum). Trees constitute combinatorial objects and have a central role in set theory. The universality of trees is connected to the universality of linear orders, but it also seems to present more challenges, which we survey and present some results. We show that there is no embedding between an ā„µ2-Souslin tree and a non-special wide ā„µ2 tree T with no cofinal branches. Furthermore, using the notion of ascent path, we prove that the class of non-special ā„µ2-Souslin tree with an Ļ‰-ascent path a has maximal complexity number, 2ā„µ2 = ā„µ3. Within the general framework of the universality problem in set theory and model theory, while emphasising their approaches and their connections with regard to this topic, we examine the possibility of drawing some philosophical conclusions connected to, among others, the notions of mathematical knowledge, mathematical object and proof
    • ā€¦
    corecore