All existing impossibility theorems on judgment aggregation over logically connected propositions have one of two restrictions: they either use a controversial system-aticity condition or apply only to special agendas of propositions with rich logical connections. An important open question is whether judgment aggregation faces any serious impossibilities without these restrictions. Here we prove the first im-possibility theorem without systematicity that applies to all standard agendas: there exists no judgment aggregation rule satisfying universal domain, collective rationality, anonymity and a new condition called unbiasedness. For many agendas, anonymity can be weakened. Applied illustratively to (strict) preference aggregation represen...