Open Access Publications from the University of California

## Working Papers

For information about the Group in Logic and the Methodology of Science at UC Berkeley, please visit http://logic.berkeley.edu.

## Split Cycle: A New Condorcet Consistent Voting Method Independent of Clones and Immune to Spoilers

(2020)

We introduce a new Condorcet consistent voting method, called Split Cycle. Split Cycle belongs to the small family of known voting methods satisfying independence of clones and the Pareto principle. Unlike other methods in this family, Split Cycle satisfies a new criterion we call immunity to spoilers, which concerns adding candidates to elections, as well as the known criteria of positive involvement and negative involvement, which concern adding voters to elections. Thus, relative to other clone-independent Paretian methods, Split Cycle mitigates “spoiler effects” and “strong no show paradoxes.”

(2020)

## On the Logic of Belief and Propositional Quantification

(2020)

We consider extending the modal logic KD45, commonly taken as the baseline system for belief, with propositional quantifiers that can be used to formalize natural language sentences such as “everything I believe is true” or “there is some-thing that I neither believe nor disbelieve.” Our main results are axiomatizations of the logics with propositional quantifiers of natural classes of complete Boolean algebras with an operator (BAOs) validating KD45. Among them is the class of complete, atomic, and completely multiplicative BAOs validating KD45. Hence, by duality, we also cover the usual method of adding propositional quantifiers to normal modal logics by considering their classes of Kripke frames. In addition, we obtain decidability for all the concrete logics we discuss.

(2020)

(2020)

(2020)

## Reflection ranks and ordinal analysis

(2020)

It is well-known that natural axiomatic theories are well-ordered by consistency strength. However, it is possible to construct descending chains of artificial theories with respect to consistency strength. We provide an explanation of this well-orderness phenomenon by studying a coarsening of the consistency strength order, namely, the $\Pi^1_1$ reflection strength order. We prove that there are no descending sequences of $\Pi^1_1$ sound extensions of $\mathsf{ACA}_0$ in this order. Accordingly, we can attach a rank in this order, which we call reflection rank, to any $\Pi^1_1$ sound extension of $\mathsf{ACA}_0$. We prove that for any $\Pi^1_1$ sound theory $T$ extending $\mathsf{ACA}_0^+$, the reflection rank of $T$ equals the proof-theoretic ordinal of $T$. We also prove that the proof-theoretic ordinal of $\alpha$ iterated $\Pi^1_1$ reflection is $\varepsilon_\alpha$. Finally, we use our results to provide straightforward well-foundedness proofs of ordinal notation systems based on reflection principles.

(2019)

(2019)

## On the Logics with Propositional Quantifiers Extending S5Π

(2018)

Scroggs's theorem on the extensions of S5 is an early landmark in the modern mathematical studies of modal logics. From it, we know that the lattice of normal extensions of S5 is isomorphic to the inverse order of the natural numbers with infinity and that all extensions of S5 are in fact normal. In this paper, we consider extending Scroggs's theorem to modal logics with propositional quantifiers governed by the axioms and rules analogous to the usual ones for ordinary quantifiers. We call them Π-logics. Taking S5Π, the smallest normal Π-logic extending S5, as the natural counterpart to S5 in Scroggs's theorem, we show that all normal Π-logics extending S5Π are complete with respect to their complete simple S5 algebras, that they form a lattice that is isomorphic to the lattice of the open sets of the disjoint union of two copies of the one-point compactification of N, that they have arbitrarily high Turing-degrees, and that there are non-normal Π-logics extending S5Π.