 Voting semantics is based on the idea that different agents (voters) may coherently judge the same proposition differently. The proportion of agents that accept a proposition \(\varphi\) as true may be seen as a truth-value. Without further restrictions this does not lead to a truth-functional semantics, but rather to an assignment of probabilities to propositions. But if one assigns a fixed level of skepticism to each agent and imposes some natural conditions that keep the judgments on logically complex statements consistent with those levels, then one can recover \(\min\), \(\max\), and \(1-x\) as truth-functions for conjunction, disjunction and negation, respectively. Details can be found in Lawry 1998.