Related papers: A countable Boolean algebra that is Reichenbach's …
We give a canonical construction of a balanced big Cohen-Macaulay algebra for a domain of finite type over $\mathbb C$ by taking ultraproducts of absolute integral closures in positive characteristic. This yields a new tight closure…
Basic results in combinatorial mathematics provide the foundation for a theory and calculus for reasoning about sequential behavior. A key concept of the theory is a generalization of Boolean implicant which deals with statements of the…
The concept of ``countable set'' is attributed to Georg Cantor, who set the boundary between countable and uncountable sets in 1874. The concept of ``computable set'' arose in the study of computing models in the 1930s by the founders of…
This paper presents some considerations about the Goldbach's conjecture (GC). The work is based on elementary results of the number theory and it provides a constructive method that permits, given an even integer, to find at least a pair of…
A problem of completing a linear map on C*-algebras to a completely positive map is analyzed. It is shown that whenever such a completion is feasible there exists a unique minimal completion. This theorem is used to show that under some…
The CQC conjecture by Schneeloch et al. (Physical Review A 90.6, 2014) asserts that the sum of classical mutual information between two parties obtained by measuring individual systems in two mutually unbiased bases cannot exceed their…
The celebrated union-closed conjecture is concerned with the cardinalities of various subsets of the Boolean $d$-cube. The cardinality of such a set is equivalent, up to a constant, to its measure under the uniform distribution, so we can…
We prove that order convergence on a Boolean algebra turns it into a compact convergence space if and only if this Boolean algebra is complete and atomic. We also show that on an Archimedean vector lattice, order intervals are compact with…
We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…
Many solutions of Einstein's field equations contain closed timelike curves (CTC). Some of these solutions refer to ordinary materials in situations which might occur in the laboratory, or in astrophysics. It is argued that, in default of a…
Quasi-Boolean algebras were introduced as the generalization of Boolean algebras in the setting of quantum computation logic. In this paper, we investigate the completeness and congruences of quasi-Boolean algebras. First, we discuss the…
We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…
This thesis aims to provide a suite of techniques to generate completeness results for coalgebraic logics with axioms of arbitrary rank. We have chosen to investigate the possibility to generalize what is arguably one of the most successful…
In this note we prove that the constant and equivariant cyclic cohomology of algebras coincide. This shows that constant cyclic cohomology is rich and computable.
The principle of `absoluteness of cause' (AC) assumes the cause-effect relation to be observer independent and is a distinct assertion than prohibiting occurrence of any causal loop. Here, we study implication of this novel principle to…
These are notes for a series of lectures presented at the ASIDE conference 2016. The definition of a cluster algebra is motivated through several examples, namely Markov triples, the Grassmannians $Gr_2(\mathbb{C})$, and the appearance of…
We formulate the Hauptvermutung of Causal Set Theory in two mathematically well-defined but different ways one of which turns out to be wrong and the other one turns out to be true. A further result is that the Hauptvermutung is true if we…
Scaled Boolean algebras are a category of mathematical objects that arose from attempts to understand why the conventional rules of probability should hold when probabilities are construed, not as frequencies or proportions or the like, but…
Causal structures give us a way to understand the origin of observed correlations. These were developed for classical scenarios, but quantum mechanical experiments necessitate their generalisation. Here we study causal structures in a broad…
We characterize the canonical diagonal subalgebra of the C*-algebra associated with a generalized Boolean dynamical system. We also introduce a particular commutative subalgebra, which we call the abelian core, in our C*-algebra. We then…