-
As proposed in various places, a set of propositional formulas, each
associated with a numerical weight, can be used to model the
preferences of an agent in combinatorial domains. If the range of
possible choices can be represented by the set of possible assignments
of propositional symbols to t...
-
This paper discusses a case study of the board game of Scotland Yard
from a computational perspective. Interestingly, Scotland Yard is a
genuine "playgame" with imperfect information. For reasons not
completely clear to me, games with imperfect information have escaped
the interest of researchers...
-
Exemplar-based models of language propose that human language
production and understanding operate with a store of concrete
linguistic experiences rather than with abstract linguistic
rules. While exemplar-based models are well acknowledged in areas like
phonology and morphology, common wisdom ha...
-
How is scientific knowledge used, adapted and extended in deriving
phenomena and real-world systems? This paper aims at developing a
general account of "applying science" within the exemplar-based
framework of Data-Oriented Processing (DOP), which is also known as
Exemplar-Based Explanation (EBE)...
-
Current dynamic-epistemic logics model different types of information change
in multi-agent scenarios. We propose a way to generalize these logics to a
probabilistic setting, obtaining a calculus for multi-agent update with
different slots for probability, and a matching dynamic logic of informat...
-
The study of large cardinal axioms is an active part of contemporary
set theory. For a large cardinal notion there are often several
definitions possible. For example, two common ways to define a large
cardinal notion is as a critical point of an elementary embedding with
certain properties, or i...
-
Infinite games have been a valuable tool to characterize classes of
real-valued functions. In this paper we present the basic multitape
game and the multitape eraser game and show that both games
characterize a class of functions satisfying a certain partition
property.
-
We present a game characterizing the Borel functions on Baire Space.
-
In this course we give an introduction to intuitionistic logic. We
concentrate on the propositional calculus mostly, make some minor
excursions to the predicate calculus and to the use of intuitionistic
logic in intuitionistic formal systems, in particular Heyting
Arithmetic. We have chosen a sel...
-
We investigate the asymptotic properties of the logical system for
information update developped by Baltag, Moss and Soleck. We build on
the idea of looking at update logics as dynamical systems. We show
that every epistemic formula either always holds or is always refuted
from certain moment on,...
-
For an ordinary Turing machine that stops in a finite number $t of
steps, it is easy to define its space usage: during its computation,
it has used at most $t cells of the tape, possibly less. This finite
number of used cells can serve as a measure of space usage. A halting
computation will have ...