#### Filter Results:

#### Publication Year

2010

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We present a formal semantical model to capture action, belief and intention, based on the " database perspective " (Shoham 2009). We then provide postulates for belief and intention revision, and state a representation theorem relating our postulates to the formal model. Our belief postulates are in the spirit of the AGM theory ; the intention postulates… (More)

A well-known open problem in epistemic logic is to give a syntactic characterization of the successful formulas. Semantically, a formula is successful if and only if for any pointed model where it is true, it remains true after deleting all points where the formula was false. The classic example of a formula that is not successful in this sense is the "… (More)

In this paper, we explore semantics for comparative epistemic modals that avoid the entailment problems based on finitely additive measures, we introduce semantics based on qualitatively additive measures, as well as semantics based on purely qualitative orderings, including orderings on propositions derived from orderings on worlds in the tradition of… (More)

The semantic automata framework, developed originally in the 1980s, provides computational interpretations of generalized quantifiers. While recent experimental results have associated structural features of these automata with neuroanatom-ical demands in processing sentences with quantifiers, the theoretical framework has remained largely unexplored. In… (More)

Unlike standard modal logics, many dynamic epistemic logics are not closed under uniform substitution. The classic example is Public Announcement Logic (PAL), an extension of epistemic logic based on the idea of information acquisition as elimination of possibilities. In this paper, we address the open question of whether the set of schematic validities of… (More)

- Wesley H. Holliday, Peter Hawke, Thomas Icard, Ethan Jerzak, Krista Lawlor, John Perry +4 others
- 2014

If knowledge required the elimination of all logically possible alternatives, there would be no knowledge (at least of contingent truths). There are always, it seems, possibilities that our evidence is powerless to eliminate. .. . If knowledge. .. requires the elimination of all competing possibilities. .. then, clearly we seldom, if ever, satisfy the… (More)

We study possible algorithmic models for the picture verification task with double-quantified sentences of the form 'Some X are connected with every Y'. We show that the ordering of quantifiers, either Some • Every or Every • Some, influences the cognitive difficulty of the task. We discuss how computational modeling can account for the varying cognitive… (More)

Unlike standard modal logics, many dynamic epistemic logics are not closed under uniform substitution. A distinction therefore arises between the logic and its substitution core, the set of formulas all of whose substitution instances are valid. The classic example of a non-uniform dynamic epistemic logic is Public Announcement Logic (PAL), and a well-known… (More)