The new field of judgment aggregation aims to merge many individual sets of judgments on logically interconnected propositions into a single collective set of judgments on these propositions. Judgment aggregation has commonly been studied using classical propositional logic, with a limited expressive power and a problematic representation of conditional statements (“if p then q ”) as material conditionals. In this methodological paper, i present a simple unified model of judgment aggregation in general logics. I show how many realistic decision problems can be represented in it. This includes decision problems expressed in languages of standard propositional logic, predicate logic (e.g. Preference aggregation problems), modal or conditional logics, and some multi-valued or fuzzy logics. I provide a list of simple tools for working with general logics, and i prove impossibility results that generalise earlier theorems.