Related papers: On n-Tardy Sets
Using an extension of the abundancy index to imaginary quadratic rings with unique factorization, we define what we call $n$-powerfully perfect numbers in these rings. This definition serves to extend the concept of perfect numbers that…
For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…
We extend the concept of "almost indiscernible theory" introduced by Pillay and Sklinos in [Bull. Symb. Log., 2015] (which was itself a modernization and expansion of Baldwin and Shelah [Algebra Universalis, 1983]), to uncountable languages…
This is the first in a series of three papers on Algebraic Set Theory. Its main purpose is to lay the necessary groundwork for the next two parts, one on Realisability and the other on Sheaf Models in Algebraic Set Theory.
In his seminal paper from 1936, Alan Turing introduced the concept of non-computable real numbers and presented examples based on the algorithmically unsolvable Halting problem. We describe a different, analytically natural mechanism for…
We provide a pure algebraic version of the dynamical characterization of Conrad's property. This approach allows dealing with general group actions on totally ordered spaces. As an application, we give a new and somehow constructive proof…
The quest for complete observables in general relativity has been a longstanding open problem. We employ methods from descriptive set theory to show that no complete observable on rich enough collections of spacetimes is Borel definable. In…
We combine some known results and techniques with new ones to show that there exists a non-algebraic, multi-linear matroid. This answers an open question by Matus (Discrete Mathematics 1999), and an open question by Pendavingh and van Zwam…
Recently, Marzlin and Sanders (2004) demonstrated an inconsistency when the adiabatic approximation was applied to specific, "inverse" time-evolving systems. Following that, Tong et al. (2005) showed that the widely used traditional…
A group $G$ is called hereditarily non-topologizable if, for every $H\le G$, no quotient of $H$ admits a non-discrete Hausdorff topology. We construct first examples of infinite hereditarily non-topologizable groups. This allows us to prove…
In previous definition of $\mathrm{E}$-theory, separability of the $\mathrm{C}^*$-algebras is needed either to construct the composition product or to prove the long exact sequences. Considering the latter, the potential failure of the long…
Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…
In the theory of zero-dimensional systems and their relation to $C^*$-algebras, Poon (1990) introduced a class of closed sets. We call the closed sets quasi-sections. Medynets (2006) introduced basic sets that are part of quasi-sections in…
In this note we provide a concise report on the complexity of the causal ordering problem, originally introduced by Simon to reason about causal dependencies implicit in systems of mathematical equations. We show that Simon's classical…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…
Fractions $\frac{p}{q} \in [0,1)$ with prime denominator $q$ written in decimal have a curious property described by Midy's Theorem, namely that two halves of their period (if it is of even length $2n$) sum up to $10^n-1$. A number of…
The paper introduces a novel algorithm for computing the output admissible set of linear discrete-time systems subject to input saturation. The proposed method takes advantage of the piecewise-affine dynamics to propagate the output…
We show that in the category of preordered sets, there is a natural notion of pretorsion theory, in which the partially ordered sets are the torsion-free objects and the sets endowed with an equivalence relation are the torsion objects.…
A theorem of Cohen from 1950 states that a commutative ring is Noetherian if and only if every prime ideal is finitely generated. In this note, we establish analogues of this result in tensor triangular geometry. In particular, for an…
In this paper, we have compared r.e. sets based on their enumeration orders with Turing machines. Accordingly, we have defined novel concept uniformity for Turing machines and r.e. sets and have studied some relationships between uniformity…