-
In this short note, we prove that the first-order formulas preserved
under ultrafilter extensions are not recursively enumerable.
-
Syntactic disambiguators for natural languages often use "Treebank
Grammars": probabilistic grammars which are directly projected from an
annotated corpus. In this paper we show that for describing these
systems in the framework of Estimation Theory, we must generalize this
theory so that it allo...
-
I argue that both the 'rigid' and 'non-rigid' or 'descriptive'
interpretations of the reference of nominals have an explanation in
the structure or linguistic form of these nominals, hence are
conditioned broadly syntactically. This seems desirable under
assumptions of a 'transparent' and composi...
-
Afscheidscollege Dick de Jongh
-
For many years Isaac Levi has been a staunch defender of a strictly
normative and prescriptive conception of rationality. The origin and
motivation for this crucial commitment, as it transpires particularly
clearly in The Covenant of Reason, has been Levi's exploration and
development of the Peir...
-
We prove EXPTIME-completeness of the satisfiability problem for
guarded and loosely guarded first-order formulas with a bounded number
of variables and an unbounded number of constants. Guarded fragments
with constants are interesting because of their connection to hybrid
logic.
-
-
Is Timing Tempo-Specific?
An Online Internet Experiment on Perceptual Invariance of Timing in Music
Henkjan Honing
Abstract:
This study is concerned with the question whether there is perceptual invariance of expressive timing under tempo-transformation in music performance. This is investigated...
-
-
Hybrid logic refers to a group of logics lying between modal and
first-order logic in which one can refer to individual states of the
Kripke structure. In particular, the hybrid logic HL(@,!) is an
appealing extension of modal logic that allows one to refer to a state
by means of nominals and to ...
-
Multi-context systems (MCS) can be used to represent contextual
information flow. We show that the semantics of an MCS is completely
determined by the information that is obtained when simulating the
MCS, in such a way that a _minimal_ amount of information is deduced
at each step of the simulat...