This paper presents logics for reasoning about extension and reduction of partial information states. This enterprise amounts to non-persistent variations of certain constructive logics, in particular the so-called logic of constructible falsity of [Nelson 1949.]. We provide simple semantics, sequential calculi, completeness and decidability proofs.

, ,
, , , ,
Department of Computer Science [CS]

Jaspars, J.O.M. (1995). Partial up and down logic. Department of Computer Science [CS]. CWI.