Which rules for aggregating judgments on logically connected propositions are manipulable and which not? In this paper, we introduce a preference-free concept of non-manipulability and contrast it with a preference-theoretic concept of strategy-proofness. We characterize all non-manipulable and...

Decisions or arguments over multiple interconnected propositions are path-dependent if they depend on the order in which the propositions are considered. I develop a model of sequential decision or argumentation processes over multiple propositions, focussing on so-called modus ponens processes....

Which rules for aggregating judgments on logically connected propositions are manipulable and which not? In this paper, we introduce a preference-free concept of non-manipulability and contrast it with a preference-theoretic concept of strategy-proofness. We characterize all non-manipulable and...

How can different individuals' probability assignments to some events be aggregated into a collective probability assignment? Classic results on this problem assume that the set of relevant events -- the agenda -- is a σ-algebra and is thus closed under disjunction (union) and conjunction...