Related papers: Arrow's Impossibility Theorem Without Unanimity
The properties of strongly gravitating systems suggest that field theory overcounts the states of a system. Reducing the number of degrees of freedom, without abandoning the notion of effective field theory, may be achieved through a…
We study functional limit theorems for linear type processes with short memory under the assumption that the innovations are dependent identically distributed random variables with infinite variance and in the domain of attraction of stable…
This article redefines arbitrariness not as a normative flaw or a symptom of domination, but as a foundational functional mechanism structuring human systems and interactions. Diverging from critical traditions that conflate arbitrariness…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
An automorphism of a group G is called an IA-automorphism if it induces the identity automorphism on the abelianized group G/G'. Let IA(G) denote the group of all IA-automorphisms of G. We classify all finitely generated nilpotent groups G…
Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…
We describe a simple derivation of virial relations (VR) for arbitrary action-governed systems. These follow directly from the action with no need to go via the equations of motion. When some of the degrees of freedom are of the same type a…
This paper investigates a purely qualitative version of Savage's theory for decision making under uncertainty. Until now, most representation theorems for preference over acts rely on a numerical representation of utility and uncertainty…
This is the second of five papers comprising The Semantic Arrow of Time. Part I established that computing's arrow of time is semantic rather than thermodynamic, and that the Forward-In-Time-Only (FITO) assumption constitutes a category…
In this short paper, we use the Rudin-Frolik order to shed light on the differing structures of invisible dictatorships given by Arrow-type social welfare functions over a countably infinite number of voters.
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
This work examines the Conditional Approval Framework for elections involving multiple interdependent issues, specifically focusing on the Conditional Minisum Approval Voting Rule. We first conduct a detailed analysis of the computational…
The Gibbard-Satterthwaite theorem is a cornerstone of social choice theory, stating that an onto social choice function cannot be both strategy-proof and non-dictatorial if the number of alternatives is at least three. The Duggan-Schwartz…
We present two linked theorems on passivity: the passive behavior theorem, parts 1 and 2. Part 1 provides necessary and sufficient conditions for a general linear system, described by a set of high order differential equations, to be…
A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e.…
Paper develops axiomatic characterization of the family of majority vote rules in the way alternative to characterization of the majority vote given in paper of Kenneth O. May in the 1952. This, similar but different, axiomatics focuses on…
Multi-winner approval-based voting has received considerable attention recently. A voting rule in this setting takes as input ballots in which each agent approves a subset of the available alternatives and outputs a committee of…
The Expansion property considered by researchers in Social Choice is shown to correspond to a logical property of nonmonotonic consequence relations that is the {\em pure}, i.e., not involving connectives, version of a previously known weak…
Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts…
We disprove a well-known conjecture of Boston (2000), which claims that a just-infinite pro-$p$ group is branch if and only if it admits a positive-dimensional embedding in the group of $p$-adic automorphisms. This is obtained as a result…