Modal logics are coalgebraic

Applications of modal logics are abundant in computer science, and a large number of structurally different modal logics have been successfully employed in a diverse spectrum of application contexts. Coalgebraic semantics, on the other hand, provides a uniform and encompassing view on the large variety of specific logics used in particular domains. The coalgebraic approach is generic and compositional: tools and techniques simultaneously apply to a large class of application areas and can moreover be combined in a modular way. In particular, this facilitates a pick-and-choose approach to domain specific formalisms, applicable across the entire scope of application areas, leading to generic software tools that are easier to design, to implement, and to maintain. This paper substantiates the authors' firm belief that the systematic exploitation of the coalgebraic nature of modal logic will not only have impact on the field of modal logic itself but also lead to significant progress in a number of areas within computer science, such as knowledge representation and concurrency/mobility

Edgeworth on the Foundations of Ethics and Probability

This paper analyses the foundation of utilitarian ethics and theory of probability in the works of Francis Y. Edgeworth. We argue that he pursued an unitary philosophical project, the search for a common epistemological foundation for the social sciences. The common root of the disciplines is the notion of “hereditary experience” derived from Herbert Spencer’s work. We suggest that this reconstruction can modify the overall interpretation of Edgeworth’s thought.F.Y. Edgeworth, Probability, Utilitarianism

Applications of Finite Model Theory: Optimisation Problems, Hybrid Modal Logics and Games.

There exists an interesting relationships between two seemingly distinct fields: logic from the field of Model Theory, which deals with the truth of statements about discrete structures; and Computational Complexity, which deals with the classification of problems by how much of a particular computer resource is required in order to compute a solution. This relationship is known as Descriptive Complexity and it is the primary application of the tools from Model Theory when they are restricted to the finite; this restriction is commonly called Finite Model Theory. In this thesis, we investigate the extension of the results of Descriptive Complexity from classes of decision problems to classes of optimisation problems. When dealing with decision problems the natural mapping from true and false in logic to yes and no instances of a problem is used but when dealing with optimisation problems, other features of a logic need to be used. We investigate what these features are and provide results in the form of logical frameworks that can be used for describing optimisation problems in particular classes, building on the existing research into this area. Another application of Finite Model Theory that this thesis investigates is the relative expressiveness of various fragments of an extension of modal logic called hybrid modal logic. This is achieved through taking the Ehrenfeucht-Fraïssé game from Model Theory and modifying it so that it can be applied to hybrid modal logic. Then, by developing winning strategies for the players in the game, results are obtained that show strict hierarchies of expressiveness for fragments of hybrid modal logic that are generated by varying the quantifier depth and the number of proposition and nominal symbols available

Extensions of choice behaviour

Consumer Choice

A Review of a Case Against Blaise Pascal and His Heirs

A Review of The Probable and the Provable by L. Jonathan Cohe

Platonism, De Re, and (Philosophy of) Mathematical Practice

The chapter advances a reformulation of the classical problem of the nature of mathematical objects (if any), here called "Plato's problem," in line with the program of a philosophy of mathematical practice. It then provides a sketch of a platonist solution, following the same perspective. This solution disregards as nonsensical the question of the existence of abstract, and specifically mathematical, objects, by rather focusing on the modalities of our access to them: objects (in general, both concrete and abstract) are regarded as individual contents that we have (or can have) a de re epistemic access to. The question of the existence of mathematical objects is then replaced by that of the modalities of our de re epistemic access to individual mathematical contents