Abstract - A set family F that is a subset of 2^[n], [n]={1,...,n} is said to have the Eventown property if all its component sets are even sized and the intersection of any two of these sets is even sized. The Eventown theorem states a bound for the size of F in this case, namely |F| ≤ 2^[n/2]. The aim of the thesis is to discuss a generalization of the Eventown theorem through the lens of additive combinatorics.