Related papers: Choiceless Chain Conditions
Analysis often splits change into components. For example, how much of the observed variance is caused by genes or environment? In many cases, the split is ultimately made by the logic of the chain rule, which divides the difference of a…
When we work with information from multiple sources, the formalism each employs to handle uncertainty may not be uniform. In order to be able to combine these knowledge bases of different formats, we need to first establish a common basis…
Classifier chains are an effective technique for modeling label dependencies in multi-label classification. However, the method requires a fixed, static order of the labels. While in theory, any order is sufficient, in practice, this order…
Recent work has unveiled a theory for reasoning about the decisions made by binary classifiers: a classifier describes a Boolean function, and the reasons behind an instance being classified as positive are the prime-implicants of the…
In a recent paper (quant-ph/0102133) Chen, Liang, Li and Huang suggest a necessary and sufficient separability criterion, which is supposedly practical in judging the separability of any mixed state. In this note we briefly recapitulate…
This paper deals with strong structural controllability of linear systems. In contrast to existing work, the structured systems studied in this paper have a so-called zero/nonzero/arbitrary structure, which means that some of the entries…
We present a theory for slicing probabilistic imperative programs -- containing random assignments, and ``observe'' statements (for conditioning) -- represented as probabilistic control-flow graphs (pCFGs) whose nodes modify probability…
Restricting the chain-antichain principle CAC to partially ordered sets which respect the natural ordering of the integers is a trivial distinction in the sense of classical reverse mathematics. We utilize computability-theoretic reductions…
Measuring the statistical dependence between observed signals is a primary tool for scientific discovery. However, biological systems often exhibit complex non-linear interactions that currently cannot be captured without a priori knowledge…
In many applications, it is important to be able to explain the decisions of machine learning systems. An increasingly popular approach has been to seek to provide \emph{counterfactual instance explanations}. These specify close possible…
The notion of clause set cycle abstracts a family of methods for automated inductive theorem proving based on the detection of cyclic dependencies between clause sets. By discerning the underlying logical features of clause set cycles, we…
Distinguishability takes a crucial rule in studying observability of hybrid system such as switched system. Recently, for two linear systems, Lou and Si gave a condition not only necessary but also sufficient to the distinguishability of…
In the first part of this paper, we consider several natural axioms in urelement set theory, including the Collection Principle, the Reflection Principle, the Dependent Choice scheme and its generalizations, as well as other axioms…
We work in set-theory without choice ZF. Denoting by AC(N) the countable axiom of choice, we show in ZF+AC(N) that the closed unit ball of a uniformly convex Banach space is compact in the convex topology (an alternative to the weak…
We prove that if there exists a simplified $(\omega_1,2)$-morass, then there is a ccc forcing which adds an $\omega_3$-chain in P($\omega_1$) mod finite and a ccc forcing which adds a family of $\omega_3$-many strongly almost disjoint…
We present sufficient conditions for the existence of forced oscillations in non-autonomous mechanical systems. Previously, similar results were obtained for systems with friction. Presented results hold both for systems with and without…
In this paper we prove that the maximum principle in forcing is equivalent to the axiom of choice. The maximum principle is the property of forcing: p ||- exists x theta(x) iff for some name tau p ||- theta(tau). We also look at three…
We define a potentialist system of ZF-structures, that is, a collection of possible worlds in the language of ZF connected by a binary accessibility relation, achieving a potentialist account of the full background set-theoretic universe…
Deciding the positivity of a sequence defined by a linear recurrence with polynomial coefficients and initial condition is difficult in general. Even in the case of recurrences with constant coefficients, it is known to be decidable only…
If T has only countably many complete types, yet has a type of infinite multiplicity then there is a ccc forcing notion Q such that, in any Q --generic extension of the universe, there are non-isomorphic models M_1 and M_2 of T that can be…