Formalizing May's Theorem

10/11/2022
by   Kwing Hei Li, et al.
0

This report presents a formalization of May's theorem in the proof assistant Coq. It describes how the theorem statement is first translated into Coq definitions, and how it is subsequently proved. Various aspects of the proof and related work are discussed. To the best of the author's knowledge, this project is the first documented attempt in mechanizing May's Theorem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/26/2017

Proving Parikh's theorem using Chomsky-Schutzenberger theorem

Parikh theorem was originally stated and proved by Rohkit Parikh in MIT ...
research
03/29/2019

Corrigendum to "Counting Database Repairs that Satisfy Conjunctive Queries with Self-Joins"

The helping Lemma 7 in [Maslowski and Wijsen, ICDT, 2014] is false. The ...
research
02/08/2020

Majority Voting and the Condorcet's Jury Theorem

There is a striking relationship between a three hundred years old Polit...
research
11/27/1999

Cox's Theorem Revisited

The assumptions needed to prove Cox's Theorem are discussed and examined...
research
01/09/2018

A detailed treatment of Doob's theorem

Doob's theorem provides guarantees of consistent estimation and posterio...
research
10/15/2017

The Complete Extensions do not form a Complete Semilattice

In his seminal paper that inaugurated abstract argumentation, Dung prove...
research
12/09/2021

A solution to Ringel's circle problem

We construct families of circles in the plane such that their tangency g...

Please sign up or login with your details

Forgot password? Click here to reset