-
Coalgebra develops a general theory of transition systems,
parametric in a functor $T$; the functor $T$ specifies the possible
one-step behaviours of the system. A fundamental question in this
area is how to obtain, for an arbitrary functor $T$, a logic for
$T$-coalgebras. We compare two existing...
-
In the theory of infinite games with slightly imperfect information,
the main question (whether the axiom of determinacy and the axiom of
Blackwell determinacy are equivalent) is still open. In this paper, we
shift the discussion to games with uncountably many possible moves,
introducing the axio...
-
This paper starts with an informal introduction to inquisitive
semantics. After that, we present a formal definition of the
semantics, and introduce the basic semantic notions of inquisitiveness
and informativeness, in terms of wich we define the semantic
categories of questions, assertions, and ...
-
Our investigation enriches and explains some data obtained by McMillan
and Troiani. We have shown that the computational model correctly
predicts that quantifiers computable by finite-automata are easier to
understand than quantifiers recognized by push-down automata. It
improves results of McMil...
-
We investigate the comprehension of simple quantifiers in natural
language as described in a computational model posited by many
linguists and logicians. In particular, we compare time needed for
understanding different types of quantifiers. We show that the
computational distinction between quan...
-
This paper discusses models of set theory without the Axiom of
Choice. We investigate all possible patterns of the cofinality function
and the distribution of measurability on the first three uncountable
cardinals. The result relies heavily on a strengthening of an
unpublished result of Kechris: we...
-
The distinction between data and phenomena introduced by Bogen and
Woodward (1988) was meant to help accounting for scientific practice,
especially in relation with scientific theory testing. Their article
and the subsequent discussion is primarily viewed as internal to
philosophy of science. We ...
-
The present paper applies well-investigated modal logics to provide
formal foundations to specific fragments of argumentation theory. This
logic-driven analysis of argumentation allows: first, to systematize
several results of argumentation theory reformulating them within
suitable formal languag...
-
For a large natural class of forcing notions, we prove general
equivalence theorems between forcing absoluteness statements,
regularity properties, and transcendence properties over L and the
core model K. We use our results to answer open questions from set
theory of the reals.
-
We study Craig interpolation for fragments and extensions of
propositional linear temporal logic (PLTL). We consider various
fragments of PLTL obtained by restricting the set of temporal
connectives and, for each of these fragments, we identify its smallest
extension that has Craig interpolation....
-
The norm implementation problem consists in how to see to it that the
agents in a system comply with the norms specified for that system by
the system designer. It is part of the more general problem of how to
synthesize or create norms for multi-agent systems, by, for example,
highlighting the ch...