相关论文: A theory of hyperfinite sets
We introduce and prove the consistency of a new set theoretic axiom we call the \emph{Invariant Ideal Axiom}. The axiom enables us to provide (consistently) a full topological classification of countable sequential groups, as well as fully…
A general theory of programs, programming and programming languages built up from a few concepts of elementary set theory. Derives, as theorems, properties treated as axioms by classic approaches to programming. Covers sequential and…
We note a parallel between some ideas of stable model theory and certain topics in finite combinatorics related to the sum-product phenomenon. For a simple linear group G, we show that a finite subset X with |X X \^{-1} X |/ |X| bounded is…
We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…
In this paper we explore some properties of H-structures. We describe a construction of H-structures based on one-dimensional asymptotic classes which preserves pseudo-finiteness. That is, the H-structures we construct are ultraproducts of…
Hereditarily finite (HF) set theory provides a standard universe of sets, but with no infinite sets. Its utility is demonstrated through a formalisation of the theory of regular languages and finite automata, including the Myhill-Nerode…
We present in this paper a first-order axiomatization of an extended theory $T$ of finite or infinite trees, built on a signature containing an infinite set of function symbols and a relation $\fini(t)$ which enables to distinguish between…
Finite Unified Theories (FUTs) are N=1 supersymmetric Grand Unified Theories that can be made all-loop finite, leading to a severe reduction of the free parameters. We review the investigation of FUTs based on SU(5) in the context of…
A new mathematical object called a skand is introduced, which turns out in general to be a non-well-founded set. Skands of finite lengths are ordinary well-founded sets, and skands of very long length (like the hyper-skand of all ordinals)…
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…
Our main result (Theorem A) shows the incompleteness of any consistent sequential theory T formulated in a finite language such that T is axiomatized by a collection of sentences of bounded quantifier-alternation-depth. Our proof employs an…
When developing and assessing density functional theory methods, a finite basis set is usually employed. In most cases, however, the issue of basis set dependency is neglected. Here, we assess several basis sets and functionals. In…
Topological statistical theory provides the foundation for a modern mathematical reformulation of classical statistical theory: Structural Statistics emphasizes the structural assumptions that accompany distribution families and the set of…
In this paper we show that the intuitionistic fixed point theory FiX^{i}(X) over set theories T is a conservative extension of T if T can manipulate finite sequences and has the full foundation schema.
For a given variety of groups $\X$, we develop a systematic theory of $\CSX$-groups and $\XT$-groups, extending ideas proposed in \cite{Shah}. We analyze the interplay between these classes, describe their structural properties, and examine…
We prove that the space of dominant/non-constant holomorphic mappings from a product of hyperbolic Riemann surfaces of finite type into certain hyperbolic manifolds with universal cover a bounded domain is a finite set.
A topos theoretic generalisation of the category of sets allows for modelling spaces which vary according to time intervals. Persistent homology, or more generally, persistence is a central tool in topological data analysis, which examines…
In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…
We define a generalization of the Turing machine that computes on general sets. Our main theorem states that the class of generalized Turing machine computable functions and the class of Set Recursive functions coincide.
Matrices are very popular and widely used in mathematics and other fields of science. Every mathematician has known the properties of finite-sized matrices since the time of study. In this paper, we consider the basic theory of infnite…