Related papers: Set Theory with Urelements

Set prediction is about learning to predict a collection of unordered variables with unknown interrelations. Training such models with set losses imposes the structure of a metric space over sets. We focus on stochastic and underdefined…

This review article is the second part of the project ``Selected Topics of Social Physics". The first part has been devoted to equilibrium systems. The present part considers nonequilibrium systems. The style of the paper combines the…

This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…

It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…

We use automated theorem provers to significantly shorten a formal development in higher order set theory. The development includes many standard theorems such as the fundamental theorem of arithmetic and irrationality of square root of…

We give a number of results about families of Ulam sets. Generalizing behavior of Ulam sets U(1,n), we prove using an novel model theoretic approach that there is a rigidity phenomenon for Ulam sets U(a,b) as b increases. Based on this, we…

This paper explores the concept of \textbf{co-first modules}, a generalization of coprime modules, through the lens of preradicals in module theory. Building on foundational notions such as second modules and coprime modules, we introduce…

This paper discusses the general structure of reflection positive Euclidean covariant distributions that can be used to construct Euclidean representations of relativistic quantum mechanical models of systems of a finite number of degrees…

The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…

The forcing method is a powerful tool to prove the consistency of set-theoretic assertions relative to the consistency of the axioms of set theory. Laver's theorem and Bukovsk\'y's theorem assert that set-generic extensions of a given…

We extend Ueda's peak set theorem for subdiagonal subalgebras of tracial finite von Neumann algebras, to sigma-finite von Neumann algebras (that is, von Neumann algebras with a faithful state; which includes those on a separable Hilbert…

Mathematicians still use Naive Set Theory when generating sets without danger of producing any contradiction. Therefore their working method can be considered as a consistent inference system with an experience of over 100 years. My…

We review the theory and practice of determining what parts of a data set are ultrametric. It is assumed that the data set, to begin with, is endowed with a metric, and we include discussion of how this can be brought about if a…

We analyze the degree-structure induced by large reducibilities under the Axiom of Determinacy. This generalizes the analysis of Borel reducibilities given in references [1], [6] and [5] e.g. to the projective levels.

The concepts of a conditional set, a conditional inclusion relation and a conditional Cartesian product are introduced. The resulting conditional set theory is sufficiently rich in order to construct a conditional topology, a conditional…

Category theory gives a mathematical characterization of naturality but not of canonicity. The purpose of this paper is to develop the logical theory of canonical maps based on the broader demonstration that the dual notions of elements &…

The sets used to construct other mathematical objects are pure sets, which means that all of their elements are sets, which are themselves pure. One set may therefore be within another, not as an element, but as an element of an element, or…

In this paper, we describe the formalization of the axiom of choice and several of its famous equivalent theorems in Morse-Kelley set theory. These theorems include Tukey's lemma, the Hausdorff maximal principle, the maximal principle,…

We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…

A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…