In this paper we present a sequent calculus for propositional dynamic logic built using an enriched version of the tree-hypersequent method and including an infinitary rule for the...
Abstract. Representing an epistemic situation involving several agents obviously depends on the modeling point of view one takes. We start by identifying the types of modeling poin...
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
Abstract. For a first-order formula ϕ(x; y) we introduce and study the characteristic sequence Pn : n < ω of hypergraphs defined by Pn(y1, . . . , yn) := (∃x) i≤n ϕ(x; ...