One of the most striking differences between Frege's Begriffsschrift (logical system) and standard contemporary systems of logic is the inclusion in the former of the judgement stroke: a symbol which marks those propositions which are being asserted , that is, which are being used to express judgements . There has been considerable controversy regarding both the exact purpose of the judgement stroke, and whether a system of logic should include such a symbol. This paper explains the intended role of the (...) judgement stroke in a way that renders it readily comprehensible why Frege insisted that this symbol was an essential part of his logical system. The key point here is that Frege viewed logic as the study of inference relations amongst acts of judgement , rather than – as in the typical contemporary view – of consequence relations amongst certain objects (propositions or well-formed formulae). The paper also explains why Frege's use of the judgement stroke is not in conflict with his avowed anti-psychologism, and why Wittgenstein's criticism of the judgement stroke as 'logically quite meaningless' is unfounded. The key point here is that while the judgement stroke has no content , its use in logic and mathematics is subject to a very stringent norm of assertion. (shrink)

The recently offered, Purported counter-Examples to justified, True belief analyses of knowledge are looked at with some care and all found to be either incoherent or inconclusive. It is argued that justified, True belief analyses are based on sound insight into the concept of knowledge. The distinction between having been justified in claiming to know something and actually having known it is used in an effort to get the discussion of knowledge back on the right track.

Since Edmund L. Gettier reminded us recently of a certain important inadequacy of the traditional analysis of "S knows that p," several attempts have been made to correct that analysis. In this paper I shall offer still another analysis (or a sketch of an analysis) of "S knows that p," one which will avert Gettier's problem. My concern will be with knowledge of empirical propositions only, since I think that the traditional analysis is adequate for knowledge of nonempirical truths.

We formulate a Hilbert-style axiomatic system and a tableau calculus for the STIT-based logic of imagination recently proposed in Wansing. Completeness of the axiom system is shown by the method of canonical models; completeness of the tableau system is also shown by using standard methods.

Dynamic Epistemic Logic This article tells the story of the rise of dynamic epistemic logic, which began with epistemic logic, the logic of knowledge, in the 1960s. Then, in the late 1980s, came dynamic epistemic logic, the logic of change of knowledge. Much of it was motivated by puzzles and paradoxes. The number … Continue reading Dynamic Epistemic Logic →.

Imagination has recently attracted considerable attention from epistemologists and is recognized as a source of belief and even knowledge. One remarkable feature of imagination is that it is often and typically agentive: agents decide to imagine. In cases in which imagination results in a belief, the agentiveness of imagination may be taken to give rise to indirect doxastic control and epistemic responsibility. This observation calls for a proper understanding of agentive imagination. In particular, it calls for the development of a (...) semantics of imagination ascriptions. In the present paper an earlier suggestion by Ilkka Niiniluoto for a logic of imagination is considered. This proposal does not capture the agentive nature of imagination, and an alternative semantics is suggested. The new semantics combines the modal logic of agency with the neighbourhood semantics from alethic modal logic. (shrink)

A structure is described that can serve as a foundation for a semantics for a modal agentive construction such as sees to it that Q ([ stit: Q]). The primitives are Tree,,Instant, Agent, choice. Eleven simple postulates governing this structure are set forth and motivated. Tree and encode a picture of branching time consisting of moments gathered into maximal chains called histories. Instant imposes a time-like ordering. Agent consists of agents, and choice assigns to each agent and each moment in (...) Tree a set of possible choices, where each possible choice is a set of histories. All of these ingredients are referred to in the semantics suggested for [ stit: Q]. The most complex part of the discussion is the motivation for the definition of what it means for a typically non-terminating chain of moments jointly to witness the truth of [ stit: Q] at a moment.The paper begins with an informal account of the Refref conjecture, which says that the only way to refrain from refraining from seeing to something is to see to it. The paper ends with a consideration of an argument of Prior's that in a certain sense contemplation and action are inconsistent. (shrink)

Based on a notion of "companions to stit formulas" applied in other papers dealing with astit logics, we introduce "choice formulas" and "nested choice formulas" to prove the completeness theorems for dstit logics in a language with the dstit operator as the only non-truth-functional operator. The main logic discussed in this paper is the basic logic of dstit with multiple agents, other logics discussed include the basic logic of dstit with a single agent and some logics of dstit with multiple (...) agents each of which corresponds to a semantic condition concerning the number of possible choices for agents. (shrink)

Justification stit logic is a logic for reasoning about proving as a certain kind of activity, namely seeing to it that a proof is publicly available. It merges the semantical analysis of deliberatively seeing-to-it-that from stit theory and the semantics of the epistemic logic with justification from. In this paper, after recalling its language and basic semantical definitions, various ramifications and refinements of justification stit logic are presented and discussed: imposing natural restrictions upon the class of models under consideration, making (...) use of modalities that assert the existence of a proof, introducing a variant of justification stit logic based on a semantics introduced by M. Fitting, and adding variable-binding operators and extending the set of proof polynomials. (shrink)

In 1969, John McCarthy and Pat Hayes uncovered a problem that has haunted the field of artificial intelligence ever since--the frame problem. The problem arises when logic is used to describe the effects of actions and events. Put simply, it is the problem of representing what remains unchanged as a result of an action or event. Many researchers in artificial intelligence believe that its solution is vital to the realization of the field's goals. Solving the Frame Problem presents the various (...) approaches to the frame problem that have been proposed over the years. The author presents the material chronologically--as an unfolding story rather than as a body of theory to be learned by rote. There are lessons to be learned even from the dead ends researchers have pursued, for they deepen our understanding of the issues surrounding the frame problem. In the book's concluding chapters, the author offers his own work on event calculus, which he claims comes very close to a complete solution to the frame problem. Artificial Intelligence series. (shrink)

Since it is desirable to be able to talk about rational agents forming attitudes toward their concrete agency, we suggest an introduction of doxastic, volitional, and intentional modalities into the multi-agent logic of deliberatively seeing to it that, dstit logic. These modalities are borrowed from the well-known BDI (belief-desire-intention) logic. We change the semantics of the belief and desire operators from a relational one to a monotonic neighbourhood semantic in order to handle ascriptions of conflicting but not inconsistent beliefs and (...) desires as being satisfiable. The proposed bdi-stit logic is defined with respect to branching time frames, and it is shown that this logic is a generalization of a bdi logic based on branching time possible worlds frames (but without temporal operators) and dstit logic. The new bdi-stit logic generalizes bdi and dstit logic in the sense that for any model of bdi or dstit logic, there is an equivalent bdi-stit model. (shrink)

Inference versus consequence , an invited lecture at the LOGICA 1997 conference at Castle Liblice, was part of a series of articles for which I did research during a Stockholm sabbatical in the autumn of 1995. The article seems to have been fairly effective in getting its point across and addresses a topic highly germane to the Uppsala workshop. Owing to its appearance in the LOGICA Yearbook 1997 , Filosofia Publishers, Prague, 1998, it has been rather inaccessible. Accordingly it is (...) republished here with only bibliographical changes and an afterword. (shrink)