Related papers: A countable Boolean algebra that is Reichenbach's …
In this paper we prove a generalization of a theorem of Schneider, which gives a criterion for a projective surface over the complex numbers to have an ample cotangent bundle. After reviewing different notions of positivity, we introduce a…
We study the question of when an uncountable ccc topological space $X$ contains a ccc subspace of size $\aleph_1$. We show that it does if $X$ is compact Hausdorff and more generally if $X$ is Hausdorff with $\mathrm{pct}(X) \leq \aleph_1$.…
It is unprovable that every complete subalgebra of a countably closed complete Boolean algebra is countably closed.
This is a brief and informal introduction to cluster algebras. It roughly follows the historical path of their discovery, made jointly with A.Zelevinsky. Total positivity serves as the main motivation.
We define a general notion of "summability" of a set $I\subseteq\mathbb{C^{N}}$ and show that some trivial condition necessary for a set to be summable, is also sufficient. We deduce some intresting corollaries.
we prove that if $X$ is a locally compact $\sigma$-compact space then on its quotient, $\gamma(X)$ say, determined by the algebra of all real valued bounded continuous functions on $X$, the quotient topology and the completely regular…
Commonsense causality reasoning (CCR) aims at identifying plausible causes and effects in natural language descriptions that are deemed reasonable by an average person. Although being of great academic and practical interest, this problem…
Reversible computation is key in developing new, energy-efficient paradigms, but also in providing forward-only concepts with broader definitions and finer frames of study.Among other fields, the algebraic specification and representation…
The effect of Richard T. Cox's contribution to probability theory was to generalize Boolean implication among logical statements to degrees of implication, which are manipulated using rules derived from consistency with Boolean algebra.…
The sufficient-component cause framework assumes the existence of sets of sufficient causes that bring about an event. For a binary outcome and an arbitrary number of binary causes any set of potential outcomes can be replicated by positing…
Let $\mathsf{E}$ be the event space of an experiment that can be indefinitely repeated. A natural question arises: given a countable cardinal $\kappa$, which is the event space of the $\kappa$-times repeated experiment? In the case of…
In recent research, some of the present authors introduced the concept of an n-dimensional Boolean algebra and its corresponding propositional logic nCL, generalising the Boolean propositional calculus to n>= 2 perfectly symmetric truth…
Boolean satisfiability problem has applications in various fields. An efficient algorithm to solve satisfiability problem can be used to solve many other problems efficiently. The input of satisfiability problem is a finite set of clauses.…
We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the…
The Calculus of Conjunctive Queries (CCQ) has foundational status in database theory. A celebrated theorem of Chandra and Merlin states that CCQ query inclusion is decidable. Its proof transforms logical formulas to graphs: each query has a…
We prove a version of the Cuntz--Krieger Uniqueness Theorem for $C^*$-algebras of arbitrary relative generalized Boolean dynamical systems. We then describe properties of a $C^*$-algebra of a relative generalized Boolean dynamical system…
The calculus of constructions (CC) is a core theory for dependently typed programming and higher-order constructive logic. Originally introduced in Coquand's 1985 thesis, CC has inspired 25 years of research in programming languages and…
W.H. Woodin showed that if $\kappa_1 < \cdots < \kappa_n$ are strong cardinals then two-step ${\bf\Sigma}^1_{n+3}$ generic absoluteness holds after collapsing $2^{2^{\kappa_n}}$ to be countable. We show that this number can be reduced to…
Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…
Under the assumption that the continuum c is a regular cardinal, we prove the existence and uniqueness of a Boolean algebra B of size c defined by sharing the main structural properties that P(N)/fin has under CH and in the aleph2-Cohen…