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

We propose a Condorcet consistent voting method that we call Split Cycle. Split Cycle belongs to the small family of known voting methods that significantly narrow the choice of winners in the presence of majority cycles while also satisfying independence of clones. In this family, only 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, in contrast to other clone-independent methods, Split Cycle mitigates both "spoiler effects" and "strong no show paradoxes."Comment: 71 pages, 15 figures. Added a new explanation of Split Cycle in Section 1, updated the caption to Figure 2, the discussion in Section 3.3, and Remark 4.11, and strengthened Proposition 6.20 to Theorem 6.20 to cover single-voter resolvability in addition to asymptotic resolvability. Thanks to Nicolaus Tideman for helpful discussio

Complete Additivity and Modal Incompleteness

In this paper, we tell a story about incompleteness in modal logic. The story weaves together a paper of van Benthem, `Syntactic aspects of modal incompleteness theorems,' and a longstanding open question: whether every normal modal logic can be characterized by a class of completely additive modal algebras, or as we call them, V-BAOs. Using a first-order reformulation of the property of complete additivity, we prove that the modal logic that starred in van Benthem's paper resolves the open question in the negative. In addition, for the case of bimodal logic, we show that there is a naturally occurring logic that is incomplete with respect to V-BAOs, namely the provability logic GLB. We also show that even logics that are unsound with respect to such algebras do not have to be more complex than the classical propositional calculus. On the other hand, we observe that it is undecidable whether a syntactically defined logic is V-complete. After these results, we generalize the Blok Dichotomy to degrees of V-incompleteness. In the end, we return to van Benthem's theme of syntactic aspects of modal incompleteness

Indicative Conditionals and Dynamic Epistemic Logic

Recent ideas about epistemic modals and indicative conditionals in formal semantics have significant overlap with ideas in modal logic and dynamic epistemic logic. The purpose of this paper is to show how greater interaction between formal semantics and dynamic epistemic logic in this area can be of mutual benefit. In one direction, we show how concepts and tools from modal logic and dynamic epistemic logic can be used to give a simple, complete axiomatization of Yalcin's [16] semantic consequence relation for a language with epistemic modals and indicative conditionals. In the other direction, the formal semantics for indicative conditionals due to Kolodny and MacFarlane [9] gives rise to a new dynamic operator that is very natural from the point of view of dynamic epistemic logic, allowing succinct expression of dependence (as in dependence logic) or supervenience statements. We prove decidability for the logic with epistemic modals and Kolodny and MacFarlane's indicative conditional via a full and faithful computable translation from their logic to the modal logic K45.Comment: In Proceedings TARK 2017, arXiv:1707.0825

A fundamental non-classical logic

We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present a Fitch-style natural deduction system for the logic that contains only the introduction and elimination rules for the logical constants. From this starting point, if one adds the rule that Fitch called Reiteration, one obtains a proof system for intuitionistic logic in the given signature; if instead of adding Reiteration, one adds the rule of Reductio ad Absurdum, one obtains a proof system for orthologic; by adding both Reiteration and Reductio, one obtains a proof system for classical logic. Arguably neither Reiteration nor Reductio is as intimately related to the meaning of the connectives as the introduction and elimination rules are, so the base logic we identify serves as a more fundamental starting point and common ground between proponents of intuitionistic logic, orthologic, and classical logic. The algebraic semantics for the logic we motivate proof-theoretically is based on bounded lattices equipped with what has been called a weak pseudocomplementation. We show that such lattice expansions are representable using a set together with a reflexive binary relation satisfying a simple first-order condition, which yields an elegant relational semantics for the logic. This builds on our previous study of representations of lattices with negations, which we extend and specialize for several types of negation in addition to weak pseudocomplementation; in an appendix, we further extend this representation to lattices with implications. Finally, we discuss adding to our logic a conditional obeying only introduction and elimination rules, interpreted as a modality using a family of accessibility relations.Comment: added topological representation of bounded lattices with implications in Appendi

An impossibility theorem concerning positive involvement in voting

In social choice theory with ordinal preferences, a voting method satisfies the axiom of positive involvement if adding to a preference profile a voter who ranks an alternative uniquely first cannot cause that alternative to go from winning to losing. In this note, we prove a new impossibility theorem concerning this axiom: there is no ordinal voting method satisfying positive involvement that also satisfies the Condorcet winner and loser criteria, resolvability, and a common invariance property for Condorcet methods, namely that the choice of winners depends only on the ordering of majority margins by size

Axioms for Defeat in Democratic Elections

We propose six axioms concerning when one candidate should defeat another in a democratic election involving two or more candidates. Five of the axioms are widely satisfied by known voting procedures. The sixth axiom is a weakening of Kenneth Arrow's famous condition of the Independence of Irrelevant Alternatives (IIA). We call this weakening Coherent IIA. We prove that the five axioms plus Coherent IIA single out a voting procedure studied in our recent work: Split Cycle. In particular, Split Cycle is the most resolute voting procedure satisfying the six axioms for democratic defeat. In addition, we analyze how Split Cycle escapes Arrow's Impossibility Theorem and related impossibility results.Comment: 41 page

Carbohydrate mouth rinse improves resistance exercise capacity in the glycogen-lowered state

The effect of carbohydrate mouth rinse (CHO MR) on resistance exercise performance is equivocal, and may be moderated by carbohydrate availability. This study determined the effect of CHO MR on low-load resistance exercise capacity completed in a fed but glycogen-lowered state. Twelve resistance-trained men (age: 22±4 years; height: 1.79±0.05m; weight: 78.7±7.8kg; bench press 1-RM: 87±21kg; squat 1-RM: 123±19kg) completed two fed-state resistance exercise bouts consisting of 6 sets of bench press and 6 sets of squat to failure at 40% 1-RM. Each bout was preceded by glycogen-depleting cycling the evening before, with feeding controlled to create acute energy deficit and maintain low muscle glycogen. During resistance exercise, participants rinsed with either a 6% CHO MR solution or a taste-matched placebo (PLA) between sets. Total volume workload was greater with CHO MR (9354±2051kg vs. 8525±1911kg, p=0.010). Total number of repetitions of squat were greater with CHO MR (107±26 vs. 92±16, p=0.017); the number of repetitions of bench press were not significantly different (CHO MR: 120±24 vs. PLA: 115±22, p=0.146). This was independent of differences in feeling or arousal. CHO MR may be an effective ergogenic aid for athletes completing resistance exercise when in energy deficit and with low carbohydrate availability. Novelty • CHO MR can increase low-load resistance exercise capacity undertaken in a glycogen-lowered but fed state. • This effect was driven by a greater number of repetitions-to-failure in the squat – using muscles lowered in glycogen content with exhaustive cycling on the evening prior to resistance exercise – but not bench press

Educational Leadership Preparation: What Supervisors, Candidates, And Mentors Said

The findings of this study identified practicum areas that meet the educational demands of candidates while highlighting practicum areas that need improvement. The study contributes to the knowledge base of the field by drawing upon feedback from university supervisors, school mentors and program candidates to evaluate and improve the practicum experience in the educational leadership program. Program candidates are in the best position to discuss their recent experiences of exposure to the real world. Supervisors and mentors can witness from their first hand experience how effective practicum activities work. Responses from supervisors, mentors and candidates regarding leadership practicum experiences are valuable to program developers in their future program redesign effort. Practicum experiences expose candidates to real-world school leadership experiences. Unfortunately, because of all kinds of conditional limitations, such practicum experiences can only be offered in conjunction with candidates' regular work in school. However, leadership practicum experiences can be well planned with a high collaboration of supervisors, mentors and candidates who have an invested interest in school improvement. In this study, what we learn from the differences of perceptions among supervisors, mentors and candidates is a caution to all stakeholders that we need to do a better job to prepare the next generation of school leaders. Supervisors, mentors and candidates need to form a coalition to explore other options, especially out-of-the-box strategies, to deliver a highly effective practicum program for potential educational leaders.&nbsp

Impossibility theorems involving weakenings of expansion consistency and resoluteness in voting

A fundamental principle of individual rational choice is Sen's $\gamma$ axiom, also known as expansion consistency, stating that any alternative chosen from each of two menus must be chosen from the union of the menus. Expansion consistency can also be formulated in the setting of social choice. In voting theory, it states that any candidate chosen from two fields of candidates must be chosen from the combined field of candidates. An important special case of the axiom is binary expansion consistency, which states that any candidate chosen from an initial field of candidates and chosen in a head-to-head match with a new candidate must also be chosen when the new candidate is added to the field, thereby ruling out spoiler effects. In this paper, we study the tension between this weakening of expansion consistency and weakenings of resoluteness, an axiom demanding the choice of a single candidate in any election. As is well known, resoluteness is inconsistent with basic fairness conditions on social choice, namely anonymity and neutrality. Here we prove that even significant weakenings of resoluteness, which are consistent with anonymity and neutrality, are inconsistent with binary expansion consistency. The proofs make use of SAT solving, with the correctness of a SAT encoding formally verified in the Lean Theorem Prover, as well as a strategy for generalizing impossibility theorems obtained for special types of voting methods (namely majoritarian and pairwise voting methods) to impossibility theorems for arbitrary voting methods. This proof strategy may be of independent interest for its potential applicability to other impossibility theorems in social choice.Comment: Forthcoming in Mathematical Analyses of Decisions, Voting, and Games, eds. M. A. Jones, D. McCune, and J. Wilson, Contemporary Mathematics, American Mathematical Society, 202