The philosophy of information (PI) is a new area of research with its own field of investigation and methodology. This article, based on the Herbert A. Simon Lecture of Computing and Philosophy I gave at Carnegie Mellon University in 2001, analyses the eighteen principal open problems in PI. Section 1 introduces the analysis by outlining Herbert Simon's approach to PI. Section 2 discusses some methodological considerations about what counts as a good philosophical problem. The discussion centers on Hilbert's famous analysis (...) of the central problems in mathematics. The rest of the article is devoted to the eighteen problems. These are organized into five sections: problems in the analysis of the concept of information, in semantics, in the study of intelligence, in the relation between information and nature, and in the investigation of values. (shrink)

A Theory of Truth and Semantic Representation Hans Kamp. INTRODUCTION Two conceptions of meaning have dominated formal semantics of natural language. ...

This paper outlines a quantitative theory of strongly semantic information (TSSI) based on truth-values rather than probability distributions. The main hypothesis supported in the paper is that the classic quantitative theory of weakly semantic information (TWSI), based on probability distributions, assumes that truth-values supervene on factual semantic information, yet this principle is too weak and generates a well-known semantic paradox, whereas TSSI, according to which factual semantic information encapsulates truth, can avoid the paradox and is more in line with the (...) standard conception of what generally counts as semantic information. After a brief introduction, section two outlines the semantic paradox implied by TWSI, analysing it in terms of an initial conflict between two requisites of a quantitative theory of semantic information. In section three, three criteria of semantic information equivalence are used to provide a taxonomy of quantitative approaches to semantic information and introduce TSSI. In section four, some further desiderata that should be fulfilled by a quantitative TSSI are explained. From section five to section seven, TSSI is developed on the basis of a calculus of truth-values and semantic discrepancy with respect to a given situation. In section eight, it is shown how TSSI succeeds in solving the paradox. Section nine summarises the main results of the paper and indicates some future developments. (shrink)

The tripartite account of propositional, fallibilist knowledge that p as justified true belief can become adequate only if it can solve the Gettier Problem. However, the latter can be solved only if the problem of a successful coordination of the resources (at least truth and justification) necessary and sufficient to deliver propositional, fallibilist knowledge that p can be solved. In this paper, the coordination problem is proved to be insolvable by showing that it is equivalent to the ''''coordinated attack'''' problem, (...) which is demonstrably insolvable in epistemic logic. It follows that the tripartite account is not merely inadequate as it stands, as proved by Gettier-type counterexamples, but demonstrably irreparable in principle, so that efforts to improve it can never succeed. (shrink)

The renaissance of epistemology between the two world wars forms a bridge between early modern and contemporary philosophy of knowledge. This paper traces the resurgence of interest in epistemology at the turn of the century, as a reaction against the nineteenth-century development of Neo-Kantian and Neo-Hegelian idealism, through the interwar renaissance of epistemology, prompted by major advances in mathematics, logic, and physics, and its ultimate transformation from a theory of ideas and judgement into a theory of propositional attitudes, sentences, and (...) meanings. (shrink)

Classical logic, beginning with the work of Aristotle, has developed into a powerful and rigorous mathematical theory with many applications in mathematics and ...

The first edition, published by Acumen in 2000, became a prescribed textbook on modal logic courses. The second edition has been fully revised in response to readers' suggestions, including two new chapters on conditional logic, which was not covered in the first edition. "Modal Logics and Philosophy" is a fully comprehensive introduction to modal logics and their application suitable for course use. Unlike most modal logic textbooks, which are both forbidding mathematically and short on philosophical discussion, "Modal Logics and Philosophy" (...) places its emphasis firmly on showing how useful modal logic can be as a tool for formal philosophical analysis. In part 1 of the book, the reader is introduced to some standard systems of modal logic and encouraged through a series of exercises to become proficient in manipulating these logics. The emphasis is on possible world semantics for modal logics and the semantic emphasis is carried into the formal method, Jeffrey-style truth-trees. Standard truth-trees are extended in a simple and transparent way to take possible worlds into account. Part 2 systematically explores the applications of modal logic to philosophical issues such as truth, time, processes, knowledge and belief, obligation and permission. (shrink)

This long-awaited book replaces Hughes and Cresswell's two classic studies of modal logic: _An Introduction to Modal Logic_ and _A Companion to Modal Logic_. _A New Introduction to Modal Logic_ is an entirely new work, completely re-written by the authors. They have incorporated all the new developments that have taken place since 1968 in both modal propositional logic and modal predicate logic, without sacrificing tha clarity of exposition and approachability that were essential features of their earlier works. The book takes (...) readers from the most basic systems of modal propositional logic right up to systems of modal predicate with identity. It covers both technical developments such as completeness and incompleteness, and finite and infinite models, and their philosophical applications, especially in the area of modal predicate logic. (shrink)

Employing the methods of contemporary analytic philosophy, Fox has produced a careful, thought-provoking work on information and misinformation, providing essential clarifications for a foundation of information science. His methodology should not deter anyone from tackling the work, for one of its assets is that it supplies a manageable and coherent introduction to the methods and rationale of analytic philosophy. Since language is a rule-governed activity, an analysis of the use of information in ordinary language can give us some insight into (...) its nature.... Fox's work interrogates critical issues and arguments. It is highly recommended for graduate programs and academic libraries. Since the work conveys so much information, it is hoped that it may be a harbinger of additional philosophical research that will establish a solid foundation for a field whose claims to be a science may thereby be justified. (shrink)

Colburn (computer science, U. of Minnesota-Duluth) has a doctorate in philosophy and an advanced degree in computer science; he's worked as a philosophy professor, a computer programmer, and a research scientist in artificial intelligence. Here he discusses the philosophical foundations of artificial intelligence; the new encounter of science and philosophy (logic, models of the mind and of reasoning, epistemology); and the philosophy of computer science (touching on math, abstraction, software, and ontology).

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

The appropriateness of S5 as a logic of knowledge has been attacked at some length in the philosophical literature. Here one particular attack based on the interplay between knowledge and belief is considered: Suppose that knowledge satisfies S5, belief satisfies KD45, and both the entailment property (knowledge implies belief) and positive certainty (if the agent believes something, she believes she knows it) hold. Then it can be shown that belief reduces to knowledge: it is impossible to have false beliefs. While (...) the entailment property has typically been viewed as perhaps the least controversial of these assumptions, an argument is presented that it can plausibly be viewed as the culprit. More precisely, it is shown that this attack fails if we weaken the entailment property so that it applies only to objective (nonmodal) formulas, rather than to arbitrary formulas. Since the standard arguments in favor of the entailment property are typically given only for objective formulas, this observation suggests that care must be taken in applying intuitions that seem reasonable in the case of objective formulas to arbitrary formulas. (shrink)

We construct logical languages which allow one to represent a variety of possible types of changes affecting the information states of agents in a multi-agent setting. We formalize these changes by defining a notion of epistemic program. The languages are two-sorted sets that contain not only sentences but also actions or programs. This is as in dynamic logic, and indeed our languages are not significantly more complicated than dynamic logics. But the semantics is more complicated. In general, the semantics of (...) an epistemic program is what we call aprogram model. This is a Kripke model of ‘actions’,representing the agents' uncertainty about the current action in a similar way that Kripke models of ‘states’ are commonly used in epistemic logic to represent the agents' uncertainty about the current state of the system. Program models induce changes affecting agents' information, which we represent as changes of the state model, called epistemic updates. Formally, an update consists of two operations: the first is called the update map, and it takes every state model to another state model, called the updated model; the second gives, for each input state model, a transition relation between the states of that model and the states of the updated model. Each variety of epistemic actions, such as public announcements or completely private announcements to groups, gives what we call an action signature, and then each family of action signatures gives a logical language. The construction of these languages is the main topic of this paper. We also mention the systems that capture the valid sentences of our logics. But we defer to a separate paper the completeness proof. (shrink)