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.

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)

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.

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)

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)

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 this short note many conjectures on partitions of integers as summations of prime numbers are presented, which are extension of Goldbach conjecture.

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).

The systems of arithmetic discussed in this work are non-elementary theories. In this paper, natural numbers are characterized axiomatically in two di erent ways. We begin by recalling the classical set P of axioms of Peano’s arithmetic of natural numbers proposed in 1889 (including such primitive notions as: set of natural numbers, zero, successor of natural number) and compare it with the set W of axioms of this arithmetic (including the primitive notions like: set of natural numbers and relation of (...) inequality) proposed by Witold Wilkosz, a Polish logician, philosopher and mathematician, in 1932. The axioms W are those of ordered sets without largest element, in which every non-empty set has a least element, and every set bounded from above has a greatest element. We show that P and W are equivalent and also that the systems of arithmetic based on W or on P, are categorical and consistent. There follows a set of intuitive axioms PI of integers arithmetic, modelled on P and proposed by B. Iwanuś, as well as a set of axioms WI of this arithmetic, modelled on the W axioms, PI and WI being also equivalent, categorical and consistent. We also discuss the problem of independence of sets of axioms, which were dealt with earlier. (shrink)

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

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.

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.

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)

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.

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.

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.

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.

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)

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)

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.

Let us call an integer part of an ordered field any subring such that every element of the field lies at distance less than 1 from a unique element of the ring. We show that every real closed field has an integer part.

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.

This study investigates simple games. A fundamental research question in this field is to determine necessary and sufficient conditions for a simple game to be a weighted majority game. Taylor and Zwicker showed that a simple game is non-weighted if and only if there exists a trading transform of finite size. They also provided an upper bound on the size of such a trading transform, if it exists. Gvozdeva and Slinko improved that upper bound; their proof employed a property of (...) linear inequalities demonstrated by Muroga. In this study, we provide a new proof of the existence of a trading transform when a given simple game is non-weighted. Our proof employs Farkas’ lemma, and yields an improved upper bound on the size of a trading transform. We also discuss an integer-weight representation of a weighted simple game, improving the bounds obtained by Muroga. We show that our bound on the quota is tight when the number of players is less than or equal to five, based on the computational results obtained by Kurz. Furthermore, we discuss the problem of finding an integer-weight representation under the assumption that we have minimal winning coalitions and maximal losing coalitions. In particular, we show a performance of a rounding method. Finally, we address roughly weighted simple games. Gvozdeva and Slinko showed that a given simple game is not roughly weighted if and only if there exists a potent certificate of non-weightedness. We give an upper bound on the length of a potent certificate of non-weightedness. We also discuss an integer-weight representation of a roughly weighted simple game. (shrink)

A Dedekind algebra is an ordered pair (B, h), where B is a non-empty set and h is a similarity transformation on B. Among the Dedekind algebras is the sequence of the positive integers. From a contemporary perspective, Dedekind established that the second-order theory of the sequence of the positive integers is categorical and finitely axiomatizable. The purpose here is to show that this seemingly isolated result is a consequence of more general results in the model theory of second-order languages. (...) Each Dedekind algebra can be decomposed into a family of disjoint, countable subalgebras called the configurations of the algebra. There are ?0 isomorphism types of configurations. Each Dedekind algebra is associated with a cardinal-valued function on ? called its configuration signature. The configuration signature counts the number of configurations in each isomorphism type that occurs in the decomposition of the algebra. Two Dedekind algebras are isomorphic iff their configuration signatures are identical. The second-order theory of any countably infinite Dedekind algebra is categorical, and there are countably infinite Dedekind algebras whose second-order theories are not finitely axiomatizable. It is shown that there is a condition on configuration signatures necessary and sufficient for the second-order theory of a Dedekind algebra to be finitely axiomatizable. It follows that the second-order theory of the sequence of the positive integers is categorical and finitely axiomatizable. (shrink)

We show that R.J. Thompson’s groupsFandTare bi-interpretable with the ring of the integers. From a result by A. Khélif, these groups are quasi-finitely axiomatizable and prime. So, the groupTprovides an example of a simple group which is quasi-finitely axiomatizable and prime. This answers questions posed by T. Altınel and A. Muranov in [2], and by A. Nies in [12].

We provide a first order axiomatization of the expansion of the complex field by the exponential function restricted to the subring of integers modulo the first order theory of (Z, +, ·).

We prove that (additive) ordered group reducts of nonstandard models of the bounded arithmetical theory are recursively saturated in a rich language with predicates expressing the integers, rationals, and logarithmically bounded numbers. Combined with our previous results on the construction of the real exponential function on completions of models of, we show that every countable model of is an exponential integer part of a real‐closed exponential field.

We reconsider some classical natural semantics of integers in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple representation of integers that we suitably effectivize in order to develop an associated Kolmogorov theory. Such effectivizations are particular instances of a general notion of “self-enumerated system” that we introduce in this paper. Our main result asserts that, with such effectivizations, Kolmogorov theory allows to quantitatively distinguish the underlying semantics. We characterize the families obtained by such effectivizations (...) and prove that the associated Kolmogorov complexities constitute a hierarchy which coincides with that of Kolmogorov complexities defined via jump oracles and/or infinite computations . This contrasts with the well-known fact that usual Kolmogorov complexity does not depend on the chosen arithmetic representation of integers, let it be in any base n ≥ 2 or in unary. Also, in a conceptual point of view, our result can be seen as a mean to measure the degree of abstraction of these diverse semantics. (shrink)

Meyer and Mortensen’s Alien Intruder Theorem includes the extraor- dinary observation that the rationals can be extended to a model of the relevant arithmetic R♯, thereby serving as integers themselves. Al- though the mysteriousness of this observation is acknowledged, little is done to explain why such rationals-as-integers exist or how they operate. In this paper, we show that Meyer and Mortensen’s models can be identified with a class of ultraproducts of finite models of R♯, providing insights into some of the (...) more mysterious phenomena of the rational models. (shrink)