相关论文: On Kinds of Indiscernibility in Logic and Metaphys…

Identical classical particles are distinguishable. This distinguishability affects the number of ways W a macrostate can be realized on the micro-level, and from the relation S = k ln W leads to a non-extensive expression for the entropy.…

We attack the classification problem of multi-faced independences, the first non-trivial example being Voiculescu's bi-freeness. While the present paper does not achieve a complete classification, it formalizes the idea of lifting an…

We give criteria for real, complex and quaternionic representations to define s-representations, focusing on exceptional Lie algebras defined by spin representations. As applications, we obtain the classification of complex representations…

It has been widely acknowledged that probabilistic independence and logical independence cannot be coherently reconciled. By bridging these two notions, this paper addresses three long-standing problems that have puzzled the field of…

We say a structure $M$ in a first-order language is indivisible if for every coloring of its universe in two colors, there is a monochromatic substructure $M'$ of $M$ such that $M'$ is isomorphic to $M$. Additionally, we say that $M$ is…

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

The notion of multiplicity of a module first arose as consequence of Hilbert's work on commutative algebra, relating the dimension of rings with the degree of certain polynomials. For noncommutative rings, the notion of multiplicity first…

Bisimilarity is a central notion for coalgebras. In recent work, Geuvers and Jacobs suggest to focus on apartness, which they define by dualising coalgebraic bisimulations. This yields the possibility of finite proofs of distinguishability…

Both empirical and theoretical objective science can only access relations, revealing nothing about the intrinsic nature of the entities "in relation". We typically refer to these entities as "matter", assuming their nature is irrelevant…

Ultrafinitism postulates that we can only compute on relatively short objects, and numbers beyond certain value are not available. This approach would also forbid many forms of infinitary reasoning and allow to remove certain paradoxes…

A well-known version of Rowbottom's theorem for supercompactness ultrafilters leads naturally to notions of two-cardinal Ramseyness and corresponding normal ideals introduced herein. Generalizing results of Baumgartner [7, 8], Feng [22] and…

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…

This work explores the connection between logical independence and the algebraic structure of quantum mechanics. Building on results by Brukner et al., it introduces the notion of \textit{onto-epistemic ignorance}: situations in which the…

For a system of N qubits, spanning a Hilbert space of dimension d=2^N, it is known that there exists d+1 mutually unbiased bases. Different construction algorithms exist, and it is remarkable that different methods lead to sets of bases…

A geometric approach to formulate the uncertainty principle between quantum observables acting on an $N$-dimensional Hilbert space is proposed. We consider the fidelity between a density operator associated with a quantum system and a…

We introduce a novel semantics for a multi-agent epistemic operator of knowing how, based on an indistinguishability relation between plans. Our proposal is, arguably, closer to the standard presentation of knowing that modalities in…

To model is to represent. The threshold of decidability defines two epistemological choices: one model (or a finite number of models) suffices for representing the dynamics below the undecidable; above this threshold (defined as…

Quantum theory's irreducible empirical core is a probability calculus. While it presupposes the events to which (and on the basis of which) it serves to assign probabilities, and therefore cannot account for their occurrence, it has to be…

In this note, we present two new identities for derangements. As a corollary, we have a combinatorial proof of the irreducibility of the standard representation of symmetric groups.

Let $R$ denote a 2-fir. The notions of F-independence and algebraic subsets of R are defined. The decomposition of an algebraic subset into similarity classes gives a simple way of translating the F-independence in terms of dimension of…