Related papers: Completeness and Transitivity of Preferences on Mi…
This paper continues the author's previous study \cite{Kura20}, showing that several weak principles inspired by non-normal modal logic suffice to derive various refined forms of the second incompleteness theorem. Among the main results of…
This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…
The remarkable generalization performance of large-scale models has been challenging the conventional wisdom of the statistical learning theory. Although recent theoretical studies have shed light on this behavior in linear models and…
This paper studies the strategic manipulation of set-valued social choice functions according to Kelly's preference extension, which prescribes that one set of alternatives is preferred to another if and only if all elements of the former…
In this note we present a characterisation of all unary and binary patterns that do not only contain variables, but also reversals of their instances. These types of variables were studied recently in either more general or particular…
We prove (ZF+DC) e.g. : if mu =|H(mu)| then mu^+ is regular non measurable. This is in contrast with the results for mu = aleph_{omega} on measurability see Apter Magidor [ApMg]
This paper presents six theorems and ten propositions that can be read as deconstructing and integrating the continuity postulate under the rubric of pioneering work of Eilenberg, Wold, von Neumann-Morgenstern, Herstein-Milnor and Debreu.…
The notion of disjoint $\mathcal{A}$-transitivity for a Furstenberg family $\mathcal{A}$ is introduced with the aim to generalize properties derived from disjoint hypercyclic operators. We begin a systematic study by showing some of the…
We advance a general theory of coherent preference that surrenders restrictions embodied in orthodox doctrine. This theory enjoys the property that any preference system admits extension to a complete system of preferences, provided it…
As it was argued by Anderson [Science 177, 393 (1972)], the "reductionist" hypothesis does not by any means imply a "constructionist" one. Hence, in general, the behavior of large and complex aggregates of elementary components can not be…
Analyzing the consistency of preferences is an important step in decision making with pairwise comparison matrices, and several indices have been proposed in order to estimate it. In this paper we prove the proportionality between some…
The topic of this paper is the Finiteness Conjecture for minimally unsatisfiable clause-sets (MUs), stating that for each fixed deficiency (number of clauses minus number of variables) there are only finitely many patterns, given a certain…
Preferences for mixing can reveal ambiguity perception and attitude on a single event. The validity of the approach is discussed for multiple preference classes including maxmin, maxmax, variational, and smooth second-order preferences. An…
Inclusion dependencies form one of the most widely used dependency classes. We extend existing results on the axiomatization and computational complexity of their implication problem to two extended variants. We present an alternative…
Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…
A relation extends another relation consistently if its symmetric, respectively its asymmetric, part contains the corresponding part of the smaller relation. It is shown that there exists no finite circular chain made from two transitive…
The dynamical behavior of switched affine systems is known to be more intricate than that of the well-studied switched linear systems, essentially due to the existence of distinct equilibrium points for each subsystem. First, under…
We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product.…
The theory of optimal choice sets is a solution theory that has a long and well-established tradition in social choice and game theories. Some of important general solution concepts of choice problems when the set of best alternatives does…
We extend our theory of amorphous packings of hard spheres to binary mixtures and more generally to multicomponent systems. The theory is based on the assumption that amorphous packings produced by typical experimental or numerical…