Related papers: Topological Connectedness and Behavioral Assumptio…
Null Hypothesis Statistical Testing is a dominant framework for conducting statistical analysis across the sciences. There remains considerable debate as to whether, and under what circumstances, evidence can be said to be confirmatory of a…
The structure of the set of positivity-preserving maps between matrix algebras is notoriously difficult to describe. The notable exceptions are the results by St{\o}rmer and Woronowicz from 1960s and 1970s settling the low dimensional…
A semigroup of binary relations (under composition) on a set $X$ is \emph{complemented} if it is closed under the taking of complements within $X\times X$. We resolve a 1991 problem of Boris Schein by showing that the class of finite unary…
We introduce the concept of matching connectivity as a notion of connectivity in graph admitting perfect matchings which heavily relies on the structural properties of those matchings. We generalise a result of Robertson, Seymour and Thomas…
The present paper investigates consequence relations that are both non-monotonic and paraconsistent. More precisely, we put the focus on preferential consequence relations, i.e. those relations that can be defined by a binary preference…
We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…
We establish the Subgradient Theorem for monotone correspondences -- a monotone correspondence is equal to the subdifferential of a potential if and only if it is conservative, i.e. its integral along a closed path vanishes irrespective of…
It is shown that order-invariance of two-variable first-logic is decidable in the finite. This is an immediate consequence of a decision procedure obtained for the finite satisfiability problem for existential second-order logic with two…
Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…
We address the problem of conditional termination, which is that of defining the set of initial configurations from which a given program always terminates. First we define the dual set, of initial configurations from which a…
Two salient notions of sameness of theories are synonymy, also known as definitional equivalence, and bi-interpretability. Of these two definitional equivalence is the strictest notion. In which cases can we infer synonymy from…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
According to the exact controllability theory, the controllability is investigated analytically for two typical types of self-similar bipartite networks, i.e., the classic deterministic scale-free networks and Cayley trees. Due to their…
We examine three probabilistic concepts related to the sentence "two variables have no bearing on each other". We explore the relationships between these three concepts and establish their relevance to the process of constructing similarity…
We resolve three long-standing open problems, namely the (algorithmic) decidability of network coding, the decidability of conditional information inequalities, and the decidability of conditional independence implication among random…
Comparing alternatives in pairs is a well-known method of ranking creation. Experts are asked to perform a series of binary comparisons and then, using mathematical methods, the final ranking is prepared. As experts conduct the individual…
Given a set U of alternatives, a choice (correspondence) on U is a contractive map c defined on a family Omega of nonempty subsets of U. Semantically, a choice c associates to each menu A in Omega a nonempty subset c(A) of A comprising all…
A model of the Einstein-Bohr double-slit experiment is formulated in a fully quantum theoretical setting. In this model, the state and dynamics of a movable wall that has the double slits in it, as well as the state of a particle incoming…
The inference of an underlying network topology from local observations of a complex system composed of interacting units is usually attempted by using statistical similarity measures, such as Cross-Correlation (CC) and Mutual Information…
Over the past two decades, complex network theory provided the ideal framework for investigating the intimate relationships between the topological properties characterizing the wiring of connections among a system's unitary components and…