Related papers: A note on Automatic Baire property
A popular approach to neurosymbolic AI is to take the output of the last layer of a neural network, e.g. a softmax activation, and pass it through a sparse computation graph encoding certain logical constraints one wishes to enforce. This…
We introduce the open degree of a compact space, and we show that for every natural number n, the separable Rosenthal compact spaces of degree n have a finite basis.
For any countable group $\Gamma$ satisfying the ``weak Rohlin property'', and for any dynamical property, the set of $\Gamma$-actions with that property is either residual or meager. The class of groups with the weak Rohlin property…
The paper establishes the property of splittability of billiard boundary sequences in n dimensional cube into subsequences of fractional parts. This reveals a new property of integrable and weak perturbated Hamilton systems: under a simple…
In this paper, we introduce a large class of (so-called) conditional indicators, on a complete probability space with respect to a sub $\sigma$-algebra. A conditional indicator is a positive mapping, which is not necessary linear, but may…
For $\kappa$ a regular uncountable cardinal, the higher Baire and Cantor spaces ${}^\kappa\kappa$ and ${}^\kappa2$ (endowed with the ${<}\kappa$-box topology) have been relatively well-studied, but less is known about the case where…
In this article we study conditions to be a continuous or a measurable eigenvalue of finite rank minimal Cantor systems, that is, systems given by an ordered Bratteli diagram with a bounded number of vertices per level. We prove that…
A method how to construct Boolean-valued models of some fragments of arithmetic was developed in Krajicek (2011), with the intended applications in bounded arithmetic and proof complexity. Such a model is formed by a family of random…
We present a new package in R implementing Bayesian additive regression trees (BART). The package introduces many new features for data analysis using BART such as variable selection, interaction detection, model diagnostic plots,…
A ring has bounded factorizations if every cancellative nonunit $a \in R$ can be written as a product of atoms and there is a bound $\lambda(a)$ on the lengths of such factorizations. The bounded factorization property is one of the most…
We extend Solovay's theorem about definable subsets of the Baire space to the generalized Baire space ${}^\lambda\lambda$, where $\lambda$ is an uncountable cardinal with $\lambda^{<\lambda}=\lambda$. In the first main theorem, we show that…
We give upper bound for several highness properties in computability randomness theory. First, we prove that discrete covering property does not imply the ability to compute a 1-random real, answering a question of Greenberg, Miller and…
We introduce the Property (C) for a unital commutative sub-C*-algebra $D$ of a unital C*-algebra $A$, a version of the relative comparison property using almost normalizers. Under the assumption of this property, the $\mathcal Z$-absorption…
A domain $R$ is said to have the finite factorization property if every nonzero non-unit element of $R$ has at least one and at most finitely many distinct factorizations up to multiplication of irreducible factors by central units. Let $k$…
We review a minimum set of notions from our previous paper on structural properties of SAT at arXiv:0802.1790 that will allow us to define and discuss the "complete internal independence" of a decision problem. This property is strictly…
We introduce a natural generalization of the Haagerup property of a finite von Neumann algebra to an arbitrary von Neumann algebra (with a separable predual) equipped with a normal, semi-finite, faithful weight and prove that this property…
An automaton with advice is a finite state automaton which has access to an additional fixed infinite string called an advice tape. We refine the Myhill-Nerode theorem to characterize the languages of finite strings that are accepted by…
We investigate the computational power of affine automata (AfAs) introduced in [4]. In particular, we present a simpler proof for how to change the cutpoint for any affine language and a method how to reduce error in bounded error case.…
We establish that the existence of a winning strategy in certain topological games, closely related to a strong game of Choquet, played in a topological space $X$ and its hyperspace $K(X)$ of all nonempty compact subsets of $X$ equipped…
Cellular automata are a famous model of computation, yet it is still a challenging task to assess the computational capacity of a given automaton; especially when it comes to showing negative results. In this paper, we focus on studying…