Presents a mathematically rigorous, philosophically sound foundation for a science of information.

Hybrid languages have both modal and first-order characteristics: a Kripke semantics, and explicit variable binding apparatus. This paper motivates the development of hybrid languages, sketches their history, and examines the expressive power of three hybrid binders. We show that all three binders give rise to languages strictly weaker than the corresponding first-order language, that full first-order expressivity can be gained by adding the universal modality, and that all three binders can force the existence of infinite models and have undecidable satisfiability (...) problems. (shrink)

In this paper we explore the relationship between norms of belief revision that may be adopted by members of a community and the resulting dynamic properties of the distribution of beliefs across that community. We show that at a qualitative level many aspects of social belief change can be obtained from a very simple model, which we call ‘threshold influence’. In particular, we focus on the question of what makes the beliefs of a community stable under various dynamical situations. We (...) also consider refinements and alternatives to the ‘threshold’ model, the most significant of which is to consider changes to plausibility judgements rather than mere beliefs. We show first that some such change is mandated by difficult problems with belief-based dynamics related to the need to decide on an order in which different beliefs are considered. Secondly, we show that the resulting plausibility-based account results in a deterministic dynamical system that is non-deterministic at the level of beliefs. (shrink)

We shed light on an old problem by showing that the logic LP cannot define a binary connective $\odot$ obeying detachment in the sense that every valuation satisfying $\varphi$ and $(\varphi\odot\psi)$ also satisfies $\psi$ , except trivially. We derive this as a corollary of a more general result concerning variable sharing.

Dynamic epistemic logic (DEL) extends purely modal epistemic logic (S5) by adding dynamic operators that change the model structure. Propositional dynamic logic (PDL) extends basic modal logic with programs that allow the de nition of complex modalities. We provide a common generalisation: a logic that is dynamic in both senses, and one that is not limited to S5 as its modal base. It also incorporates, and signi cantly generalises, all the features of existing extensions of DEL such as BMS [3] (...) and LCC [21]. Our dynamic operators work in two steps. First, they provide a multiplicity of transformations of the original model, one for each action in a purely syntactic action structure (in the style of BMS). Second, they specify how to combine these multiple copies to produce a new model. In each step, we use the generality of PDL to specify the transformations. The main technical contribution of the paper is to provide an axiomatisation of this general dynamic dynamic logic (GDDL). This is done by providing a computable translation of GDDL formulas to equivalent PDL formulas, thus reducing the logic to PDL, which is decidable. The proof involves switching between representing programs as terms and as automata. We also show that both BMS and LCC are special cases of GDDL, and that there are interesting applications that require the additional generality of GDDL, namely the modelling of private belief update. More recent extensions and variations of BMS and LCC are also discussed. (shrink)

History of Logic in China: 5 Questions is a collection of short interviews based on 5 questions presented to some of the most influential and prominent scholars in the field. We hear their views on the field, the aim, the scopes, the future direction of research and how their work fits in these respects. Interviews with Rens Bod, Chung-Ying Cheng, Cui Qingtian, Dong Zhitie, Chris Fraser, Yiu-Ming Fung, Jane Geaney, Chad Hansen, Christoph Harbsmeier, Ju Zhonglin, Hsien-Chung Lee, Jer-Shiarn Lee, Michiel (...) Leezenberg, Liu Peiyu, Thierry Lucas, Gregor Paul, Dan Robins, Shen Jianying, Sun Zhongyuan, Wang Kexi, Yang Wujin, Zhai Jincheng, Zheng Weihong, Zhou Shan and Zhou Yunzhi. (shrink)

Ceteris Paribus clauses in reasoning are used to allow for defeaters of norms, rules or laws, such as in von Wright’s example “I prefer my raincoat over my umbrella, everything else being equal”. In earlier work, a logical analysis is offered in which sets of formulas Γ, embedded in modal operators, provide necessary and sufficient conditions for things to be equal in ceteris paribus clauses. For most laws, the set of things allowed to vary is small, often finite, and so (...) Γ is typically infinite. Yet the axiomatisation they provide is restricted to the special and atypical case in which Γ is finite. We address this problem by being more flexible about ceteris paribus conditions, in two ways. The first is to offer an alternative, slightly more general semantics, in which the set of formulas only give necessary but not sufficient conditions. This permits a simple axiomatisation. (shrink)

This volume presents work that evolved out of the Third Conference on Situation Theory and Its Applications, held at Oiso, Japan, in November of 1991. The chapters presented in this volume continue the mathematical development of situation theory, including the introduction of a graphical notation; and the applications of situation theory discussed are wide-ranging, including topics in natural language semantics and philosophical logic, and exploring the use of information theory in the social sciences. The research presented in this volume reflects (...) a growing international and interdisciplinary activity of importance for many fields concerned with information. (shrink)

Turing's (1936) analysis of effective symbolic procedures is a model of conceptual clarity that plays an essential role in the philosophy of mathematics. Yet appeal is often made to the effectiveness of human procedures in other areas of philosophy. This paper addresses the question of whether Turing's analysis can be applied to a broader class of effective human procedures. We use Sieg's (1994) presentation of Turing's Thesis to argue against Cleland's (1995) objections to Turing machines and we evaluate her proposal (...) to understand the effectiveness of procedures in terms of their reliability and precision. A number of conditions for effectiveness are identified and these are used to provide a general argument against the possibility of a Leibnizian decision procedure. (shrink)