Wittgenstein's work remains, undeniably, now, that off one of those few philosophers who will be read by all future generations.

"The influence of J. L. Austin on contemporary philosophy, which ranks with that of Wittgenstein, was substantial during his lifetime and has grown greatly since his death in 1960, at the height of his powers. His published papers are here gathered together with three pieces that had not been published when this collection first appeared in 1961. This new edition contains two additional papers edited, with the assistance of the original editors, by L. W. Forguson and J. M. E. Moravcsik, (...) that were published till later..." - Back cover. (shrink)

This book, written by one of philosophy's pre-eminent logicians, argues that many of the basic assumptions common to logic, philosophy of mathematics and metaphysics are in need of change. It is therefore a book of critical importance to logical theory. Jaakko Hintikka proposes a new basic first-order logic and uses it to explore the foundations of mathematics. This new logic enables logicians to express on the first-order level such concepts as equicardinality, infinity, and truth in the same language. The famous (...) impossibility results by Gödel and Tarski that have dominated the field for the last sixty years turn out to be much less significant than has been thought. All of ordinary mathematics can in principle be done on this first-order level, thus dispensing with the existence of sets and other higher-order entities. (shrink)

This paper is an examination of some modelling problems regarding imperfect recall within the model of extensive games. It is argued that, if the assumption of perfect recall is violated, care must be taken in interpreting the main elements of the model. Interpretations that are inconsequential under perfect recall have important implications in the analysis of games with imperfect recall.

Many of the discussions about conditionals can best be put as follows:can those conditionals that involve an entailment relation be formulatedwithin a formal system? The reasons for the failure of the classical approachto entailment have usually been that they ignore the meaning connectionbetween antecedent and consequent in a valid entailment. One of the firsttheories in the history of logic about meaning connection resulted from thestoic discussions on tightening the relation between the If- and the Then-parts of conditionals, which in this (...) context was called συναρτησις(connection). This theory gave a justification for the validity of what we todayexpress through the formulae ¬(a → ¬ a) and ¬(¬ a → a). Hugh MacColl and, more recently, Storrs McCall (from 1877 to 1906 and from1963 to 1975 respectively) searched for a formal system in which the validity ofthese formulae could be expressed. Unfortunately neither of the resulting systems is very satisfactory. In this paper we introduce dialogical games with the help of a new connexive If-Then (“→”), the structural rules of which allow the Proponent to develop (formal) winning strategies not only for the above-mentioned connexive theses but also for (a → b) → ¬(a → ¬ b) and (a → b) → ¬(¬ a → b). Further on, we developthe corresponding tableau systems and conclude with some remarks on possibleperspectives and consequences of the dialogical approach to connexivity including the loss of uniform substitution leading to a new concept of logical form. (shrink)

Central topics in medieval logic are here treated in a way that is congenial to the modern reader, without compromising historical reliability. The achievements of medieval logic are made available to a wider philosophical public then the medievalists themselves. The three genres of logica moderna arising in a later Middle Ages are covered: obligations, insolubles and consequences - the first time these have been treated in such a unified way. The articles on obligations look at the role of logical consistence (...) in medieval disputation techniques. Those on insolubles concentrate on medieval solutions to the Liar Paradox. There is also a systematic account of how medieval authors described the logical content of an inference, and how they thought that the validity of an inference could be guaranteed. (shrink)

We discuss the differences between first-order set theory and second-order logic as a foundation for mathematics. We analyse these languages in terms of two levels of formalization. The analysis shows that if second-order logic is understood in its full semantics capable of characterizing categorically central mathematical concepts, it relies entirely on informal reasoning. On the other hand, if it is given a weak semantics, it loses its power in expressing concepts categorically. First-order set theory and second-order logic are not radically (...) different: the latter is a major fragment of the former. (shrink)

What is it for marks or sounds to have meaning, and what is it for someone to mean something in producing them? Answering these and related questions, Schiffer explores communication, speech acts, convention, and the meaning of linguistic items in this reissue of a seminal work on the foundations of meaning. A new introduction takes account of recent developments and places his theory in a broader context.

We study partiality in propositional logics containing formulas with either undefined or over-defined truth-values. Undefined values are created by adding a four-place connective W termed transjunction to complete models which, together with the usual Boolean connectives is shown to be functionally complete for all partial functions. Transjunction is seen to be motivated from a game-theoretic perspective, emerging from a two-stage extensive form semantic game of imperfect information between two players. This game-theoretic approach yields an interpretation where partiality is generated as (...) a property of non-determinacy of games. Over-defined values are produced by adding a weak, contradictory negation or, alternatively, by relaxing the assumption that games are strictly competitive. In general, particular forms of extensive imperfect information games give rise to a generalised propositional logic where various forms of informational dependencies and independencies of connectives can be studied. (shrink)

We shall introduce in this paper a language whose formulas will be interpreted by games of imperfect information. Such games will be defined in the same way as the games for first-order formulas except that the players do not have complete information of the earlier course of the game. Some simple logical properties of these games will be stated together with the relation of such games of imperfect information to higher-order logic. Finally, a set of applications will be outlined.

We introduce several senses of the principle ofcompositionality. We illustrate the difference between them with thehelp of some recent results obtained by Cameron and Hodges oncompositional semantics for languages of imperfect information.

We present a game semantics for Linear Logic, in which formulas denote games and proofs denote winning strategies. We show that our semantics yields a categorical model of Linear Logic and prove full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net. A key role is played by the notion of history-free strategy; strong connections are made between history-free strategies and the Geometry of Interaction. Our semantics incorporates a (...) natural notion of polarity, leading to a refined treatment of the additives. We make comparisons with related work by Joyal, Blass, et al. (shrink)

1 INTRODUCTION Above the other titles he might justly have claimed, Charles S. Peirce prized the title 'logician'. He expressed in several places his ...

Many of the discussions about conditionals can best be put as follows:can those conditionals that involve an entailment relation be formulatedwithin a formal system? The reasons for the failure of the classical approachto entailment have usually been that they ignore the meaning connectionbetween antecedent and consequent in a valid entailment. One of the firsttheories in the history of logic about meaning connection resulted from thestoic discussions on tightening the relation between the If- and the Then-parts of conditionals, which in this (...) context was called. This theory gave a justification for the validity of what we todayexpress through the formulae ¬ and ¬. Hugh MacColl and, more recently, Storrs McCall searched for a formal system in which the validity ofthese formulae could be expressed. Unfortunately neither of the resulting systems is very satisfactory. In this paper we introduce dialogical games with the help of a new connexive If-Then (), the structural rules of which allow the Proponent to develop winning strategies not only for the above-mentioned connexive theses but also for ¬ and ¬. Further on, we developthe corresponding tableau systems and conclude with some remarks on possibleperspectives and consequences of the dialogical approach to connexivity including the loss of uniform substitution leading to a new concept of logical form. (shrink)

This paper addresses the theoretical notion of a game as it arisesacross scientific inquiries, exploring its uses as a technical andformal asset in logic and science versus an explanatory mechanism. Whilegames comprise a widely used method in a broad intellectual realm(including, but not limited to, philosophy, logic, mathematics,cognitive science, artificial intelligence, computation, linguistics,physics, economics), each discipline advocates its own methodology and aunified understanding is lacking. In the first part of this paper, anumber of game theories in formal studies are critically (...) surveyed. Inthe second part, the doctrine of games as explanations for logic isassessed, and the relevance of a conceptual analysis of games tocognition discussed. It is suggested that the notion of evolution playsa part in the game-theoretic concept of meaning. (shrink)

I argue that many of the pragmatic notions that are commonly attributed to 1-1. P. Grice, or are reported to be inspired by his work on pragmatics, such as assertion, conventional implicature, cooperation, common ground, common knowledge, presuppositions and conversational strategies, have their origins in C. S. Peirce's theory of signs and his pragmatic logic and philosophy. Both Grice and Peirce rooted their theories in normative rationality, anti-psychologism and the relevance of assertions. With respect to the post-Gricean era of pragmatics, (...) theories of relevance may be seen to have been geared, albeit unconsciously, upon Peirce's pragmatic agenda. (shrink)

Natural dialogue does not proceed haphazardly; it has an easily recognized “episodic” structure and coherence which conform to a well developed set of conventions. This paper represents these conventions formally in terms related to speech act theory and to a theory of action.The major formal unit, the dialogue game, specifies aspects of the communication of both participants in a dialogue. We define the formal notion of dialogue games, and describe some of the important games of English. Dialogue games are conventions (...) of interactive goal pursuit. Using them, each participant pursues his own goals in a way which sometimes serves the goals of the other. The idea of dialogue games can thus be seen as a part of a broader theoretical perspective which characterizes virtually all communication as goal pursuit activity.We also define and exemplify the property of Motivational Coherence of dialogues. Motivational Coherence can be used as an interpretive principle in explaining language comprehension.Actual dialogue games have a kind of causal connectedness which is not a consequence of their formal properties. This is explained in terms of a theory of action, which is also seen to explain a similar attribute of speech acts. (shrink)

In the New Essays on Human Understanding, Leibniz argues chapter by chapter with John Locke's Essay Concerning Human Understanding, challenging his views about knowledge, personal identity, God, morality, mind and matter, nature versus nurture, logic and language, and a host of other topics. The work is a series of sharp, deep discussions by one great philosopher of the work of another. Leibniz's references to his contemporaries and his discussions of the ideas and institutions of the age make this a fascinating (...) and valuable document in the history of ideas. The work was originally written in French, and the version by Peter Remnant and Jonathan Bennett, based on the only reliable French edition (published in 1962), first appeared in 1981 and has become the standard English translation. It has been thoroughly revised for this series and provided with a new and longer introduction, a chronology on Leibniz's life and career and a guide to further reading. (shrink)

The second, corrected edition of the first and only complete English translation of Kant’s highly influential introduction to philosophy, presenting both the terminological and structural basis for his philosophical system, and offering an invaluable key to his main works, particularly the three Critiques. Extensive editiorial apparatus.

Preface This book is about semantics and logic. More specifically, it is about the semantics and logic of natural language; and, even more specifically than ...

Christopher Hookway presents a series of studies of themes from the work of the great American philosopher and pragmatist, Charles S. Peirce (1839-1913). These themes center on the question of how we are to investigate the world rationally. Hookway shows how Peirce's ideas about this continue to play an important role in contemporary philosophy.

Wilfrid Hodges; VIII*—Truth in a Structure, Proceedings of the Aristotelian Society, Volume 86, Issue 1, 1 June 1986, Pages 135–152, https://doi.org/10.1093/ari.

From this starting point, and assuming no previous knowledge of logic, Wilfrid Hodges takes the reader through the whole gamut of logical expressions in a ...

We describe a logic which is the same as first-order logic except that it allows control over the information that passes down from formulas to subformulas. For example the logic is adequate to express branching quantifiers. We describe a compositional semantics for this logic; in particular this gives a compositional meaning to formulas of the 'information-friendly' language of Hintikka and Sandu. For first-order formulas the semantics reduces to Tarski's semantics for first-order logic. We prove that two formulas have the same (...) interpretation in all structures if and only if replacing an occurrence of one by an occurrence of the other in a sentence never alters the truth-value of the sentence in any structure. (shrink)

§1. Introduction. I dedicate this essay to the two-dozen-odd people whose refutations of Cantor's diagonal argument have come to me either as referee or as editor in the last twenty years or so. Sadly these submissions were all quite unpublishable; I sent them back with what I hope were helpful comments. A few years ago it occurred to me to wonder why so many people devote so much energy to refuting this harmless little argument—what had it done to make them (...) angry with it? So I started to keep notes of these papers, in the hope that some pattern would emerge.These pages report the results. They might be useful for editors faced with similar problem papers, or even for the authors of the papers themselves. But the main message to reach me is that there are several points of basic elementary logic that we usually teach and explain very badly, or not at all.In 1995 an engineer named William Dilworth, who had published a refutation of Cantor's argument in the Transactions of the Wisconsin Academy of Sciences, Arts and Letters, sued for libel a mathematician named Underwood Dudley who had called him a crank. (shrink)

This book, written by one of philosophy's pre-eminent logicians, argues that many of the basic assumptions common to logic, philosophy of mathematics and metaphysics are in need of change. It is therefore a book of critical importance to logical theory. Jaakko Hintikka proposes a new basic first-order logic and uses it to explore the foundations of mathematics. This new logic enables logicians to express on the first-order level such concepts as equicardinality, infinity, and truth in the same language. The famous (...) impossibility results by Gödel and Tarski that have dominated the field for the last sixty years turn out to be much less significant than has been thought. All of ordinary mathematics can in principle be done on this first-order level, thus dispensing with the existence of sets and other higher-order entities. (shrink)

SummaryTruth‐definitions play a crucial role in the foundations of logic and semantics. Tarsik‐type truth‐definitions are not possible to formulate in a usual first‐order language for itself, and they have been criticized because they do not account for what makes them definitions of truth. It has been suggested that truth should instead be characterized by reference to the «language‐games» of verification and falsification. The author's game‐theoretical semantics here explained for formal first‐order languages, can be thought of as a realization of this (...) idea. More technically speaking, GTS can also be thought of as a systematization of the well‐known aepsilon‐delta, definitions in the foundations of analysis. In GTS, truth is not defined by reference to winning a play of a game, but as the existence of a winning strategy in the game for the verifier. In a first‐order language, the game‐theoretical truth‐condition of a sentence S can accordingly be expressed by an explicit second‐order sentence asserting the existence of the Skolem function of S.The semantical games of GTS must be distinguished not only from the «games» of formal proof but also from the «games» in volved in our ordinary activities of verification and falsification. The latter have been modelled as games of inquiry by the author, and they are essentially epistemic games where the meaning of truth is taken for granted and where the aim of the game is to come to know certain truths. To assimilate them to the semantical games constitutive of truth is a form of Meno's paradox. (shrink)

The notion of scope as it relates to a model of logical form is discussed. The inability of the accepted definition of scope to account for the contrast between priority scope - the logical priority of different quantifiers & other logical notions via rule ordering - & binding scope - the identification of the connection between variables of quantification & a particular quantifier - is demonstrated. The semantic ambiguity of this dichotomy of scope is explored via examination of donkey sentences. (...) A formal representation of this dichotomy is suggested. The government-binding approach & principle of compositionality that handle scope relations via the logical form is rejected due to the complexity of the mechanism by which syntactic form results in logical forms. A discourse representational approach is also rejected. It is concluded that the interaction of syntax & semantics is instead better represented by a game-theoretical treatment of scope & anaphora. 26 References. T. Rosenberg. (shrink)