In this paper, I develop an algorithmic impossible-worlds model of belief and knowledge that provides a middle ground between models that entail that everyone is logically omniscient and those that are compatible with even the most egregious kinds of logical incompetence. In outline, the model entails that an agent believes (knows) φ just in case she can easily (and correctly) compute that φ is true and thus has the capacity to make her actions depend on whether φ. The model thereby (...) captures the standard view that belief and knowledge ground are constitutively connected to dispositions to act. As I explain, the model improves upon standard algorithmic models developed by Parikh, Halpern, Moses, Vardi, and Duc, among other ways, by integrating them into an impossible-worlds framework. The model also avoids some important disadvantages of recent candidate middle-ground models based on dynamic epistemic logic or step logic, and it can subsume their most important advantages. (shrink)

This is the second part of a two-part series on the logic of hyperlogic, a formal system for regimenting metalogical claims in the object language (even within embedded environments). Part A provided a minimal logic for hyperlogic that is sound and complete over the class of all models. In this part, we extend these completeness results to stronger logics that are sound and complete over restricted classes of models. We also investigate the logic of hyperlogic when the language is enriched (...) with hyperintensional operators such as counterfactual conditionals and belief operators. (shrink)

We develop and defend a new approach to counterlogicals. Non-vacuous counterlogicals, we argue, fall within a broader class of counterfactuals known as counterconventionals. Existing semantics for counterconventionals, 459–482 ) and, 1–27 ) allow counterfactuals to shift the interpretation of predicates and relations. We extend these theories to counterlogicals by allowing counterfactuals to shift the interpretation of logical vocabulary. This yields an elegant semantics for counterlogicals that avoids problems with the usual impossible worlds semantics. We conclude by showing how this approach (...) can be extended to counterpossibles more generally. (shrink)