SLOGICA
2010
13 years 7 months ago
2010
SLOGICA
2010
13 years 7 months ago
2010
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...
SLOGICA
2010
13 years 11 months ago
2010
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...
SLOGICA
2010
13 years 11 months ago
2010
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...
SLOGICA
2010
13 years 11 months ago
2010
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; ...