Related papers: On needed reals
Almost all representations considered in computable analysis are partial. We provide arguments in favor of total representations (by elements of the Baire space). Total representations make the well known analogy between numberings and…
In this work we attempt to generalize our result in [6] [7] for real rings (not just von Neumann regular real rings). In other words we attempt to characterize and construct real closure * of commutative unitary rings that are real. We also…
We give an 'arithmetic regularity lemma' for groups definable in finite fields, analogous to Tao's 'algebraic regularity lemma' for graphs definable in finite fields. More specifically, we show that, for any $M>0$, any finite field…
Let $H$ be a finite dimensional semisimple Hopf algebra and $R$ a braided Hopf algebra in the category of Yetter-Drinfeld modules over $H$. When $R$ is a Calabi-Yau algebra, a necessary and sufficient condition for $R#H$ to be a Calabi-Yau…
We introduce the notions of triviality and order-triviality for global invariant types in an arbitrary first-order theory and show that they are well behaved in the NIP context. We show that these two notions agree for invariant global…
We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…
In this note we give a precise statement and a detailed proof for reconstruction problem of weak bialgebra maps. As an application we characterize indecomposability of weak algebras in categorical setting.
We prove general results about separation and weak$^\#$-convergence of boundedly finite measures on separable metric spaces and Souslin spaces. More precisely, we consider an algebra of bounded real-valued, or more generally a $*$-algebra…
We review the main topics concerning Fusion Rule Algebras (FRA) of Rational Conformal Field Theories. After an exposition of their general properties, we examine known results on the complete classification for low number of fields ($\leq…
Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…
For a cancellative semigroup S and a field F, it is proved that the semigroup algebra FS is centrally essential if and only if the group of fractions $G_S$ of the semigroup $S$ exists and the group algebra $FG_S$ of $G_S$ is centrally…
Most existing methods determine relation types only after all the entities have been recognized, thus the interaction between relation types and entity mentions is not fully modeled. This paper presents a novel paradigm to deal with…
Let $S$ be a Scott set, or even an $\omega$-model of $\mathsf{WWKL}$. Then for each $A\in S$, either there is $X \in S$ that is weakly 2-random relative to $A$, or there is $X\in S$ that is 1-generic relative to $A$. It follows that if…
Hilbert's Tenth Problem over the field $\mathbb Q$ of rational numbers is one of the biggest open problems in the area of undecidability in number theory. In this paper we construct new, computably presentable subrings $R$ of $\mathbb Q$…
We employ the theory of canonical extensions to study residuation algebras whose associated relational structures are functional, i.e., for which the ternary relations associated to the expanded operations admit an interpretation as…
In this paper we suggest NICE: a new algorithm to generate counterfactual explanations for heterogeneous tabular data. The design of our algorithm specifically takes into account algorithmic requirements that often emerge in real-life…
Given a real dataset and a computation family, we wish to encode and store the dataset in a distributed system so that any computation from the family can be performed by accessing a small number of nodes. In this work, we focus on the…
We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…
Counterfactual examples have emerged as an effective approach to produce simple and understandable post-hoc explanations. In the context of graph classification, previous work has focused on generating counterfactual explanations by…
We characterize when a subfactor $N\subseteq M$ is oracle computable relative to a presentation of the ambient factor $M$ in terms of computability of the Jones basic construction, in terms of computable Pismner-Popa bases, and in terms of…