Related papers: Sizes of Countable Sets
The cumulative hierarchy conception of set, which is based on the conception that sets are inductively generated from "former" sets, is generally considered a good way to create a set conception that seems safe from contradictions. This…
The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…
Shepard's Universal Law of Generalization offered a compelling case for the first physics-like law in cognitive science that should hold for all intelligent agents in the universe. Shepard's account is based on a rational Bayesian model of…
Although Bolzano's concept of the continuum has gradually evolved, the basis remained the same: the continuum as an infinite class of points arranged in such a way that the so-called \emph{Bolzano completeness} holds. Bolzano realized over…
This report presents an expression for the number of a multiset's sub-multisets of a given cardinality as a function of the multiplicity of its elements. This is also the number of distinct samples of a given size that may be produced by…
Since the theory developed by Georg Cantor, mathematicians have taken a sharp interest in the sizes of infinite sets. We know that the set of integers is infinitely countable and that its cardinality is Aleph0. Cantor proved in 1891 with…
In this note, we present a characterization of sets definable in Skolem arithmetic, i.e., the first-order theory of natural numbers with multiplication. This characterization allows us to prove the decidability of the theory. The idea is…
This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…
The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.
It is well known that the set of algebraic numbers (let us call it $A$) is countable. In this paper, instead of the usage of the classical terminology of cardinals proposed by Cantor, a recently introduced methodology using \G1-based…
The paper considers the problem of finding the largest possible set P(n), a subset of the set N of the natural numbers, with the property that a number is in P(n) if and only if it is a sum of n distinct naturals all in P(n) or none in…
The arithmetic of natural numbers has a natural and simple encoding within sets, and the simplest set whose structure is not that of any natural number extends this set-theoretic representation to positive and negative integers. The…
In analogy with the 290-Theorem of Bhargava-Hanke, a criterion set is a finite subset $C$ of the totally positive integers in a given totally real number field such that if a quadratic form represents all elements of $C$, then it…
We present the concept of the \emph{information efficiency of functions} as a technique to understand the interaction between information and computation. Based on these results we identify a new class of objects that we call…
We study the concept of canonical characteristic set of a characterizable differential ideal. We propose an efficient algorithm that transforms any characteristic set into the canonical one. We prove the basic properties of canonical…
The concept of ``countable set'' is attributed to Georg Cantor, who set the boundary between countable and uncountable sets in 1874. The concept of ``computable set'' arose in the study of computing models in the 1930s by the founders of…
Minor totals of natural sequence were shown to possess some properties in respect to their units digits. Depending on numeral system applied the units digits may take any digit of the system or there may be exclusions. i.e. some system…
In this article, we prove some subsets of the set of natural numbers $\mathbb{N}$ and any non-zero ideals of an order of imaginary quadratic fields are fractionally dense in $\mathbb{R}_{>0}$ and $\mathbb{C}$ respectively.
As machine learning is increasingly used to help make decisions, there is a demand for these decisions to be explainable. Arguably, the most explainable machine learning models use decision rules. This paper focuses on decision sets, a type…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…