Answers are given to two questions concerning the existence of some sparse subsets of $\mathscr{H} = \{0, 1,..., H - 1\} \subseteq * \mathbb{N}$ , where H is a hyperfinite integer. In § 1, we answer a question of Kanovei by showing that for a given cut U in H, there exists a countably determined set $X \subseteq \mathscr{H}$ which contains exactly one element in each U-monad, if and only if U = a · N for some $a (...) \in \mathscr{H} \backslash \{0\}$ . In §2, we deal with a question of Keisler and Leth in [6]. We show that there is a cut $V \subseteq \mathscr{H}$ such that for any cut U, (i) there exists a U-discrete set $X \subseteq \mathscr{H}$ with X + X = H (mod H) provided $U \subsetneqq V$ , (ii) there does not exist any U-discrete set $X \subseteq \mathscr{H}$ with X + X = H (mod H) provided $\supsetneqq V$ . We obtain some partial results for the case U = V. (shrink)

In this paper we ask the question: to what extent do basic set theoretic properties of Loeb measure depend on the nonstandard universe and on properties of the model of set theory in which it lies? We show that, assuming Martin's axiom and κ-saturation, the smallest cover by Loeb measure zero sets must have cardinality less than κ. In contrast to this we show that the additivity of Loeb measure cannot be greater than ω 1 . Define $\operatorname{cof}(H)$ as the (...) smallest cardinality of a family of Loeb measure zero sets which cover every other Loeb measure zero set. We show that $\operatorname{card}(\lfloor\log_2(H)\rfloor) \leq \operatorname{cof}(H) \leq \operatorname{card}(2^H)$ , where card is the external cardinality. We answer a question of Paris and Mills concerning cuts in nonstandard models of number theory. We also present a pair of nonstandard universes $M \preccurlyeq N$ and hyperfinite integer H ∈ M such that H is not enlarged by N, 2 H contains new elements, but every new subset of H has Loeb measure zero. We show that it is consistent that there exists a Sierpiński set in the reals but no Loeb-Sierpiński set in any nonstandard universe. We also show that it is consistent with the failure of the continuum hypothesis that Loeb-Sierpiński sets can exist in some nonstandard universes and even in an ultrapower of a standard universe. (shrink)

A new foundation for constructive nonstandard analysis is presented. It is based on an extension of a sheaf-theoretic model of nonstandard arithmetic due to I. Moerdijk. The model consists of representable sheaves over a site of filter bases. Nonstandard characterisations of various notions from analysis are obtained: modes of convergence, uniform continuity and differentiability, and some topological notions. We also obtain some additional results about the model. As in the classical case, the order type of the nonstandard natural numbers is (...) a dense set of copies of the integers. Every standard set has a hyperfinite enumeration of its standard elements in the model. All arguments are carried out within a constructive and predicative metatheory: Martin-Löf's type theory. (shrink)

The Loeb space construction in nonstandard analysis is applied to the theory of processes to reveal basic phenomena which cannot be treated using classical methods. An asymptotic interpretation of results established here shows that for a triangular array (or a sequence) of random variables, asymptotic uncorrelatedness or asymptotic pairwise independence is necessary and sufficient for the validity of appropriate versions of the law of large numbers. Our intrinsic characterization of almost sure pairwise independence leads to the equivalence of various multiplicative (...) properties of random variables. (shrink)

I develop a notion of nonlinear stochastic integrals for hyperfinite Lévy processes and use it to find exact formulas for expressions which are intuitively of the form $\sum_{s=0}^t\phi(\omega,dl_{s},s)$ and $\prod_{s=0}^t\psi(\omega,dl_{s},s)$ , where l is a Lévy process. These formulas are then applied to geometric Lévy processes, infinitesimal transformations of hyperfinite Lévy processes, and to minimal martingale measures. Some of the central concepts and results are closely related to those found in S. Cohen’s work on stochastic calculus for processes (...) with jumps on manifolds, and the paper may be regarded as a reworking of his ideas in a different setting and with totally different techniques. (shrink)

Bijdragen aan een congres waarin de integriteit van juridische professionals bediscussieerd wordt.

The present paper shows how one might model Everettian quantum mechanics using hyperfinitely many worlds. A hyperfinite model allows one to consider idealized measurements of observables with continuous-valued spectra where different outcomes are associated with possibly infinitesimal probabilities. One can also prove hyperfinite formulations of Everett’s limiting relative-frequency and randomness properties, theorems he considered central to his formulation of quantum mechanics. Finally, this model provides an intuitive framework in which to consider no-collapse formulations of quantum mechanics more generally.

A construction of the real number system based on almost homomorphisms of the integers $\mathbb {Z}$ was proposed by Schanuel, Arthan, and others. We combine such a construction with the ultrapower or limit ultrapower construction to construct the hyperreals out of integers. In fact, any hyperreal field, whose universe is a set, can be obtained by such a one-step construction directly out of integers. Even the maximal (i.e., On -saturated) hyperreal number system described by Kanovei and Reeken (2004) and independently (...) by Ehrlich (2012) can be obtained in this fashion, albeit not in NBG . In NBG , it can be obtained via a one-step construction by means of a definable ultrapower (modulo a suitable definable class ultrafilter). (shrink)

In this paper, we introduce the integer programming in neutrosophic environment, by considering coffecients of problem as a triangulare neutrosophic numbers. The degrees of acceptance, indeterminacy and rejection of objectives are simultaneously considered. The Neutrosophic Integer Programming Problem (NIP) is transformed into a crisp programming model, using truth membership (T), indeterminacy membership (I), and falsity membership (F) functions as well as single valued triangular neutrosophic numbers. To measure the efficiency of the model, we solved several numerical examples.

The present paper shows how one might model Everettian quantum mechanics using hyperfinitely many worlds. A hyperfinite model allows one to consider idealized measurements of observables with continuous-valued spectra where different outcomes are associated with possibly infinitesimal probabilities. One can also prove hyperfinite formulations of Everett’s limiting relative-frequency and randomness properties, theorems he considered central to his formulation of quantum mechanics. Finally, this model provides an intuitive framework in which to consider no-collapse formulations of quantum mechanics more generally.

This paper surveys the recent developments in the area that grew out of attempts to solve an analog of Hilbert's Tenth Problem for the field of rational numbers and the rings of integers of number fields. It is based on a plenary talk the author gave at the annual North American meeting of ASL at the University of Notre Dame in May of 2009.

We develop an axiomatic set theory — the Theory of Hyperfinite Sets THS— which is based on the idea of the existence of proper subclasses of large finite sets. We demonstrate how theorems of classical continuous mathematics can be transfered to THS, prove consistency of THS, and present some applications.

The separation, uniformization, and other properties of the Borel and projective hierarchies over hyperfinite sets are investigated and compared to the corresponding properties in classical descriptive set theory. The techniques used in this investigation also provide some results about countably determined sets and functions, as well as an improvement of an earlier theorem of Kunen and Miller.

Let [Formula: see text] be an expansion of either an ordered field [Formula: see text], or a valued field [Formula: see text]. Given a definable set [Formula: see text] let [Formula: see text] be the ring of continuous definable functions from [Formula: see text] to [Formula: see text]. Under very mild assumptions on the geometry of [Formula: see text] and on the structure [Formula: see text], in particular when [Formula: see text] is [Formula: see text]-minimal or [Formula: see text]-minimal, or (...) an expansion of a local field, we prove that the ring of integers [Formula: see text] is interpretable in [Formula: see text]. If [Formula: see text] is [Formula: see text]-minimal and [Formula: see text] is definably connected of pure dimension [Formula: see text], then [Formula: see text] defines the subring [Formula: see text]. If [Formula: see text] is [Formula: see text]-minimal and [Formula: see text] has no isolated points, then there is a discrete ring [Formula: see text] contained in [Formula: see text] and naturally isomorphic to [Formula: see text], such that the ring of functions [Formula: see text] which take values in [Formula: see text] is definable in [Formula: see text]. (shrink)

Beck presents an outline of the procedure of bootstrapping of integer concepts, with the purpose of explicating the account of Carey. According to that theory, integer concepts are acquired through a process of inductive and analogous reasoning based on the object tracking system, which allows individuating objects in a parallel fashion. Discussing the bootstrapping theory, Beck dismisses what he calls the "deviant-interpretation challenge"—the possibility that the bootstrapped integer sequence does not follow a linear progression after some point—as (...) being general to any account of inductive learning. While the account of Carey and Beck focuses on the OTS, in this paper I want to reconsider the importance of another empirically well-established cognitive core system for treating numerosities, namely the approximate number system. Since the ANS-based account offers a potential alternative for integer concept acquisition, I show that it provides a good reason to revisit the deviant-interpretation challenge. Finally, I will present a hybrid OTS-ANS model as the foundation of integer concept acquisition and the framework of enculturation as a solution to the challenge. (shrink)

LetXbe a standard Borel space, and letEbe acountableBorel equivalence relation onX, i.e., a Borel equivalence relationEfor which every equivalence class [x]Eis countable. By a result of Feldman-Moore [FM],Eis induced by the orbits of a Borel action of a countable groupGonX.The structure of general countable Borel equivalence relations is very little understood. However, a lot is known for the particularly important subclass consisting of hyperfinite relations. A countable Borel equivalence relation is calledhyperfiniteif it is induced by a Borel ℤ-action, i.e., (...) by the orbits of a single Borel automorphism. Such relations are studied and classified in [DJK]. It is shown in Ornstein-Weiss [OW] and Connes-Feldman-Weiss [CFW] that for every Borel equivalence relationEinduced by a Borel action of a countable amenable groupGonXand for every probability measure μ onX, there is a Borel invariant setY⊆Xwith μ = 1 such thatE↾Y is hyperfinite. Motivated by this result, Weiss [W2] raised the question of whether everyEinduced by a Borel action of a countable amenable group is hyperfinite. Later on Weiss showed that this is true forG= ℤn. However, the problem is still open even for abelianG. Our main purpose here is to provide a weaker affirmative answer for general amenableG. We need a definition first. Given two standard Borel spacesX, Y, auniversally measurableisomorphism betweenXandYis a bijection ƒ:X→Ysuch that both ƒ, ƒ-1are universally measurable. Notice now that to assert that a countable Borel equivalence relation onXis hyperfinite is trivially equivalent to saying that there is a standard Borel spaceYand a hyperfinite Borel equivalence relationFonY, which isBorelisomorphic toE, i.e., there is a Borel bijection ƒ:X→YwithxEy⇔ ƒFƒ. We have the following theorem. (shrink)

In this short note many conjectures on partitions of integers as summations of prime numbers are presented, which are extension of Goldbach conjecture.

This is an immediate conse-quence of a more general combinatorial theorem called Ramsey’s theorem, but it is much simpler to state. We call this adjacent Ramsey theory.

Let R be a real closed field. An integer part I for R is a discretely ordered subring such that for every \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${r \in R}$$\end{document}, there exists an \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${i \in I}$$\end{document} so that i ≤ r < i + 1. Mourgues and Ressayre (J Symb Logic 58:641–647, 1993) showed that every real closed field has an integer part. The procedure of (...) Mourgues and Ressayre appears to be quite complicated. We would like to know whether there is a simple procedure, yielding an integer part that is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta^0_2(R)}$$\end{document} —limit computable relative to R. We show that there is a maximal Z-ring \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${I \subseteq R}$$\end{document} which is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta^0_2(R)}$$\end{document}. However, this I may not be an integer part for R. By a result of Wilkie (Logic Colloquium ’77), any Z-ring can be extended to an integer part for some real closed field. Using Wilkie’s ideas, we produce a real closed field R with a Z-ring \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${I \subseteq R}$$\end{document} such that I does not extend to an integer part for R. For a computable real closed field, we do not know whether there must be an integer part in the class \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta^0_2}$$\end{document}. We know that certain subclasses of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta^0_2}$$\end{document} are not sufficient. We show that for each \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${n \in \omega}$$\end{document}, there is a computable real closed field with no n-c.e. integer part. In fact, there is a computable real closed field with no n-c.e. integer part for any n. (shrink)

In an ω1-saturated nonstandard universe a cut is an initial segment of the hyperintegers which is closed under addition. Keisler and Leth in [KL] introduced, for each given cut U, a corresponding U-topology on the hyperintegers by letting O be U-open if for any x ∈ O there is a y greater than all the elements in U such that the interval $\lbrack x - y, x + y\rbrack \subseteq O$ . Let U be a cut in a hyperfinite (...) time line H, which is a hyperfinite initial segment of the hyperintegers. U is called a good cut if there exists a U-meager subset of H of Loeb measure one. Otherwise U is bad. In this paper we discuss the questions of Keisler and Leth about the existence of bad cuts and related cuts. We show that assuming $\mathbf{b} > \omega_1$, every hyperfinite time line has a cut with both cofinality and coinitiality uncountable. We construct bad cuts in a nonstandard universe under ZFC. We also give two results about the existence of other kinds of cuts. (shrink)

In an ω1-saturated nonstandard universe a cut is an initial segment of the hyperintegers which is closed under addition. Keisler and Leth in [KL] introduced, for each given cut U, a corresponding U-topology on the hyperintegers by letting O be U-open if for any x ∈ O there is a y greater than all the elements in U such that the interval $\lbrack x - y, x + y\rbrack \subseteq O$ . Let U be a cut in a hyperfinite (...) time line H, which is a hyperfinite initial segment of the hyperintegers. A subset B of H is called a U-Lusin set in H if B is uncountable and for any Loeb-Borel U-meager subset X of H, B ∩ X is countable. Here a Loeb-Borel set is an element of the σ-algebra generated by all internal subsets of H. In this paper we answer some questions of Keisler and Leth about the existence of U-Lusin sets by proving the following facts. (1) If $U = x/\mathbb{N} = \{y \in \mathscr{H}: \forall n \in \mathbb{N}(y < x/n)\}$ for some x ∈ H, then there exists a U-Lusin set of power κ if and only if there exists a Lusin set of the reals of power κ. (2) If U ≠ x/N but the coinitiality of U is ω, then there are no U-Lusin sets if CH fails. (3) Under ZFC there exists a nonstandard universe in which U-Lusin sets exist for every cut U with uncountable cofinality and coinitiality. (4) In any ω2-saturated nonstandard universe there are no U-Lusin sets for all cuts U except U = x/N. (shrink)

In an ω1-saturated nonstandard universe a cut is an initial segment of the hyperintegers which is closed under addition. Keisler and Leth in [KL] introduced, for each given cut U, a corresponding U-topology on the hyperintegers by letting O be U-open if for any x ∈ O there is a y greater than all the elements in U such that the interval $\lbrack x - y, x + y\rbrack \subseteq O$ . Let U be a cut in a hyperfinite (...) time line H, which is a hyperfinite initial segment of the hyperintegers. The U-monad topology of H is the quotient topology of the U-topological space H modulo U. In this paper we answer a question of Keisler and Leth about the U-monad topologies by showing that when H is κ-saturated and has cardinality κ, (1) if the coinitiality of U1 is uncountable, then the U1-monad topology and the U2-monad topology are homeomorphic iff both U1 and U2 have the same coinitiality; and (2) H can produce exactly three different U-monad topologies (up to homeomorphism) for those U's with countable coinitiality. As a corollary H can produce exactly four different U-monad topologies if the cardinality of H is ω1. (shrink)

We show here that the first order theory of the positive integers equipped with multiplication remains decidable when one adds to the language the usual order restricted to the prime numbers. We see moreover that the complexity of the latter theory is a tower of exponentials, of height O(n).

We prove linear and polynomial growth properties of sets and functions that are existentially definable in the ordered group of integers with divisibility. We determine the laws of addition with order and divisibility.

Order picking, which is collecting a set of products from different locations in a warehouse, has repeatedly been described as one of the most laborious and time-consuming internal logistic processes. Each order is issued to pick some products located at given locations in the warehouse. In this paper, we consider an order picking problem, in which a number of orders with different delivery due dates are going to be retrieved by a limited number of order pickers in multiperiods such that (...) the total tardiness is minimized. The aim is to determine a retrieval plan in terms of order batching and order picker multitrip routing as decision variables. Besides, products are arrived and replenished at the predetermined locations at different periods. Therefore, products sitting in those locations should be delivered soon to provide empty rooms for replenishment. A mixed integer linear programming formulation is proposed for this new problem. The model is optimally solved for small-size problems. For larger instances, grouping metaheuristic algorithms are proposed based on particle swarm optimization and the league championship algorithm that use group-based operators to generate reasonable batches of orders. Improvement heuristics are designed as well. The performance of the MILP formulation and metaheuristic algorithms is analyzed for different problem instances whose designs are based on real data gathered from an auto parts warehouse. Results indicate that our algorithms can stably solve large instances of the problem in a reasonable time. (shrink)

We prove linear and polynomial growth properties of sets and functions that are existentially definable in the ordered group of integers with divisibility. We determine the laws of addition with order and divisibility.

Thomas Kuhn argues that scientific advancements sometimes involve paradigm shifts between incommunsurable theories, thoughts, and concepts. I argue that the phenomenon Kuhn is attempting to describe is better explained as akin to a greatest integer function of punctuated equilibrium. I conclude that Kuhn is mistaken in thinking that science is an actively vigorous, cumulative discipline.

We discuss enormous integers and rates of growth after [PH77]. This breakthrough was based on a variant of the classical finite Ramsey theorem. Since then, examples have been given of greater relevance to a number of standard mathematical and computer science contexts, often involving even more enormous integers and rates of growth.

We have provided a model-theoretic proof for the decidability of the additive structure of integers together with the function f mapping x to $$\lfloor \varphi x\rfloor $$ where $$\varphi $$ is the golden ratio.

Is there a nontrivial automorphism of the Turing degrees? It is a major open problem of computability theory. Past results have limited how nontrivial automorphisms could possibly be. Here we consider instead how an automorphism might be induced by a function on reals, or even by a function on integers. We show that a permutation of ω cannot induce any nontrivial automorphism of the Turing degrees of members of 2ω, and in fact any permutation that induces the trivial automorphism must (...) be computable.A main idea of the proof is to consider the members of 2ω to be probabilities, and use statistics: from random outcomes from a distribution we can compute that distribution, but not much more. (shrink)

In the ordered Abelian group of reals with the integers as a distinguished subgroup, the projection of a finite intersection of generalized halfspaces is a finite intersection of generalized halfspaces. The result is uniform in the integer coefficients and moduli of the initial generalized halfspaces.

Leopold Kronecker (1823–1891) was a German mathematician who worked on number theory and algebra. He is considered a pre-intuitionist, being only close to intuitionism because he rejected Cantor’s Set Theory. He was, in fact, more radical than the intuitionists. Unlike Poincaré, for example, Kronecker didn’t accept the transfinite numbers as valid mathematical entities.

Journal of Mathematical Logic, Ahead of Print. Given a structure [math] and a stably embedded [math]-definable set [math], we prove tameness preservation results when enriching the induced structure on [math] by some further structure [math]. In particular, we show that if [math] and [math] are stable (respectively, superstable, [math]-stable), then so is the theory [math] of the enrichment of [math] by [math]. Assuming simplicity of [math], elimination of hyperimaginaries and a further condition on [math] related to the behavior of algebraic (...) closure, we also show that simplicity and NSOP1 pass from [math] to [math]. We then prove several applications for tame expansions of weakly minimal structures and, in particular, the group of integers. For example, we construct the first known examples of strictly stable expansions of [math]. More generally, we show that any stable (respectively, superstable, simple, NIP, NTP2, NSOP1) countable graph can be defined in a stable (respectively, superstable, simple, NIP, NTP2, NSOP1) expansion of [math] by some unary predicate [math]. (shrink)