To see the other types of publications on this topic, follow the link: Foundations of mathematics.
Dissertations / Theses on the topic 'Foundations of mathematics'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Foundations of mathematics.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Uzquiano, Gabriel 1968. "Ontology and the foundations of mathematics." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/9370.
Full textAbstract:
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 1999.Includes bibliographical references.
"Ontology and the Foundations of Mathematics" consists of three papers concerned with ontological issues in the foundations of mathematics. Chapter 1, "Numbers and Persons," confronts the problem of the inscrutability of numerical reference and argues that, even if inscrutable, the reference of the numerals, as we ordinarily use them, is determined much more, precisely than up to isomorphism. We argue that the truth conditions of a variety of numerical modal and counterfactual sentences (whose acceptance plays a crucial role in applications) place serious constraints on the sorts of items to which numerals, as we ordinarily use them, can be taken to refer: Numerals cannot be taken to refer to objects that exist contingently such as people, mountains, or rivers, but rather must be taken to refer to objects that exist necessarily such as abstracta. Chapter 2, "Modern Set Theory and Replacement," takes up a challenge to explain the reasons one should accept the axiom of replacement of Zermelo-Fraenkel set theory, when its applications within ordinary mathematics and the rest of science are often described as rare and recondite. We argue that this is not a question one should be interested in; replacement is required to ensure that the element-set relation is well-founded as well as to ensure that the cumulation of sets described by set theory reaches and proceeds beyond the level w of the cumulative hierarchy. A more interesting question is whether we should accept instances of replacement on uncountable sets, for these are indeed rarely used outside higher set theory. We argue that the best case for (uncountable) replacement comes not from direct, intuitive considerations, but from the role replacement plays in the formulation of transfinite recursion and the theory of ordinals, and from the fact that it permits us to express and assert the (first-order) content of the modern cumulative view of the set theoretic universe as arrayed in a cumulative hierarchy of levels. Chapter 3, "A No-Class Theory of Classes," makes use of the apparatus of plural quantification to construe talk of classes as plural talk about sets, and thus provide an interpretation of both one- and two-sorted versions of first-order Morse-Kelley set theory, an impredicative theory of classes. We argue that the plural interpretation of impredicative theories of classes has a number of advantages over more traditional interpretations of the language of classes as involving singular reference to gigantic set-like entities, only too encompassing to be sets, the most important of these being perhaps that it makes the machinery of classes available for the formalization of much recent and very interesting work in set theory without threatening the universality of the theory as the most comprehensive theory of collections, when these are understood as objects.
by Gabriel Uzquiano.
Ph.D.
2
Frovin, Jørgensen Klaus. "Kant's schematism and the foundations of mathematics /." Roskilde : Section Philosophy and Science Studies, Roskilde University, 2005. http://hdl.handle.net/1800/1664.
Full text
3
Nefdt, Ryan Mark. "The foundations of linguistics : mathematics, models, and structures." Thesis, University of St Andrews, 2016. http://hdl.handle.net/10023/9584.
Full textAbstract:
The philosophy of linguistics is a rich philosophical domain which encompasses various disciplines. One of the aims of this thesis is to unite theoretical linguistics, the philosophy of language, the philosophy of science (particularly mathematics and modelling) and the ontology of language. Each part of the research presented here targets separate but related goals with the unified aim of bringing greater clarity to the foundations of linguistics from a philosophical perspective. Part I is devoted to the methodology of linguistics in terms of scientific modelling. I argue against both the Conceptualist and Platonist (as well as Pluralist) interpretations of linguistic theory by means of three grades of mathematical involvement for linguistic grammars. Part II explores the specific models of syntactic and semantics by an analogy with the harder sciences. In Part III, I develop a novel account of linguistic ontology and in the process comment on the type-token distinction, the role and connection with mathematics and the nature of linguistic objects. In this research, I offer a structural realist interpretation of linguistic methodology with a nuanced structuralist picture for its ontology. This proposal is informed by historical and current work in theoretical linguistics as well as philosophical views on ontology, scientific modelling and mathematics.
4
Varon, Stephanie Stigers 1939. "The mathematical foundations of classical ballet." Thesis, The University of Arizona, 1997. http://hdl.handle.net/10150/292004.
Full textAbstract:
This treatise sets out to show how both the mathematical aspect of ballet (and music to a very limited extent) and the associated psychological aspects of both the dancer and the stage space in which he or she operates contribute together to create an entire gestalt that becomes visible on and within the bodies of the dancers as they move through time and space. The recognition of both intention in the role of speaking a language with meaning, along with the existence of energy projection in music, dance and drama, make apparent the existence of this extension of the mental realm into the physical one. Although some people accord the spoken language a privileged status which causes a gap between artists and analytical philosophers, I have attempted, in this work, to show a way in which language may be considered as a concept applying to all languages, including those used in the arts. In this manner, hopefully, this gap between the two sets of theoretical concerns may be shown to be no longer applicable, and a manner of bridging the theoretical split can be forged upon the theory suggested by this treatise.
5
Bartocci, C. "Foundations of graded differential geometry." Thesis, University of Warwick, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.386972.
Full text
6
Fennelly, Maxwell. "Geometric foundations of network partitioning." Thesis, University of Southampton, 2014. https://eprints.soton.ac.uk/375533/.
Full text
7
Stergianopoulos, Georgios. "Large non-cooperative games : foundations and tools." Thesis, University of Warwick, 2012. http://wrap.warwick.ac.uk/56809/.
Full textAbstract:
Following Schmeidler (1973) and Mas-Colell (1984), economists have typically used aggregative games with a continuum of players to model strategic environments with a large number of participants. In these games a player's payoff depends on her own strategy and on an average of the strategies of everyone in the game. Examples include corporate competition in global markets, welfare maximization in multi-period economies, strategic voting in national elections, network congestion, and environmental models of pollution or, more generally, widespread externalities. This study consists of three chapters. In Chapter 1 we unveil a weakness of the Schmeidler - Mas-Colell framework, and we develop a potential remedy that leaves the framework intact. In Chapter 2 we set the theoretical foundations for an alternative framework that is immune to the above weakness. Finally, in Chapter 3 we demonstrate how our approach accommodates types of players. We provide a number of fully worked-through examples and an appendix at the end of each chapter that includes the proofs to our propositions.
8
Beaton, Ryan. "Interpreting Frege's Grundgesetze in an adaptation of Quine's New Foundations." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=81592.
Full textAbstract:
We first give a modern presentation of the formal language of Frege's Grundgesetze. There follows a comparison of the motivations for Frege's "Cumulative Type Theory" and for Russell's Type Theory and of the basic arithmetical definitions in each. Quine's New Foundations and, in particular, extensions of Jensen's modification, NFU, are introduced and consistency results are discussed. Finally, an interpretation is given in an NFU framework of a modified form of the Grundgesetze theory. It is shown that an "Axiom of Counting" necessary for arithmetic in NFU is needed in an analogous way for arithmetic in our interpretation; it is further demonstrated that from the statement of this axiom in NFU, the appropriate analogue is provable for our interpretation. The development of arithmetic in an NFU framework is seen essentially to be that intended by Frege in the Grundgesetze.
9
Johnson, Estrella Maria Salas. "Establishing Foundations for Investigating Inquiry-Oriented Teaching." PDXScholar, 2013. http://pdxscholar.library.pdx.edu/open_access_etds/1102.
Full textAbstract:
The Teaching Abstract Algebra for Understanding (TAAFU) project was centered on an innovative abstract algebra curriculum and was designed to accomplish three main objectives: to produce a set of multi-media support materials for instructors, to understand the challenges faced by mathematicians as they implemented this curriculum, and to study how this curriculum supports student learning of abstract algebra. Throughout the course of the project I took the lead investigating the teaching and learning in classrooms using the TAAFU curriculum. My dissertation is composed of three components of this research. First, I will report on a study that aimed to describe the experiences of mathematicians implementing the curriculum from their perspective. Second. I will describe a study that explores the mathematical work done by teachers as they respond to the mathematical activity of their students. Finally, I will discuss a theoretical paper in which I synthesize aspects of the instructional theory underlying the TAAFU curriculum in order to develop an analytic framework for analyzing student learning. This dissertation will serve as a foundation for my future research focused on the relationship between teachers' mathematical work and the learning of their students.
10
Szudzik, Matthew P. "Some Applications of Recursive Functionals to the Foundations of Mathematics and Physics." Research Showcase @ CMU, 2010. http://repository.cmu.edu/dissertations/26.
Full textAbstract:
We consider two applications of recursive functionals. The first application concerns Gödel’s theory T , which provides a rudimentary foundation for the formalization of mathematics. T can be understood as a theory of the simply-typed lambda calculus that is extended to include the constant 0N, the successor function S, and the operator RT for primitive recursion on objects of type T . It is known that the functions from non-negative integers to non-negative integers that can be defined in this theory are exactly the <ε0-recursive functions of non-negative integers. But it is not well-known which functionals of arbitrary type can be defined in T . We show that when the domain and codomain are restricted to pure closed normal forms, the functionals of arbitrary type that are definable in T are exactly those functionals that can be encoded as <ε0-recursive functions of non-negative integers. This result has many interesting consequences, including a new characterization of T . The second application is concerned with the question: “When can a model of a physical system be regarded as computable?” We provide the definition of a computable physical model to answer this question. The connection between our definition and Kreisel’s notion of a mechanistic theory is discussed, and several examples of computable physical models are given, including models which feature discrete motion, a model which features non-discrete continuous motion, and nondeterministic models such as radioactive decay. We show how computable physical models on effective topological spaces can be formulated with recursive functionals in the theory of type-two effectivity (TTE). Various common operations on computable physical models are described, such as the operation of coarse-graining and the formation of statistical ensembles. The definition of a computable physical model also allows for a precise formalization of the computable universe hypothesis— the claim that all the laws of physics are computable.
11
Bailin, S. G. "An analysis of finitism and the justification of set theory." Thesis, University of Oxford, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371602.
Full text
12
Picard, Joseph Romeo William Michael. "Impredicativity and turn of the century foundations of mathematics : presupposition in Poincare and Russell." Thesis, Massachusetts Institute of Technology, 1993. http://hdl.handle.net/1721.1/12498.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 1993.Includes bibliographical references (leaves 145-158).
by Joseph Romeo William Michael Picard
Ph.D.
13
Farias, Pablo Mayckon Silva. "A study about the origins of Mathematical Logic and the limits of its applicability to the formalization of Mathematics." Universidade Federal do CearÃ, 2007. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1516.
Full textAbstract:
Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgicoEste trabalho à um estudo sobre as origens da LÃgica MatemÃtica e os limites da sua aplicabilidade ao desenvolvimento formal da MatemÃtica. Primeiramente, à apresentada a teoria aritmÃtica de Dedekind, a primeira teoria a fornecer uma definiÃÃo precisa para os nÃmeros naturais e com base nela demonstrar todos os fatos comumente conhecidos a seu respeito. à tambÃm apresentada a axiomatizaÃÃo da AritmÃtica feita por Peano, que de certa forma simplificou a teoria de Dedekind. Em seguida, à apresentada a ome{german}{Begriffsschrift} de Frege, a linguagem formal que deu origem à LÃgica moderna, e nela sÃo representadas as definiÃÃes bÃsicas de Frege a respeito da noÃÃo de nÃmero. Posteriormente, à apresentado um resumo de questÃes importantes em fundamentos da MatemÃtica durante as primeiras trÃs dÃcadas do sÃculo XX, iniciando com os paradoxos na Teoria dos Conjuntos e terminando com a doutrina formalista de Hilbert. Por fim, sÃo apresentados, em linhas gerais, os teoremas de incompletude de GÃdel e o conceito de computabilidade de Turing, que apresentaram respostas precisas Ãs duas mais importantes questÃes do programa de Hilbert, a saber, uma prova direta de consistÃncia para a AritmÃtica e o problema da decisÃo, respectivamente.
This work is a study about the origins of Mathematical Logic and the limits of its applicability to the formal development of Mathematics. Firstly, Dedekindâs arithmetical theory is presented, which was the first theory to provide a precise definition for natural numbers and to demonstrate relying on it all facts commonly known about them. Peanoâs axiomatization for Arithmetic is also presented, which in a sense simplified Dedekindâs theory. Then, Fregeâs Begriffsschrift is presented, the formal language from which modern Logic originated, and in it are represented Fregeâs basic definitions concerning the notion of number. Afterwards, a summary of important topics on the foundations of Mathematics from the first three decades of the twentieth century is presented, beginning with the paradoxes in Set Theory and ending with Hilbertâs formalist doctrine. At last, are presented, in general terms, GÃdelâs incompleteness. theorems and Turingâs computability concept, which provided precise answers to the two most important points in Hilbertâs program, to wit, a direct proof of consistency for Arithmetic and the decision problem, respectively. Keywords: 1. Mathematical Logic 2. Foundations of Mathematics 3. GÃdelâs incompleteness theorems
14
Thornhill, Hannah C. "The Philosophy of Mathematics: A Study of Indispensability and Inconsistency." Scholarship @ Claremont, 2016. http://scholarship.claremont.edu/scripps_theses/894.
Full textAbstract:
This thesis examines possible philosophies to account for the practice of mathematics, exploring the metaphysical, ontological, and epistemological outcomes of each possible theory. Through a study of the two most probable ideas, mathematical platonism and fictionalism, I focus on the compelling argument for platonism given by an appeal to the sciences. The Indispensability Argument establishes the power of explanation seen in the relationship between mathematics and empirical science. Cases of this explanatory power illustrate how we might have reason to believe in the existence of mathematical entities present within our best scientific theories. The second half of this discussion surveys Newtonian Cosmology and other inconsistent theories as they pose issues that have received insignificant attention within the philosophy of mathematics. The application of these inconsistent theories raises questions about the effectiveness of mathematics to model physical systems.
15
Marks, Lori J. "Difficulties vs. Disabilities in K-12 Mathematics: Synthesis and Systematic Review." Digital Commons @ East Tennessee State University, 2015. https://dc.etsu.edu/etsu-works/3679.
Full text
16
Bushnell, Megan Haramoto. "The Process of Tracking in Mathematics in Box Elder School District." DigitalCommons@USU, 2008. https://digitalcommons.usu.edu/etd/85.
Full textAbstract:
Educational policymakers have used tracking to instruct students in a variety of subjects, including mathematics. Tracking, which has also been called ability grouping, is a process by which students in the same grade are placed into different classes based on academic ability. Few educators and sociologists have looked at the process by which students are placed in different mathematics tracks. The research design of this study focused on accumulating, evaluating, and reporting the understanding and observations of 12 teachers and 4 counselors as they discussed their knowledge and involvement in the mathematics placement procedures from the intermediate and middle school levels in northern Utah. The data revealed that in addition to the official placement policies there were other factors that influenced the math placement. Those factors were teacher input, parental participation, and student involvement in the educational process. Educational administration, counselors, and teachers can use the results of this study to create more equitable placement policies and procedures for all students.
17
Solanki, Vinesh. "Zariski structures in noncommutative algebraic geometry and representation theory." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:3fa23b75-9b85-4dc2-9ad6-bdb20d61fe45.
Full textAbstract:
A suitable subcategory of affine Azumaya algebras is defined and a functor from this category to the category of Zariski structures is constructed. The rudiments of a theory of presheaves of topological structures is developed and applied to construct examples of structures at a generic parameter. The category of equivariant algebras is defined and a first-order theory is associated to each object. For those theories satisfying a certain technical condition, uncountable categoricity and quantifier elimination results are established. Models are shown to be Zariski structures and a functor from the category of equivariant algebras to Zariski structures is constructed. The two functors obtained in the thesis are shown to agree on a nontrivial class of algebras.
18
Smith, Michael M. "PRE-CALCULUS CONCEPTS FUNDAMENTAL TO CALCULUS." University of Akron / OhioLINK, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=akron1164048974.
Full text
19
Bryant, Ross. "A Computation of Partial Isomorphism Rank on Ordinal Structures." Thesis, University of North Texas, 2006. https://digital.library.unt.edu/ark:/67531/metadc5387/.
Full textAbstract:
We compute the partial isomorphism rank, in the sense Scott and Karp, of a pair of ordinal structures using an Ehrenfeucht-Fraisse game. A complete formula is proven by induction given any two arbitrary ordinals written in Cantor normal form.
20
Carruth, Nathan Thomas. "Classical Foundations for a Quantum Theory of Time in a Two-Dimensional Spacetime." DigitalCommons@USU, 2010. https://digitalcommons.usu.edu/etd/708.
Full textAbstract:
We consider the set of all spacelike embeddings of the circle S1 into a spacetime R1 × S1 with a metric globally conformal to the Minkowski metric. We identify this set and the group of conformal isometries of this spacetime as quotients of semidirect products involving diffeomorphism groups and give a transitive action of the conformal group on the set of spacelike embeddings. We provide results showing that the group of conformal isometries is a topological group and that its action on the set of spacelike embeddings is continuous. Finally, we point out some directions for future research.
21
Magka, Despoina. "Foundations and applications of knowledge representation for structured entities." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:4a3078cc-5770-4a9b-81d4-8bc52b41e294.
Full textAbstract:
Description Logics form a family of powerful ontology languages widely used by academics and industry experts to capture and intelligently manage knowledge about the world. A key advantage of Description Logics is their amenability to automated reasoning that enables the deduction of knowledge that has not been explicitly stated. However, in order to ensure decidability of automated reasoning algorithms, suitable restrictions are usually enforced on the shape of structures that are expressible using Description Logics. As a consequence, Description Logics fall short of expressive power when it comes to representing cyclic structures, which abound in life sciences and other disciplines. The objective of this thesis is to explore ontology languages that are better suited for the representation of structured objects. It is suggested that an alternative approach which relies on nonmonotonic existential rules can provide a promising candidate for modelling such domains. To this end, we have built a comprehensive theoretical and practical framework for the representation of structured entities along with a surface syntax designed to allow the creation of ontological descriptions in an intuitive way. Our formalism is based on nonmonotonic existential rules and exhibits a favourable balance between expressive power and computational as well as empirical tractability. In order to ensure decidability of reasoning, we introduce a number of acyclicity criteria that strictly generalise many of the existing ones. We also present a novel stratification condition that properly extends `classical' stratification and allows for capturing both definitional and conditional aspects of complex structures. The applicability of our formalism is supported by a prototypical implementation, which is based on an off-the-shelf answer set solver and is tested over a realistic knowledge base. Our experimental results demonstrate improvement of up to three orders of magnitude in comparison with previous evaluation efforts and also expose numerous modelling errors of a manually curated biochemical knowledge base. Overall, we believe that our work lays the practical and theoretical foundations of an ontology language that is well-suited for the representation of structured objects. From a modelling point of view, our approach could stimulate the adoption of a different and expressive reasoning paradigm for which robustly engineered mature reasoners are available; it could thus pave the way for the representation of a broader spectrum of knowledge. At the same time, our theoretical contributions reveal useful insights into logic-based knowledge representation and reasoning. Therefore, our results should be of value to ontology engineers and knowledge representation researchers alike.
22
Burke, Mark. "Frege, Hilbert, and Structuralism." Thesis, Université d'Ottawa / University of Ottawa, 2015. http://hdl.handle.net/10393/31937.
Full textAbstract:
The central question of this thesis is: what is mathematics about? The answer arrived at by the thesis is an unsettling and unsatisfying one. By examining two of the most promising contemporary accounts of the nature of mathematics, I conclude that neither is as yet capable of giving us a conclusive answer to our question. The conclusion is arrived at by a combination of historical and conceptual analysis. It begins with the historical fact that, since the middle of the nineteenth century, mathematics has undergone a radical transformation. This transformation occurred in most branches of mathematics, but was perhaps most apparent in geometry. Earlier images of geometry understood it as the science of space. In the wake of the emergence of multiple distinct geometries and the realization that non-Euclidean geometries might lay claim to the description of physical space, the old picture of Euclidean geometry as the sole correct description of physical space was no longer tenable. The first chapter of the dissertation provides an historical account of some of the forces which led to the destabilization of the traditional picture of geometry. The second chapter examines the debate between Gottlob Frege and David Hilbert regarding the nature of geometry and axiomatics, ending with an argument suggesting that Hilbert’s views are ultimately unsatisfying. The third chapter continues to probe the work of Frege and, again, finds his explanations of the nature of mathematics troublingly unsatisfying. The end result of the first three chapters is that the Frege-Hilbert debate leaves us with an impasse: the traditional understanding of mathematics cannot hold, but neither can the two most promising modern accounts. The fourth and final chapter of the thesis investigates mathematical structuralism—a more recent development in the philosophy of mathematics—in order to see whether it can move us beyond the impasse of the Frege-Hilbert debate. Ultimately, it is argued that the contemporary debate between ‘assertoric’ structuralists and ‘algebraic’ structuralists recapitulates a form of the Frege-Hilbert impasse. The ultimate claim of the thesis, then, is that neither of the two most promising contemporary accounts can offer us a satisfying philosophical answer to the question ‘what is mathematics about?’.
23
D'Silva, Vijay Victor. "Logical abstract interpretation." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:3648e579-01dc-4054-8290-31626d53b003.
Full textAbstract:
Logical deduction and abstraction from detail are fundamental, yet distinct aspects of reasoning about programs. This dissertation shows that the combination of logic and abstract interpretation enables a unified and simple treatment of several theoretical and practical topics which encompass the model theory of temporal logics, the analysis of satisfiability solvers, and the construction of Craig interpolants. In each case, the combination of logic and abstract interpretation leads to more general results, simpler proofs, and a unification of ideas from seemingly disparate fields. The first contribution of this dissertation is a framework for combining temporal logics and abstraction. Chapter 3 introduces trace algebras, a new lattice-based semantics for linear and branching time logics. A new representation theorem shows that trace algebras precisely capture the standard trace-based semantics of temporal logics. We prove additional representation theorems to show how structures that have been independently discovered in static program analysis, model checking, and algebraic modal logic, can be derived from trace algebras by abstract interpretation. The second contribution of this dissertation is a framework for proving when two lattice-based algebras satisfy the same logical properties. Chapter 5 introduces functions called subsumption and bisubsumption and shows that these functions characterise logical equivalence of two algebras. We also characterise subsumption and bisubsumption using fixed points and finitary logics. We prove a representation theorem and apply it to derive the transition system analogues of subsumption and bisubsumption. These analogues strictly generalise the well studied notions of simulation and bisimulation. Our fixed point characterisations also provide a technique to construct property preserving abstractions. The third contribution of this dissertation is abstract satisfaction, an abstract interpretation framework for the design and analysis of satisfiability procedures. We show that formula satisfiability has several different fixed point characterisations, and that satisfiability procedures can be understood as abstract interpreters. Our main result is that the propagation routine in modern sat solvers is a greatest fixed point computation involving abstract transformers, and that clause learning is an abstract transformer for a form of negation. The final contribution of this dissertation is an abstract interpretation based analysis of algorithms for constructing Craig interpolants. We identify and analyse a lattice of interpolant constructions. Our main result is that existing algorithms are two of three optimal abstractions of this lattice. A second new result we derive in this framework is that the lattice of interpolation algorithms can be ordered by logical strength, so that there is a strongest and a weakest possible construction.
24
Yim, Austin Vincent. "On Galois correspondences in formal logic." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:b47d1dda-8186-4c81-876c-359409f45b97.
Full textAbstract:
This thesis examines two approaches to Galois correspondences in formal logic. A standard result of classical first-order model theory is the observation that models of L-theories with a weak form of elimination of imaginaries hold a correspondence between their substructures and automorphism groups defined on them. This work applies the resultant framework to explore the practical consequences of a model-theoretic Galois theory with respect to certain first-order L-theories. The framework is also used to motivate an examination of its underlying model-theoretic foundations. The model-theoretic Galois theory of pure fields and valued fields is compared to the algebraic Galois theory of pure and valued fields to point out differences that may hold between them. The framework of this logical Galois correspondence is also applied to the theory of pseudoexponentiation to obtain a sketch of the Galois theory of exponential fields, where the fixed substructure of the complex pseudoexponential field B is an exponential field with the field Qrab as its algebraic subfield. This work obtains a partial exponential analogue to the Kronecker-Weber theorem by describing the pure field-theoretic abelian extensions of Qrab, expanding upon work in the twelfth of Hilbert’s problems. This result is then used to determine some of the model-theoretic abelian extensions of the fixed substructure of B. This work also incorporates the principles required of this model-theoretic framework in order to develop a model theory over substructural logics which is capable of expressing this Galois correspondence. A formal semantics is developed for quantified predicate substructural logics based on algebraic models for their propositional or nonquantified fragments. This semantics is then used to develop substructural forms of standard results in classical first-order model theory. This work then uses this substructural model theory to demonstrate the Galois correspondence that substructural first-order theories can carry in certain situations.
25
Lange, Alissa A. "Is a Pizza Slice a Triangle? Buiding Accurate Mathematical Foundations in Preschool Using a Fun, Interactive, and Research-based Approach." Digital Commons @ East Tennessee State University, 2017. https://dc.etsu.edu/etsu-works/4183.
Full text
26
Farias, Pablo Mayckon Silva. "Um estudo sobre as origens da Lógica Matemática e os limites da sua aplicabilidade à formalização da Matemática." reponame:Repositório Institucional da UFC, 2007. http://www.repositorio.ufc.br/handle/riufc/18511.
Full textAbstract:
FARIAS, Pablo Mayckon Silva. Um estudo sobre as origens da Lógica Matemática e os limites da sua aplicabilidade à formalização da Matemática. 2007. 110 f. Dissertação (Mestrado em ciência da computação)- Universidade Federal do Ceará, Fortaleza-CE, 2007.Submitted by Elineudson Ribeiro (elineudsonr@gmail.com) on 2016-07-12T14:54:53Z No. of bitstreams: 1 2007_dis_pmsfarias.pdf: 859405 bytes, checksum: 9d580356cce3820f228499085b2e3cde (MD5)
Approved for entry into archive by Rocilda Sales (rocilda@ufc.br) on 2016-07-20T13:48:23Z (GMT) No. of bitstreams: 1 2007_dis_pmsfarias.pdf: 859405 bytes, checksum: 9d580356cce3820f228499085b2e3cde (MD5)
Made available in DSpace on 2016-07-20T13:48:23Z (GMT). No. of bitstreams: 1 2007_dis_pmsfarias.pdf: 859405 bytes, checksum: 9d580356cce3820f228499085b2e3cde (MD5) Previous issue date: 2007
This work is a study about the origins of Mathematical Logic and the limits of its applicability to the formal development of Mathematics. Firstly, Dedekind’s arithmetical theory is presented, which was the first theory to provide a precise definition for natural numbers and to demonstrate relying on it all facts commonly known about them. Peano’s axiomatization for Arithmetic is also presented, which in a sense simplified Dedekind’s theory. Then, Frege’s Begriffsschrift is presented, the formal language from which modern Logic originated, and in it are represented Frege’s basic definitions concerning the notion of number. Afterwards, a summary of important topics on the foundations of Mathematics from the first three decades of the twentieth century is presented, beginning with the paradoxes in Set Theory and ending with Hilbert’s formalist doctrine. At last, are presented, in general terms, Gödel’s incompleteness. theorems and Turing’s computability concept, which provided precise answers to the two most important points in Hilbert’s program, to wit, a direct proof of consistency for Arithmetic and the decision problem, respectively. Keywords: 1. Mathematical Logic 2. Foundations of Mathematics 3. Gödel’s incompleteness theorems
Este trabalho é um estudo sobre as origens da Lógica Matemática e os limites da sua aplicabilidade ao desenvolvimento formal da Matemática. Primeiramente, é apresentada a teoria aritmética de Dedekind, a primeira teoria a fornecer uma definição precisa para os números naturais e com base nela demonstrar todos os fatos comumente conhecidos a seu respeito. É também apresentada a axiomatização da Aritmética feita por Peano, que de certa forma simplificou a teoria de Dedekind. Em seguida, é apresentada a ome{german}{Begriffsschrift} de Frege, a linguagem formal que deu origem à Lógica moderna, e nela são representadas as definições básicas de Frege a respeito da noção de número. Posteriormente, é apresentado um resumo de questões importantes em fundamentos da Matemática durante as primeiras três décadas do século XX, iniciando com os paradoxos na Teoria dos Conjuntos e terminando com a doutrina formalista de Hilbert. Por fim, são apresentados, em linhas gerais, os teoremas de incompletude de Gödel e o conceito de computabilidade de Turing, que apresentaram respostas precisas às duas mais importantes questões do programa de Hilbert, a saber, uma prova direta de consistência para a Aritmética e o problema da decisão, respectivamente.
27
Colijn, Caroline. "The de Broglie-Bohm Causal Interpretation of Quantum Mechanics and its Application to some Simple Systems." Thesis, University of Waterloo, 2003. http://hdl.handle.net/10012/1044.
Full textAbstract:
The de Broglie-Bohm causal interpretation of quantum mechanics is discussed, and applied to the hydrogen atom in several contexts. Prominent critiques of the causal program are noted and responses are given; it is argued that the de Broglie-Bohm theory is of notable interest to physics. Using the causal theory, electron trajectories are found for the conventional Schrödinger, Pauli and Dirac hydrogen eigenstates. In the Schrödinger case, an additional term is used to account for the spin; this term was not present in the original formulation of the theory but is necessary for the theory to be embedded in a relativistic formulation. In the Schrödinger, Pauli and Dirac cases, the eigenstate trajectories are shown to be circular, with electron motion revolving around the z-axis. Electron trajectories are also found for the 1s-2p0 transition problem under the Schrödinger equation; it is shown that the transition can be characterized by a comparison of the trajectory to the relevant eigenstate trajectories. The structures of the computed trajectories are relevant to the question of the possible evolution of a quantum distribution towards the standard quantum distribution (quantum equilibrium); this process is known as quantum relaxation. The transition problem is generalized to include all possible transitions in hydrogen stimulated by semi-classical radiation, and all of the trajectories found are examined in light of their implications for the evolution of the distribution to the standard distribution. Several promising avenues for future research are discussed.
28
Dijk, Wilhelmina Van, and Lori Jean Marks. "English Language Learners with Learning Disabilities and the Language in Mathematics: Inclusive Instruction to Support the Acquisition of Both Languages." Digital Commons @ East Tennessee State University, 2014. https://dc.etsu.edu/etsu-works/3533.
Full text
29
Shearer, Robert D. C. "Scalable reasoning for description logics." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:d7c4fbf6-4258-4db4-a451-476dcebe68ca.
Full textAbstract:
Description logics (DLs) are knowledge representation formalisms with well-understood model-theoretic semantics and computational properties. The DL SROIQ provides the logical underpinning for the semantic web language OWL 2, which is quickly becoming the standard for knowledge representation on the web. A central component of most DL applications is an efficient and scalable reasoner, which provides services such as consistency testing and classification. Despite major advances in DL reasoning algorithms over the last decade, however, ontologies are still encountered in practice that cannot be handled by existing DL reasoners. We present a novel reasoning calculus for the description logic SROIQ which addresses two of the major sources of inefficiency present in the tableau-based reasoning calculi used in state-of-the-art reasoners: unnecessary nondeterminism and unnecessarily large model sizes. Further, we describe a new approach to classification which exploits partial information about the subsumption relation between concept names to reduce both the number of individual subsumption tests performed and the cost of working with large ontologies; our algorithm is applicable to the general problem of deducing a quasi-ordering from a sequence of binary comparisons. We also present techniques for extracting partial information about the subsumption relation from the models generated by constructive DL reasoning methods, such as our hypertableau calculus. Empirical results from a prototypical implementation demonstrate substantial performance improvements compared to existing algorithms and implementations.
30
Hieronymi, Philipp Christian Karl. "The real field with an irrational power function and a dense multiplicative subgroup." Thesis, University of Oxford, 2008. http://ora.ox.ac.uk/objects/uuid:2f9733a2-d8d7-4ec3-aeff-a1653e971817.
Full textAbstract:
In recent years the field of real numbers expanded by a multiplicative subgroup has been studied extensively. In this thesis, the known results will be extended to expansions of the real field. I will consider the structure R consisting of the field of real numbers and an irrational power function. Using Schanuel conditions, I will give a first-order axiomatization of expansions of R by a dense multiplicative subgroup which is a subset of the real algebraic numbers. It will be shown that every definable set in such a structure is a boolean combination of existentially definable sets and that these structures have o-minimal open core. A proof will be given that the Schanuel conditions used in proving these statements hold for co-countably many real numbers. The results mentioned above will also be established for expansions of R by dense multiplicative subgroups which are closed under all power functions definable in R. In this case the results hold under the assumption that the Conjecture on intersection with tori is true. Finally, the structure consisting of R and the discrete multiplicative subgroup 2^{Z} will be analyzed. It will be shown that this structure is not model complete. Further I develop a connection between the theory of Diophantine approximation and this structure.
31
Elsner, Bernhard August Maurice. "Presmooth geometries." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:b5d9ccfd-8360-4a2c-ad89-0b4f136c5a96.
Full textAbstract:
This thesis explores the geometric principles underlying many of the known Trichotomy Theorems. The main aims are to unify the field construction in non-linear o-minimal structures and generalizations of Zariski Geometries as well as to pave the road for completely new results in this direction. In the first part of this thesis we introduce a new axiomatic framework in which all the relevant structures can be studied uniformly and show that these axioms are preserved under elementary extensions. A particular focus is placed on the study of a smoothness condition which generalizes the presmoothness condition for Zariski Geometries. We also modify Zilber's notion of universal specializations to obtain a suitable notion of infinitesimals. In addition, families of curves and the combinatorial geometry of one-dimensional structures are studied to prove a weak trichotomy theorem based on very weak one-basedness. It is then shown that under suitable additional conditions groups and group actions can be constructed in canonical ways. This construction is based on a notion of ``geometric calculus'' and can be seen in close analogy with ordinary differentiation. If all conditions are met, a definable distributive action of one one-dimensional type-definable group on another are obtained. The main result of this thesis is that both o-minimal structures and generalizations of Zariski Geometries fit into this geometric framework and that the latter always satisfy the conditions required in the group constructions. We also exhibit known methods that allow us to extract fields from this. In addition to unifying the treatment of o-minimal structures and Zariski Geometries, this also gives a direct proof of the Trichotomy Theorem for "type-definable" Zariski Geometries as used, for example, in Hrushovski's proof of the relative Mordell-Lang conjecture.
32
Simaitis, Aistis. "Automatic verification of competitive stochastic systems." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:68b5e2d8-ba04-419f-8926-4cd542121e2d.
Full textAbstract:
In this thesis we present a framework for automatic formal analysis of competitive stochastic systems, such as sensor networks, decentralised resource management schemes or distributed user-centric environments. We model such systems as stochastic multi-player games, which are turn-based models where an action in each state is chosen by one of the players or according to a probability distribution. The specifications, such as “sensors 1 and 2 can collaborate to detect the target with probability 1, no matter what other sensors in the network do” or “the controller can ensure that the energy used is less than 75 mJ, and the algorithm terminates with probability at least 0.5'', are provided as temporal logic formulae. We introduce a branching-time temporal logic rPATL and its multi-objective extension to specify such probabilistic and reward-based properties of stochastic multi-player games. We also provide algorithms for these logics that can either verify such properties against the model, providing a yes/no answer, or perform strategy synthesis by constructing the strategy for the players that satisfies the specification. We conduct a detailed complexity analysis of the model checking problem for rPATL and its multi-objective extension and provide efficient algorithms for verification and strategy synthesis. We also implement the proposed techniques in the PRISM-games tool and apply them to the analysis of several case studies of competitive stochastic systems.
33
Marks, Lori J. "Addressing Math skills Through Assistive Technology." Digital Commons @ East Tennessee State University, 2000. https://dc.etsu.edu/etsu-works/3706.
Full text
34
Leyva, Daviel. "The Systems of Post and Post Algebras: A Demonstration of an Obvious Fact." Scholar Commons, 2019. https://scholarcommons.usf.edu/etd/7844.
Full textAbstract:
In 1942, Paul C. Rosenbloom put out a definition of a Post algebra after Emil L. Post published a collection of systems of many–valued logic. Post algebras became easier to handle following George Epstein’s alternative definition. As conceived by Rosenbloom, Post algebras were meant to capture the algebraic properties of Post’s systems; this fact was not verified by Rosenbloom nor Epstein and has been assumed by others in the field. In this thesis, the long–awaited demonstration of this oft–asserted assertion is given.
After an elemental history of many–valued logic and a review of basic Classical Propositional Logic, the systems given by Post are introduced. The definition of a Post algebra according to Rosenbloom together with an examination of the meaning of its notation in the context of Post’s systems are given. Epstein’s definition of a Post algebra follows the necessary concepts from lattice theory, making it possible to prove that Post’s systems of many–valued logic do in fact form a Post algebra.
35
Smith, Michael Anthony. "Embedding an object calculus in the unifying theories of programming." Thesis, University of Oxford, 2010. http://ora.ox.ac.uk/objects/uuid:8b5be90d-59c1-42c0-a996-ecd8015097b3.
Full textAbstract:
Hoare and He's Unifying Theories of Programming (UTP) provides a rich model of programs as relational predicates. This theory is intended to provide a single framework in which any programming paradigms, languages, and features, can be modelled, compared and contrasted. The UTP already has models for several programming formalisms, such as imperative programming, higher-order programming (e.g. programing with procedures), several styles of concurrent programming (or reactive systems), class-based object-orientation, and transaction processing. We believe that the UTP ought to be able to represent all significant computer programming language formalisms, in order for it to be considered a unifying theory. One gap in the UTP work is that of object-based object-orientation, such as that presented in Abadi and Cardelli's untyped object calculi (sigma-calculi). These sigma-calculi provide a prominent formalism of object-based object-oriented (OO) programs, which models programs as objects. We address this gap within this dissertation by presenting an embedding of an Abadi--Cardelli-style object calculus in the UTP. More formally, the thesis that his dissertation argues is that it is possible to provide an object-based object rientation to the UTP, with value- and reference-based objects, and a fully abstract model of references. We have made three contributions to our area of study: first, to extend the UTP with a notion of object-based object orientation, in contrast with the existing class-based models; second, to provide an alternative model of pointers (references) for the UTP that supports both value-based compound values (e.g. objects) and references (pointers), in contrast to existing UTP models with pointers that have reference-based compound values; and third, to model an Abadi-Cardelli notion of an object in the UTP, and thus demonstrate that it can unify this style of object formalism.
36
Wyld, Kira A. "Sudoku Variants on the Torus." Scholarship @ Claremont, 2017. http://scholarship.claremont.edu/hmc_theses/103.
Full textAbstract:
This paper examines the mathematical properties of Sudoku puzzles defined on a Torus. We seek to answer the questions for these variants that have been explored for the traditional Sudoku. We do this process with two such embeddings. The end result of this paper is a deeper mathematical understanding of logic puzzles of this type, as well as a fun new puzzle which could be played.
37
Souba, Matthew. "From the Outside Looking In: Can mathematical certainty be secured without being mathematically certain that it has been?" The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1574777956439624.
Full text
38
Atzemoglou, George Philip. "Higher-order semantics for quantum programming languages with classical control." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:9fdc4a26-cce3-48ed-bbab-d54c4917688f.
Full textAbstract:
This thesis studies the categorical formalisation of quantum computing, through the prism of type theory, in a three-tier process. The first stage of our investigation involves the creation of the dagger lambda calculus, a lambda calculus for dagger compact categories. Our second contribution lifts the expressive power of the dagger lambda calculus, to that of a quantum programming language, by adding classical control in the form of complementary classical structures and dualisers. Finally, our third contribution demonstrates how our lambda calculus can be applied to various well known problems in quantum computation: Quantum Key Distribution, the quantum Fourier transform, and the teleportation protocol.
39
Freire, Rodrigo de Alvarenga. "Os fundamentos do pensamento matematico no seculo XX e a relevancia fundacional da teoria de modelos." [s.n.], 2009. http://repositorio.unicamp.br/jspui/handle/REPOSIP/281061.
Full textAbstract:
Orientador: Walter Alexandre CarnielliTese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas
Made available in DSpace on 2018-08-12T22:46:52Z (GMT). No. of bitstreams: 1 Freire_RodrigodeAlvarenga_D.pdf: 761227 bytes, checksum: 3b1a0de92aa93b50f2bfc602bf6173bc (MD5) Previous issue date: 2009
Resumo: Esta Tese tem como objetivo elucidar, ao menos parcialmente, a questão do significado da Teoria de Modelos para uma reflexão sobre o conhecimento matemático no século XX. Para isso, vamos buscar, primeiramente, alcançar uma compreensão da própria reflexão sobre o conhecimento matemático, que será denominada de Fundamentos do Pensamento Matemático no século XX, e da própria relevância fundacional. Em seguida, analisaremos, dentro do contexto fundacional estabelecido, o papel da Teoria de Modelos e da sua interação com a Álgebra, em geral, e, finalmente, empreenderemos um estudo de caso específico. Nesse estudo de caso mostraremos que a Teoria de Galois pode ser vista como um conteúdo lógico, e buscaremos compreender o significado fundacional desse enquadramento modelo-teórico para uma parte da Álgebra clássica.
Abstract: The aim of the present Thesis is to bring some light to the question about the status and relevance of Model Theory to a reflection about the mathematical knowledge in the twentieth century. To pursue this target, we will, first of all, try to reach a comprehension of the reflection about the mathematical knowledge, itself, what will be designated as Foundations of Mathematical Thought in the twentieth century, and of the foundational relevance, itself. In the sequel, we will provide an analysis, of the role of Model Theory and its interaction with Algebra, in general, within the established foundational setting and, finally, we will discuss a specific study case. In this study case we will show that Galois Theory can be seen as a logical content, and we will try to understand the foundational meaning of this model-theoretic framework for some part of classical Algebra.
Doutorado
Logica
Doutor em Filosofia
40
Pierpoint, Alan S. "Logic: The first term revisited." CSUSB ScholarWorks, 1995. https://scholarworks.lib.csusb.edu/etd-project/480.
Full text
41
van, Dijk Wilhelmina, and Pamela J. Mims. "Instruction to support the acquisition of mathematics and vocabulary for young English Language Learners with Developmental Disabilities." Digital Commons @ East Tennessee State University, 2015. https://dc.etsu.edu/etsu-works/193.
Full textAbstract:
This session will present the preliminary findings from a research designed to determine the efficacy of a validated instructional routine on the mathematics and vocabulary acquisition of English language learners with developmental disabilities using word problems based on Common Core State Standards (CCSS). Learner Outcomes: • To learn several techniques on how to integrate vocabulary supports in mathematics instruction; • To learn components of an intervention package designed to increase math and vocabulary outcomes for students with ELL and DD; and • To understand how careful selection of vocabulary and sequencing of problems can help ELLs with DD attain a higher proficiency in English and mathematics.
42
Gomes, Rodrigo Rafael. "A noção de função em Frege /." Rio Claro : [s.n.], 2009. http://hdl.handle.net/11449/91131.
Full textAbstract:
Orientador: Irineu BicudoBanca: Itala Maria Loffredo D'Otaviano
Banca: Paulo Isamo Hiratsuka
Resumo: Neste trabalho apresentamos e analisamos o conceito fregiano de função, presente nos três livros de Frege: Begriffsschrift, Os Fundamentos da Aritmética e Leis Fundamentais da Aritmética. Discutimos ao longo dele o que Frege entendia por função e argumento, as modificações conceituais que tais noções sofreram no período de publicação de seus livros e a importância dessas noções para a sua filosofia. Para tanto, analisamos a linguagem artificial do primeiro livro, a definição de número do segundo, e os casos particulares de funções que são definidos no terceiro, bem como as considerações contidas em outros escritos do filósofo alemão. Verificamos uma caracterização puramente sintática de função em Begriffsschrift, uma distinção entre o sinal de uma função e aquilo que ele denota em Os Fundamentos da Aritmética, e a associação de dois elementos distintos a uma expressão funcional em Leis Fundamentais da Aritmética: o seu sentido e a sua referência. Finalmente, constatamos que a originalidade do sistema fregiano reside na possibilidade de considerar esse ou aquele termo de uma proposição como o argumento (ou os argumentos) de uma função.
Abstract: In this work we present and analyze the fregean concept of function, present in the three books by Frege: Begriffsschrift, The Foundations of the Arithmetic and Fundamental Laws of the Arithmetic. We discuss what Frege understood by function and argument, the conceptual modifications that such notions suffered in the period of publication of those books and the importance of these notions for his philosophy. For so much, we analyze the artificial language of the first book, the definition of number in the second, and the particular cases of functions that are defined in the third, as well as the considerations contained in other works by the philosopher. We verify a purely syntactic characterization of function in Begriffsschrift, a distinction between the sign of a function and what it denotes in The Foundations of the Arithmetic, and the association of two different elements to a functional expression in Fundamental Laws of the Arithmetic: its sense and its reference. Finally, we verify that the originality of the Frege's system is based on the possibility of considering one or other term of a proposition as the argument (or the arguments) of a function.
Mestre
43
Samson, Duncan Alistair. "An analysis of the influence of question design on pupils' approaches to number pattern generalisation tasks." Thesis, Rhodes University, 2008. http://hdl.handle.net/10962/d1003302.
Full textAbstract:
This study is based on a qualitative investigation framed within an interpretive paradigm, and aims to investigate the extent to which question design affects the solution strategies adopted by children when solving linear number pattern generalisation tasks presented in pictorial and numeric contexts. The research tool comprised a series of 22 pencil and paper exercises based on linear generalisation tasks set in both numeric and 2-dimensional pictorial contexts. The responses to these linear generalisation questions were classified by means of stage descriptors as well as stage modifiers. The method or strategy adopted was carefully analysed and classified into one of seven categories. A meta-analysis focused on the formula derived for the nth term in conjunction with its justification. The process of justification proved to be a critical factor in being able to accurately interpret the origin of the sub-structure evident in many of these responses. From a theoretical perspective, the central role of justification/proof within the context of this study is seen as communication of mathematical understanding, and the process of justification/proof proved to be highly successful in providing a window of understanding into each pupil’s cognitive reasoning. The results of this study strongly support the notion that question design can play a critical role in influencing pupils’ choice of strategy and level of attainment when solving pattern generalisation tasks. Furthermore, this study identified a diverse range of visually motivated strategies and mechanisms of visualisation. An awareness and appreciation for such a diversity of visualisation strategies, as well as an understanding of the importance of appropriate question design, has direct pedagogical application within the context of the mathematics classroom.
44
Cox, Louis Anthony. "Mathematical foundations of risk measurement." Thesis, Massachusetts Institute of Technology, 1986. http://hdl.handle.net/1721.1/114010.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1986.MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING
Bibliography: leaves 261-266.
by Louis Anthony Cox, Jr.
Ph.D.
45
Wharton, Elizabeth. "The model theory of certain infinite soluble groups." Thesis, University of Oxford, 2006. http://ora.ox.ac.uk/objects/uuid:7bd8d05b-4ff6-4326-8463-f896e2862e25.
Full textAbstract:
This thesis is concerned with aspects of the model theory of infinite soluble groups. The results proved lie on the border between group theory and model theory: the questions asked are of a model-theoretic nature but the techniques used are mainly group-theoretic in character. We present a characterization of those groups contained in the universal closure of a restricted wreath product U wr G, where U is an abelian group of zero or finite square-free exponent and G is a torsion-free soluble group with a bound on the class of its nilpotent subgroups. For certain choices of G we are able to use this characterization to prove further results about these groups; in particular, results related to the decidability of their universal theories. The latter part of this work consists of a number of independent but related topics. We show that if G is a finitely generated abelian-by-metanilpotent group and H is elementarily equivalent to G then the subgroups gamma_n(G) and gamma_n(H) are elementarily equivalent, as are the quotient groups G/gamma_n(G) and G/gamma_n(H). We go on to consider those groups universally equivalent to F_2(VN_c), where the free groups of the variety V are residually finite p-groups for infinitely many primes p, distinguishing between the cases when c = 1 and when c > 2. Finally, we address some important questions concerning the theories of free groups in product varieties V_k · · ·V_1, where V_i is a nilpotent variety whose free groups are torsion-free; in particular we address questions about the decidability of the elementary and universal theories of such groups. Results mentioned in both of the previous two paragraphs have applications here.
46
King, Brian Christopher Ambrose. "Towards a Kantian foundation of mathematics." Thesis, University of Cambridge, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.613022.
Full text
47
Bilal, Ahmed. "Counterfactual conditional analysis using the Centipede Game." Scholarship @ Claremont, 2019. https://scholarship.claremont.edu/cmc_theses/2252.
Full textAbstract:
The Backward Induction strategy for the Centipede Game leads us to a counterfactual reasoning paradox, The Centipede Game paradox. The counterfactual reasoning proving the backward induction strategy for the game appears to rely on the players in the game not choosing that very same backward induction strategy. The paradox is a general paradox that applies to backward induction reasoning in sequential, perfect information games. Therefore, the paradox is not only problematic for the Centipede Game, but it also affects counterfactual reasoning solutions in games similar to the Centipede Game. The Centipede Game is a prime illustration of this paradox in counterfactual reasoning. As a result, this paper will use a material versus subjunctive/counterfactual conditional analysis to provide a theoretical resolution to the Centipede Game, with the hope that a similar solution can be applied to other areas where this paradox may appear. The solution involves delineating between the epistemic systems of the players and the game theorists.
48
Rodriguez, Paul Fabian. "Mathematical foundations of simple recurrent networks /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1999. http://wwwlib.umi.com/cr/ucsd/fullcit?p9935464.
Full text
49
Bartl, Eduard. "Mathematical foundations of graded knowledge spaces." Diss., Online access via UMI:, 2009.
Find full textAbstract:
Thesis (Ph. D.)--State University of New York at Binghamton, Thomas J. Watson School of Engineering and Applied Science, Department of Systems Science and Industrial Engineering, 2009.Includes bibliographical references.
50
Mawby, Jim. "Strict finitism as a foundation for mathematics." Thesis, University of Glasgow, 2005. http://theses.gla.ac.uk/1344/.
Full textAbstract:
The principal focus of this research is a comprehensive defence of the theory of strict finitism as a foundation for mathematics. I have three broad aims in the thesis; firstly, to offer as complete and developed account of the theory of strict finitism as it has been described and discussed in the literature. I detail the commitments and claims of the theory, and discuss the best ways in which to present the theory. Secondly, I consider the main objections to strict finitism, in particular a number of claims that have been made to the effect that strict finitism is, as it stands, incoherent. Many of these claims I reject, but one, which focuses on the problematic notion of vagueness to which the strict finites seems committed, I suggest, calls for some revision or further development of the strict finitist’s position. The third part of this thesis is therefore concerned with such development, and I discuss various options for strict finitism, ranging from the development of a trivalent semantic, to a rejection of the commitment to vagueness in the first instance.