pith. sign in

Moss & Chris Steinsvold (2007 ): T opology and Epistemic Logic

Rohit Parikh, Lawrence S · 2007 · DOI 10.1007/978-1-4020-5587-4

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it
open at publisher browse 3 citing papers

fields

math.LO 2 cs.LO 1

years

2026 2 2019 1

verdicts

UNVERDICTED 3

representative citing papers

Uncertainty About Evidence

cs.LO · 2019-07-22 · unverdicted · novelty 6.0

Introduces models with world-dependent evidence sets to distinguish actual evidence entailment from known entailment, with a sound and complete bi-modal axiomatization generalizing topological spaces.

What can Topology tell us about Logical Complexity?

math.LO · 2026-05-13 · unverdicted · novelty 2.0

A computable variant of the gamified Katětov order on filters is isomorphic to the Lawvere-Tierney order, linking combinatorial complexity measures to computability in topos theory.

citing papers explorer

Showing 3 of 3 citing papers.

  • The Gamified Kat\v{e}tov order is not linear (in fact, very much not so) math.LO · 2026-05-20 · unverdicted · none · ref 27

    The Gamified Katětov order embeds P(ω)/Fin, yielding antichains of size continuum and new non-modest degrees in the extended Weihrauch hierarchy.

  • Uncertainty About Evidence cs.LO · 2019-07-22 · unverdicted · none · ref 26

    Introduces models with world-dependent evidence sets to distinguish actual evidence entailment from known entailment, with a sound and complete bi-modal axiomatization generalizing topological spaces.

  • What can Topology tell us about Logical Complexity? math.LO · 2026-05-13 · unverdicted · none · ref 27

    A computable variant of the gamified Katětov order on filters is isomorphic to the Lawvere-Tierney order, linking combinatorial complexity measures to computability in topos theory.