-
Quantified hybrid logic is quantified modal logic extended with
apparatus for naming states and asserting that a formula is true at a
named state. While interpolation and Beth's definability theorem fail
in a number of well known quantified modal logics (for example in
quantified modal K, T, D, S...
-
In this paper we deal with the logic of Bisimulation Quantifiers
BQL. This is a logic extending PDL by means of bisimulation
quantifiers: an existential bisimulation quantifier acts like a
standard existential set quantifier but allows to look for a set not
only within the model, but in any other...
-
A general strategy for proving completeness theorems for quantified
modal logics is provided. Starting from free quantified modal logic
K, with or without identity, extensions obtained either by adding
the principle of universal instantiation or the converse of the
Barcan formula or the Barcan fo...
-
In this paper it is argued that Hintikka's game theoretical semantics
for Independence Friendly logic does not formalize the intuitions
about independent choices; it rather is a formalization of imperfect
information. Furthermore it is shown that the logic has several
strange properties. An alter...
-
This paper describes a precise linguistic counterpart to the notion of
a regular equivalence relation on a social network. That is, a formal
language of position terms is defined with the property that on finite
networks, two actors are regularly equivalent if and only if they
cannot be distingui...
-
We add a rule for Nash-consistency to Coalition Logic, a modal logic
for reasoning about the abilities and rights of groups in multi-agent
systems. Rights of agents (constitutions) can be formalised using
Coalition Logic, and the additional inference rule of Nash-consistency
will guarantee that a...
-
Arithmetical definability has been extensively studied over the
natural numbers. In this paper, we take up the study of arithmetical
definability over finite structures, motivated by the correspondence
between uniform $\AC^0$ and $\FO(\PLUS,\TIMES)$. We prove finite
analogs of three classic res...
-
Choice sequences are sequences not completely determined by a law. We
state that the introduction of particular choice sequences by Brouwer
in the late twenties was not recognised as such. We claim that their
later use in the method of the creative subject was not traced back to
this original use...
-
It was proved in McKinsey and Tarski [7] that every finite
well-connected closure algebra is embedded into the closure algebra of
the power set of the real line R. Pucket [10] extended this result to
all finite connected closure algebras by showing that there exists an
open map from R to any fini...
-
For an Euclidean space $\mathbb{R}^n$, let $L_n$ denote the modal
logic of chequered subsets of $\mathbb{R}^n$. For every $n\geq 1$, we
characterize $L_n$ using the more familiar Kripke semantics, thus
implying that each $L_n$ is a tabular logic over the well-known modal
system Grz of Grzegorczyk...
-
In this paper, the theory of generic structures is put in a general,
unified framework. The framework is applied to Hrushovski's
'universal domains' and Poizat's 'bicoloured fields'. Of particular
interest will be the conditions under which generic structures are
saturated.