-
-
We compare two logical notions of information, one from situation
theory based on correlation between situations, and one from epistemic
logic, based on ranges of alternatives. We show how both lead to
modal logics, that can be merged in a natural way, to obtain a
decidable guarded-style fragmen...
-
We survey modal logics of spatial structure in topology, starting from
classical results by Tarski and McKinsey, up to modern techniques in
modal logic, including bisimulation and specially designed extended
modal languages. Work covered includes that of several communities in
Georgia, The Nether...
-
We work throughout in the theory ZF+AD+DC. In the mid 80's, Jackson
computed the values of the projective ordinals \delta^1_n. The upper
bound in the general case appears in [J2], and the complete argument
for \delta^1_5 appears in [J1]. We refer the reader to [Mo] or [Ke]
for the definitions and...
-
We define a notion of combinatorial labelling, and show that Delta-0-2 is the largest boldface pointclass in which every set admits a combinatorial labelling.
-
We show how belief revision can be treated systematically in the
format of dynamic-epistemic logic, with belief operators added. The
core engine are update rules for preference relations which have been
proposed independently in the dynamic epistemic literature for
preference change. The result i...
-
This work is the author's Master's thesis written under the supervision of Yo Matsubara at the Graduate School of Information Sciences at Nagoya University. In the thesis, the author proves that Sigma-1-3 Sacks absoluteness is equivalent to Delta-1-2 Sacks measurability.
-
We survey the recent developments in the investigation of Blackwell determinacy axioms. It is generally believed that ordinary (Gale-Stewart) determinacy and Blackwell determinacy for infinite games are equivalent in a strong sense, but this conjecture (of Tony Martin's) has not yet been prov...
-
Revision is a method to deal with non-monotonic processes. It has been
used in theory of truth an an answer to semantic paradoxes as the
liar, but the idea is universal and resurfaces in many areas of logic
and applications of logic. In this survey, we describe the general
idea in the framework ...
-
Multiagent resource allocation is a timely and exciting area of
research at the interface of Computer Science and Economics. One of
the main challenges in this area is the high complexity of
negotiation. In particular, the complexity of the task of identifying
rational deals, i.e. deals that are...
-
Notions of fairness have recently received increased attention in the
context of resource allocation problems, pushed by diverse
applications where not only pure utilitarian efficiency is sought. In
this paper, we study a framework where allocations of goods result
from distributed negotiation co...