English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

Judgment aggregation models a group of agents having to collectively decide over a number of logically interconnected issues starting from their individual opinions. In recent years, a growing literature has focused on the design of logical systems for social choice theory, and for judgment aggregation in particular, making use of logical languages designed  ad hoc  for this purpose. In this paper we deploy the existing formalism of Dynamic Logic of Propositional Assignments ( DL-PA ), an instance of Propositional Dynamic Logic where atomic programs affect propositional valuations. We show that  DL-PA  is a well-suited formalism for modeling the aggregation of binary judgments from multiple agents, by providing logical equivalences in  DL-PA  for some of the best-known aggregation procedures, desirable axioms coming from the literature on judgment aggregation and properties for the safety of the agenda problem.

Judgment aggregation in dynamic logic of propositional assignments