Related papers: A countable Boolean algebra that is Reichenbach's …
Following Lawvere's description of metric spaces using enriched category theory, we introduce a change in the base of enrichment that allows description of some aspects of (relativistic) causal spaces. All such spaces are Cauchy complete,…
In the present paper, we first give a characterization for Bongartz completion in $\tau$-tilting theory via $c$-vectors. Motivated by this characterization, we give the definition of Bongartz completion in cluster algebras using…
We find necessary and sufficient conditions on a family $\mathcal{R} = (r_i)_{i \in I}$ in a Boolean algebra $\mathcal{B}$ under which there exists a unique positive probability measure $\mu$ on $\mathcal{B}$ such that $\mu (…
A simply colored coalgebra is a coassociative counital coalgebra $C$ over an arbitrary ring $R$, which can be decomposed into a direct sum of two $R$-modules: one generated by set-like elements and another consisting of conilpotent…
We show (in ZFC) that the cardinality of a compact homogeneous space of countable tightness is no more than the size of the continuum.
This article is motivated by the following satisfiability question: pick uniformly at random an and/or Boolean expression of length n, built on a set of k_n Boolean variables. What is the probability that this expression is satisfiable?…
A real X is defined to be relatively c.e. if there is a real Y such that X is c.e.(Y) and Y does not compute X. A real X is relatively simple and above if there is a real Y <_T X such that X is c.e.(Y) and there is no infinite subset Z of…
We investigate classes of Boolean algebras related to the notion of forcing that adds Cohen reals. A >>Cohen algebra<< is a Boolean algebra that is dense in the completion of a free Boolean algebra. We introduce and study generalizations of…
Extending a result of R. de la Vega, we prove that an infinite homogeneous compactum has cardinality $\mathfrak{c}$ if either it is the union of countably many dense or finitely many arbitrary countably tight subspaces. The question if…
The advent of molecular biology has led to the identification of definitive causative factors for a number of diseases, most of which are monogenic. Causes for most common diseases across the population, however, seem elusive and cannot be…
Colimits that satisfy the Van Kampen condition have interesting exactness properties. We show that the elementary presentation of the Van Kampen condition is actually a characterisation of a universal property in the associated bicategory…
We show that every finite Boolean combination of polynomial equalities and inequalities in C^n admits two uniform normal forms: an $\exists\forall$ form and a $\forall\exists$ form, each using a single polynomial equation. Both forms use…
For any cardinal $\kappa \geq 2$, there is a unique complete real tree whose points all have valence $\kappa$. In this note, we show that, when $\kappa \geq 3$, it is necessary to assume completeness. More precisely, we show that there…
This paper proposes a causal inference relation and causal programming as general frameworks for causal inference with structural causal models. A tuple, $\langle M, I, Q, F \rangle$, is an instance of the relation if a formula, $F$,…
A randomized controlled trial (RCT) is widely regarded as the gold standard for assessing the causal effect of a treatment or intervention, assuming perfect implementation. In practice, however, randomization can be compromised for various…
The complete complementary code (CCC) is a sequence family with ideal correlation sums which was proposed by Suehiro and Hatori. Numerous literatures show its applications to direct-spread code-division multiple access (DS-CDMA) systems for…
We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…
It is well known that correlations produced by common causes in the past cannot violate Bell's inequalities. This was emphasized by Bell in his celebrated example of Bertlmann's socks. However, if common causes are induced by the very…
In this paper, we present a generalized effective completeness theorem for continuous logic. The primary result is that any continuous theory is satisfied in a structure which admits a presentation of the same Turing degree. It then follows…
Chang's Conjecture (CC) asserts that for every $F:[\omega_2]^{<\omega} \to \omega_2$, there exists an $X$ that is closed under $F$ such that $|X|=\omega_1$ and $|X \cap \omega_1| =\omega$. By classic results of Silver and Donder, CC is…