# Tableaux for the Logic of Strategically Knowing How

arXiv: https://arxiv.org/abs/2307.05066 · HTML: https://mlsanity.com/paper/2307.05066/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 9 of its 27 references that are in the map.
- First posted on arXiv 11 Jul 2023.

## Builds on (most cited first, 9 of 9)

- [Together We Know How to Achieve: An Epistemic Logic of Know-How](https://mlsanity.com/paper/1705.09349/) (2017)
- [Beyond knowing that: a new generation of epistemic logics](https://mlsanity.com/paper/1605.01995/) (2016)
- [Strategically knowing how](https://mlsanity.com/paper/1705.05254/) (2017)
- [Strategic Coalitions with Perfect Recall](https://mlsanity.com/paper/1707.04298/) (2017)
- [A Logic of Knowing How](https://mlsanity.com/paper/1505.06651/) (2015)
- [A Logic of Knowing Why](https://mlsanity.com/paper/1609.06405/) (2016)
- [Epistemic Logic of Know-Who](https://mlsanity.com/paper/2012.06651/) (2020)
- ["Knowing value" logic as a normal modal logic](https://mlsanity.com/paper/1604.08709/) (2016)
- [Uncertainty-Based Semantics for Multi-Agent Knowing How Logics](https://mlsanity.com/paper/2106.11492/) (2021)

## Abstract (arXiv)

The logic of goal-directed knowing-how extends the standard epistemic logic with an operator of knowing-how. The knowing-how operator is interpreted as that there exists a strategy such that the agent knows that the strategy can make sure that p. This paper presents a tableau procedure for the multi-agent version of the logic of strategically knowing-how and shows the soundness and completeness of this tableau procedure. This paper also shows that the satisfiability problem of the logic can be decided in PSPACE.