-
We propose a dynamic-epistemic analysis of perceptual knowledge placing structured observational events at center stage. Our starting point is the specific entanglement of epistemic accessibility with the relation of ‘closeness’ or similarity, that is claimed in the so-called Margin of Error prin...
-
Graph games are interactive scenarios with a wide range of applications. This position paper discusses old and new graph games in tandem with matching logics, and identifies general questions behind this match. Throughout, we pursue two strands: logic as a way of analyzing existing games, and log...
-
This is an entry for the Stanford Encyclopedia of Philosophy surveying the broad area of logics for analyzing games. The main topics are Game Structure, Nature of Players, and Analyzing Play, while additional topics include interfaces of logi and probability in the arena of games.
-
The theory BCZF is obtained from constructive Zermelo-Fraenkel set theory CZF by restricting the collection schemes to bounded formulas. We prove that BCZF has the de Jongh property with respect to every intermediate logic that is characterised by a class of Kripke frames.
-
We introduce r.e. prime powers as the least common multiple of the recursive ultrapowers of N of Hirschfeld and the r.e. ultrapowers of N of Hirschfeld & Wheeler. R.e. prime powers help us with establishing that r.e. ultrapowers admit no non-identity self-embeddings, settling an issue raised by H...
-
Neighborhood models for modal logic are generalized quantifiers, parametrized to points in the domain of objects/worlds. We explore this analogy further, connecting generalized quantifier theory and modal neighborhood logic. We find interesting analogies between conservativity for linguistic quan...
-
We prove an analogue of the McKinsey and Tarski theorem for the recently introduced dense-interior semantics of topological evidence logics. In particular, we show that in this semantics the modal logic S4.2 is sound and complete for any dense-in-itself metrizable space. As a result S4.2 is compl...
-
Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor T on some full subcategory of the category Top of topological spaces and continuous functions. W...
-
Blum-Shub-Smale machines are a classical model of com- putability over the real line. In [9], Koepke and Seyfferth generalised Blum-Shub-Smale machines to a transfinite model of computability by allowing them to run for a transfinite amount of time. The model of Koepke and Seyfferth is asymmetric...
-
Taking a historical line, we discuss major aspects of rationality from a logical and computational perspective. Topics include classical notions from the foundations of computability, insights from the de- velopment of computer science and AI, and the picture of rationality emerging in current lo...
-
We present a framework for epistemic logic, modeling the logical aspects of System 1 (“fast”) and System 2 (“slow”) cognitive processes, as per dual process theories of reasoning. The framework combines non-normal worlds semantics with the techniques of Dynamic Epistemic
Logic. It models non-log...