Related papers: The Nuisance Principle in Infinite Settings
This paper studies preference aggregation under risk. In our model, each agent has an incomplete preference relation represented by a set of expected utility functions. The classical Pareto principle is silent on agreement involving…
Neutrinos allow for a test of the hypothesis that the fermions of the Standard Model have Fermi-point splitting, analogous to the fermionic quasi-particles of certain condensed-matter systems. If present, the corresponding Lorentz-violating…
Black hole perturbation theory beyond second order is not well understood because typically one defines the meaning of gauge invariance order by order which is ambiguous. In this series of works we therefore developed a new approach which…
We propose a notion of fairness for allocation problems in which different agents may have different reservation utilities, stemming from different outside options, or property rights. Fairness is usually understood as the absence of envy,…
Ordinary first-order logic has the property that two formulas \phi and \psi have the same meaning in a structure if and only if the formula ``\phi iff \psi'' is true in the structure. We prove that independence-friendly logic does not have…
We consider two-variable first-order logic FO2 over infinite words. Restricting the number of nested negations defines an infinite hierarchy; its levels are often called the half-levels of the FO2 quantifier alternation hierarchy. For every…
The paper starts with the proposal that the cause of the apparent insolubility of the free-will problem are several popular but strongly metaphysical notions and hypotheses. To reduce the metaphysics, some ideas are borrowed from physics. A…
A discrepancy principle for solving nonlinear equations with monotone operators given noisy data is formulated. The existence and uniqueness of the corresponding regularization parameter $a(\delta)$ is proved. Convergence of the solution…
We discuss the connection between various orders on the class of all the ultrafilters and certain compactness properties of abstract logics and of topological spaces. We present a model theoretical characterization of Comfort order. We…
It is proved in Chon{\'e} and Le Meur (2001) that the problem of minimizing a Dirichlet-like functional of the function $u\_h$ discretized with $P\_1$ Finite Elements, under the constraint that $u\_h$ be convex, cannot converge. Here, we…
The adoption of automated, data-driven decision making in an ever expanding range of applications has raised concerns about its potential unfairness towards certain social groups. In this context, a number of recent studies have focused on…
We compare the cosmological first-order post-Newtonian (1PN) approximation with the relativistic cosmological linear perturbation theory in a zero-pressure medium with the cosmological constant. We compare equations and solutions in several…
In the nineties Immerman and Medina initiated the search for syn- tactic tools to prove NP-completeness. In their work, amongst several results, they conjecture that the NP-completeness of a problem defined by the conjunction of a sentence…
In this paper we propose an interpretation for self-referential propositions in a "meta-model" N* of ZF. This meta-model N* is considered as an informal model of arithmetic that mathematicians often use when working with number theory.…
This paper proves that arrangement of music is NP-hard when subject to various constraints: avoiding musical dissonance, limiting how many notes can be played simultaneously, and limiting transition speed between chords. These results imply…
It is known that there exists a first-order sentence that holds in a finite group if and only if the group is soluble. Here it is shown that the corresponding statements with 'solubility' replaced by 'nilpotence' and 'perfectness', among…
When aggregating Subjective Expected Utility preferences, the Pareto principle leads to an impossibility result unless the individuals have a common belief. This paper examines the source of this impossibility in more detail by considering…
This paper maps out the relation between different approaches for handling preferences in argumentation with strict rules and defeasible assumptions by offering translations between them. The systems we compare are: non-prioritized defeats…
The consistency formula for set theory can be stated in terms of the free-variables theory of primitive recursive maps. Free-variable p. r. predicates are decidable by set theory, main result here, built on recursive evaluation of p. r. map…
Concerns about interpretability, computational resources, and principled inductive priors have motivated efforts to engineer sparse neural models for NLP tasks. If sparsity is important for NLP, might well-trained neural models naturally…