10 problems

The paper considers a quantifier-free term modal logic without function symbols, augmented with the basic assignment modalities from dynamic logic. Decidability conjecture. This fr…

Inferentialist conjecture. The inferentialist view of meaning as being derived from use — in particular, from inference in P-tS — provides a fruitful perspective on the concept of…

ALUT non-unknowability conjecture. For all $\varphi\in\textbf{ALUT}$ and all $i\in\textbf{I}$,

Let there be two agents, $A$ and $B$. Let $\phi$ be a sentence in $\lang_1(\bSigmaPri)$, and let $\alpha$ be an action in $\lang_1(\bSigmaPri)$ whose announcements are all private:…

Let $A$ be the set of agents, and let $\KBfour+\mathbf{NE}+(\mathbf{SA_a})_{a \in A}$ be the axiom system consisting of the $KB4_n$ axioms together with the non-emptiness axiom…

Appearance-belief adjunction conjecture. Appearance should be left adjoint to belief:

Sequent calculi conjecture. It should be possible to give perhaps labelled sequent calculi for ERL and $\mathrm{ERL}^*$ that provide a similar operational reading of evolution to t…

Let the Strong Mechanistic Thesis be the theory asserting that a truthful mechanical knowing agent satisfies the relevant background theory of knowledge, including the stipulated k…

A truthful mechanical knowing machine is an idealized agent that knows facts in a quantified arithmetic-based language containing a connective $K$ for its own knowledge. Reinhardt'…

Natural language uses contexts to evaluate epistemic formulas, with an epistemic operator such as $\mathbf{K}_j$ potentially shifting evaluation from one context to another. Kaplan…