Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 158 for “"Natural numbers"”.
-
Two Axiomatic Definitions of the Natural Numbers
… axiomatic foundation for the development of the natural numbers from two points of view. It makes no claim at originality other than at the point of organization and presentation of previously developed works.
-
Closure operations on the submonoids of the natural numbers
… semiprime and prime operations on submonoids of natural numbers. We find that the closure operations under composition do not form a submonoid under composition. We also describe all the semiprime operations on natural numbers and show that they are a submonoid. We investigate the relations among …
-
On the Etale Fundamental Group of Schemes over the Natural Numbers
The aims of the present thesis are to give a concrete description, in the modern language of arithmetic-algebraic geometry, of the Galois theory of Alexander Grothendieck (and the later generation of topos theorists: Micheal Barr, Radu Diaconescu, Peter Johnstone, and Ieke Moerdijk) in the context …
-
The Development of the Natural Numbers by Means of the Peano Postulates
This thesis covers the development of the natural numbers by means of the peano postulates.
-
Arithmetic Computations and Memory Management Using a Binary Tree Encoding af Natural Numbers
… a simple pairing function (a bijection between natural numbers and pairs of natural numbers) are explored. First, the tree is used to encode natural numbers, and algorithms that perform basic arithmetic computations are presented along with formal proofs of their correctness. Second, using this …
-
Computer-Verified Foundations of Metaphysics and an Ontology of Natural Numbers in Isabelle/HOL
… confirm that the Dedekind-Peano postulates for natural numbers are consistently derivable in AOT using Frege's method. Furthermore, we can suggest and discuss generalizations and variants of the construction and can thereby provide theoretical insights into, and contribute to the philosophical …
-
On Steinhaus Sets, Orbit Trees and Universal Properties of Various Subgroups in the Permutation Group of Natural Numbers
… define the orbit tree of a permutation group of natural numbers, and further introduce compressed orbit trees. We show that any rooted finite tree can be realized as a compressed orbit tree of some permutation group. In the third chapter, we investigate certain classes of closed permutation …
-
An Analysis of Models Used in Australia, Canada, Europe, and the United States to Provide An Understanding of Addition and Multiplication Over the Natural Numbers
Made available in DSpace on 2014-12-08T21:25:24Z (GMT). No. of bitstreams: 1 6915330.pdf: 22683088 bytes, checksum: 50633e821efea420dd09685fdc8ccb41 (MD5) Previous issue date: 1969
-
Automata and Ratio Sets
… derived from the quotients of two sets of natural numbers, and examines a variety of specific examples where the comprising sets of natural numbers have specific properties. I present a general algorithm that decides the inclusion of a rational number in a specific ratio set if the …
-
Εργοδική θεωρία Ramsey και εφαρμογές
… corresponding theory for coideals on the set of natural numbers proved by Louveau, Mathias, Farah and Todorcevic, (b) the Milliken-Taylor partition theorems for sequences of finite non empty subsets of natural numbers, and (c) the partition theorems for sequences of words proved by Carlson, …
-
Aritmetinių funkcijų sumos /
… have range of definition equal to the set of natural numbers are called arithmetical functions. Values of such functions are spread chaotically in the set of natural numbers, however, mean value can be calculated precisely enough. The goal of this thesis is to approve some of the theorems …
-
Partition Theorems and Computability Theory
… sets for every computable 2-coloring of pairs of natural numbers, in an attempt to further understand the effective content of Ramsey's Theorem for exponent 2. We establish some new results about these degrees, and obtain as a corollary the nonexistence of a ""universal"" computable 2-coloring of …
-
The Infinite Ladder in Mathematics: Transfinite Induction
… induction is mathematical induction beyond the natural numbers. These numbers are called ordinals, denoted by Greek letters. This thesis will introduce fundamental concepts of set theory, starting from the formal definition of natural numbers. We aim to provide a clear development of set theory …
-
Θέματα εργοδικής θεωρίας Ramsey
… corresponding theory for coideals on the set of natural numbers proved by Louveau, Mathias, Farah and Todorcevic, the Milliken-Taylor partition theorems for sequences of finite subsets of natural numbers, and the partition theorems for sequences of words proved by Carlson, …
-
The additivity of the two-dimensional Miller ideal
… in any finite product of the power set of the natural numbers modulo the ideal of the finite subsets of the natural numbers.
-
Algorithms of Schensted and Hillman-Grassl and Operations on Standard Bitableaux
… a bijection between permutations of the first N natural numbers and standard bitableaux of size N. We also describe the Hillman-Grassl algorithm which constructs a bijection between reverse plane partitions and the solutions in natural numbers of a linear equation involving hook lengths. Pascal …
-
Aspects of Recursion Theory in Arithmetical Theories and Categories
… is the study of computable functions on the natural numbers. This thesis considers recursion theory in first-order arithmetical theories and categories, thus expanding the work of Ritchie and Young, Lambek, Scott, and Hofstra. We give a complete characterisation of the representability of …
-
Strongly Summable Ultrafilters: Some Properties and Generalizations
… states that whenever we partition the set of natural numbers into two (or any finite number of) cells, one of the cells must entirely contain a set of the form FS(X) for some infinite set X (here FS(X) is the collection of all nonrepeating sums of finitely many elements of X). A nonprincipal …
-
Os problemas envolvendo as quatro operações e a unidade do pensamento linear
… relating to the four arithmetic operations with natural numbers. In particular, it answers the following questions: what is an addition (subtraction, multplication, division) problem?; what is an arithmetic problem?; what is the relation between an arithmetic problem and an algebra problem?; why …
Page 1 of 8