We consider an example of a sentence which according to Hintikka's claim essentially requires for its logical form a Henkin quantifier. We show that if Hintikka is right then recognizing the truth value of the sentence in finite models is an NP-complete problem. We discuss also possible conclusions from this observation.

We present a geometric construction that yields completeness results for modal logics including K4, KD4, GL and GL n with respect to certain subspaces of the rational numbers. These completeness results are extended to the bimodal case with the universal modality.

Tyumeneva, Y. A., Larina, G., Alexandrova, E., DeWolf, M., Bassok, M., & Holyoak, K. J.. Semantic alignment across whole-number arithmetic and rational numbers: evidence from a Russian persp...

One of Hume's most well-known works and a masterpiece of philosophy, A Treatise of Human Nature is indubitably worth taking the time to read.

In many logics dealing with information one needs to make statements not only about cognitive states, but also about transitions between them. In this paper we analyze a dynamic modal logic that has been designed with this purpose in mind. On top of an abstract information ordering on states it has instructions to move forward or backward along this ordering, to states where a certain assertion holds or fails, while it also allows combinations of such instructions by means of operations (...) from relation algebra. In addition, the logic has devices for expressing whether in a given state a certain instruction can be carried out, and whether that state can be arrived at by carrying out a certain instruction.This paper deals mainly with technical aspects of our dynamic modal logic. It gives an exact description of the expressive power of this language; it also contains results on decidability for the language with arbitrary structures and for the special case with a restricted class of admissible structures. In addition, a complete axiomatization is given. The paper concludes with a remark about the modal algebras appropriate for our dynamic modal logic, and some questions for further work. (shrink)

Through the use of such "folk" concepts as belief, desire, intention, and expectation, Daniel Dennett asserts in this first full scale presentation of...

Ethologists and others studying animal behavior in a spirit are in need of a descriptive language and method that are neither anachronistically bound by behaviorist scruples nor prematurely committed to particular Just such an interim descriptive method can be found in intentional system theory. The use of intentional system theory is illustrated with the case of the apparently communicative behavior of vervet monkeys. A way of using the theory to generate data - including usable, testable data - is sketched. The (...) underlying assumptions of this approach can be seen to ally it directly with theorizing in evolutionary biology, which has recently come under attack from Stephen Gould and Richard Lewontin, who castigate it as the Their arguments, which are strongly analogous to B. F, Skinner's arguments against point to certain pitfalls that attend the careless exercise of such thinking (and rival varieties of thinking as well), but do not constitute a fundamental objection to either adaptationist theorizing or its cousin, intentional system theory. (shrink)

The aim of this paper is to initiate a systematic exploration of the model theory of epistemic plausibility models (EPMs). There are two subtly different definitions in the literature: one by van Benthem and one by Baltag and Smets. Because van Benthem's notion is the most general, most of the paper is dedicated to this notion. We focus on the notion of bisimulation, and show that the most natural generalization of bisimulation to van Benthem-type EPMs fails. We then introduce parametrized (...) bisimulations, and prove various bisimulationimplies- equivalence theorems, a Hennessy-Milner theorem, and several (un)definability results. We discuss the problems arising from the fact that these bisimulations are syntax-dependent (and thus not fully structural), and we present and compare two different ways of coping with this issue: adding a modality to the language, and putting extra constraints on the models. We argue that the most successful solution involves restricting to uniform and locally connected (van Benthem-type) EPMs: for this subclass the intuitively most natural notion of bisimulation and the technically sound notion coincide. Such EPMs turn out to correspond exactly with Baltag/Smets-type EPMs, which can be interpreted as constituting a methodological argument, favoring Baltag and Smets's definition of EPM over that of van Benthem. (shrink)

This paper studies the Lockean thesis from the perspective of contemporary epistemic logic. The Lockean thesis states that belief can be defined as ‘sufficiently high degree of belief’. Its main problem is that it gives rise to a notion of belief which is not closed under conjunction. This problem is typical for classical epistemic logic: it is single-agent and static. I argue that from the perspective of contemporary epistemic logic, the Lockean thesis fares much better. I briefly mention that it (...) can successfully be extended from single-agent to multi-agent settings. More importantly, I show that accepting the Lockean thesis (and a more sophisticated version for conditional beliefs) leads to a significant and unexpected unification in the dynamic behavior of (conditional) belief and high (conditional) probability with respect to public announcements. This constitutes a methodological argument in favor of the Lockean thesis. Furthermore, if one accepts Baltag’s Erlangen program for epistemology, this technical observation has even stronger philosophical implications: because belief and high probability display the same dynamic behavior, it is plausible that they are indeed one and the same epistemic notion. (shrink)

This paper studies Aumann’s agreeing to disagree theorem from the perspective of dynamic epistemic logic. This was first done by Dégremont and Roy (J Phil Log 41:735–764, 2012) in the qualitative framework of plausibility models. The current paper uses a probabilistic framework, and thus stays closer to Aumann’s original formulation. The paper first introduces enriched probabilistic Kripke frames and models, and various ways of updating them. This framework is then used to prove several agreement theorems, which are natural formalizations of (...) Aumann’s original result. Furthermore, a sound and complete axiomatization of a dynamic agreement logic is provided, in which one of these agreement theorems can be derived syntactically. These technical results are used to show the importance of explicitly representing the dynamics behind the agreement theorem, and lead to a clarification of some conceptual issues surrounding the agreement theorem, in particular concerning the role of common knowledge. The formalization of the agreement theorem thus constitutes a concrete example of the so-called dynamic turn in logic. (shrink)

We develop a logical system that captures two different interpretations of what extensive games model, and we apply this to a long-standing debate in game theory between those who defend the claim that common knowledge of rationality leads to backward induction or subgame perfect (Nash) equilibria and those who reject this claim. We show that a defense of the claim à la Aumann (1995) rests on a conception of extensive game playing as a one-shot event in combination with a principle (...) of rationality that is incompatible with it, while a rejection of the claim à la Reny (1988) assumes a temporally extended, many-moment interpretation of extensive games in combination with implausible belief revision policies. In addition, the logical system provides an original inductive and implicit axiomatization of rationality in extensive games based on relations of dominance rather than the usual direct axiomatization of rationality as maximization of expected utility. (shrink)

We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthem’s theorem, which says that a first-order formula is invariant under bisimulation if, and only if, it is equivalent to a formula of basic modal logic. The present investigation primarily concerns ramifications for specific classes of structures. We study in particular model classes defined through conditions on the underlying frames, with a focus on frame classes (...) that play a major role in modal correspondence theory and often correspond to typical application domains of modal logics. Classical model theoretic arguments do not apply to many of the most interesting classes–for instance, rooted frames, finite rooted frames, finite transitive frames, well-founded transitive frames, finite equivalence frames–as these are not elementary. Instead we develop and extend the game-based analysis over such classes and provide bisimulation preserving model constructions within these classes. Over most of the classes considered, we obtain finite model theory analogues of the classically expected characterisations, with new proofs also for the classical setting. The class of transitive frames is a notable exception, with a marked difference between the classical and the finite model theory of bisimulation invariant first-order properties. Over the class of all finite transitive frames in particular, we find that monadic second-order logic is no more expressive than first-order as far as bisimulation invariant properties are concerned — though both are more expressive here than basic modal logic. We obtain ramifications of the de Jongh–Sambin theorem and a new and specific analogue of the Janin–Walukiewicz characterisation of bisimulation invariant monadic second-order for finite transitive frames. (shrink)

We solve a major open problem concerning algorithmic properties of products of ‘transitive’ modal logics by showing that products and commutators of such standard logics as K4, S4, S4.1, K4.3, GL, or Grz are undecidable and do not have the finite model property. More generally, we prove that no Kripke complete extension of the commutator [K4,K4] with product frames of arbitrary finite or infinite depth (with respect to both accessibility relations) can be decidable. In particular, if.

We show in this paper that the AGM postulates are too weak to ensure the rational preservation of conditional beliefs during belief revision, thus permitting improper responses to sequences of observations. We remedy this weakness by proposing four additional postulates, which are sound relative to a qualitative version of probabilistic conditioning. Contrary to the AGM framework, the proposed postulates characterize belief revision as a process which may depend on elements of an epistemic state that are not necessarily captured by a (...) belief set. We also show that a simple modification to the AGM framework can allow belief revision to be a function of epistemic states. We establish a model-based representation theorem which characterizes the proposed postulates and constrains, in turn, the way in which entrenchment orderings may be transformed under iterated belief revision. (shrink)

We present a bimodal logic suitable for formalizing reasoning about points and sets, and also states of the world and views about them. The most natural interpretation of the logic is in subset spaces , and we obtain complete axiomatizations for the sentences which hold in these interpretations. In addition, we axiomatize the validities of the smaller class of topological spaces in a system we call topologic . We also prove decidability for these two systems. Our results on topologic relate (...) early work of McKinsey on topological interpretations of S4 with recent work of Georgatos on topologic. Some of the results of this paper were presented at the 1992 conference on Theoretical Aspects of Reasoning about Knowledge. (shrink)

What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr Cutland (...) begins with a mathematical characterisation of computable functions using a simple idealised computer (a register machine); after some comparison with other characterisations, he develops the mathematical theory, including a full discussion of non-computability and undecidability, and the theory of recursive and recursively enumerable sets. The later chapters provide an introduction to more advanced topics such as Gildel's incompleteness theorem, degrees of unsolvability, the Recursion theorems and the theory of complexity of computation. Computability is thus a branch of mathematics which is of relevance also to computer scientists and philosophers. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest. (shrink)

Variabilism is the view that proper names (like pronouns) are semantically represented as variables. Referential names, like referential pronouns, are assigned their referents by a contextual variable assignment (Kaplan 1989). The reference parameter (like the world of evaluation) may also be shifted by operators in the representation language. Indeed verbs that create hyperintensional contexts, like ‘think’, are treated as operators that simultaneously shift the world and assignment parameters. By contrast, metaphysical modal operators shift the world of assessment only. Names, being (...) variables, refer rigidly in the latter merely intensional contexts, but may vary their reference in hyperintensional contexts. This conforms to the intuition that the content of attitude ascriptions encapsulates referential uncertainty. Furthermore, names in hyperintensional contexts are ambiguous between de re* and de dicto* interpretations. This fact is used to account for asymmetric mistaken identity attributions (for example, Biron thinks Katherine is Rosaline, but he doesn’t think Rosaline is Katherine). -/- The variable theory compares favourably with its alternatives, including Millianism and descriptivism. Millians cannot account for the behaviour of names in hyperintensional contexts, while descriptivists cannot generate a necessary contrast between intensional and hyperintensional contexts. No other theory can capture the facts pertaining to the existentially bound use of names. (shrink)

Beliefs are concrete particulars containing ideas of properties and notions of things, which also are concrete. The claim made in a belief report is that the agent has a belief (i) whose content is a specific singular proposition, and (ii) which involves certain of the agent's notions and ideas in a certain way. No words in the report stand for the notions and ideas, so they are unarticulated constituents of the report's content (like the relevant place in "it's raining"). The (...) belief puzzles (Hesperus, Cicero, Pierre) involve reports about two different notions. So the analysis gets the puzzling truth values right. (shrink)

Talk about Beliefs presents a new account of beliefs and of practices of reporting them that yields solutions to foundational problems in the philosophies of...

Probability, Frequency and Reasonable Expectation.

Strategic games require reasoning about other people’s and one’s own beliefs or intentions. Although they have clear commonalities with psychological tests of theory of mind, they are not clearly related to theory of mind tests for children between 9 and 10 years of age “Flobbe et al. J Logic Language Inform 17(4):417–442 (2008)”. We studied children’s (5–12 years of age) individual differences in how they played a strategic game by analyzing the strategies that they applied in a zero, first, and (...) second-order reasoning task. For the zero-order task, we found two subgroups with different accuracy levels. For the first-order task, subgroups of children applied different suboptimal strategies or an optimal strategy. For the second-order task only suboptimal strategies were present. Strategy use for all tasks was related to age. The 5- and 6-year old children were additionally tested on theory of mind understanding and executive functioning. Strategy-use in these children was related to working memory, but not to theory of mind after correction for age, verbal ability and general IQ. (shrink)

This article traces the development of possible worlds semantics through the work of: Wittgenstein, 1913-1921; Feys, 1924; McKinsey, 1945; Carnap, 1945-1947; McKinsey, Tarski and Jónsson, 1947-1952; von Wright, 1951; Becker, 1952; Prior, 1953-1954; Montague, 1955; Meredith and Prior, 1956; Geach, 1960; Smiley, 1955-1957; Kanger, 1957; Hintikka, 1957; Guillaume, 1958; Binkley, 1958; Bayart, 1958-1959; Drake, 1959-1961; Kripke, 1958-1965.

This paper explores principles governing the rational balance among an agent's beliefs, goals, actions, and intentions. Such principles provide specifications for artificial agents, and approximate a theory of human action (as philosophers use the term). By making explicit the conditions under which an agent can drop his goals, i.e., by specifying how the agent is committed to his goals, the formalism captures a number of important properties of intention. Specifically, the formalism provides analyses for Bratman's three characteristic functional roles played (...) by intentions [7, 9], and shows how agents can avoid intending all the foreseen side-effects of what they actually intend. Finally, the analysis shows how intentions can be adopted relative to a background of relevant beliefs and other intentions or goals. By relativizing one agent's intentions in terms of beliefs about another agent's intentions (or beliefs'), we derive a preliminary account of interpersonal commitments. (shrink)

As Ruben notes, the macrostrategy can allow that the distinction may also be drawn at some micro level, but it insists that descent to the micro level is ...

In this paper we present BTC, which is a complete logic for branchingtime whose modal operator quantifies over histories and whose temporal operators involve a restricted quantification over histories in a given possible choice. This is a technical novelty, since the operators of the usual logics for branching-time such as CTL express an unrestricted quantification over histories and moments. The value of the apparatus we introduce is connected to those logics of agency that are interpreted on branching-time, as for instance (...) Stit Logics. (shrink)

Noam Chomsky's book on syntactic structures is a serious attempts on the part of a linguist to construct within the tradition of scientific theory-construction ...

The book from which these sections are excerpted is concerned with the prospects for assimilating the study of human intelligence and its products to the natural sciences through the investigation of cognitive structures, understood as systems of rules and representations that can be regarded as “mental organs.” These mental structui′es serve as the vehicles for the exercise of various capacities. They develop in the mind on the basis of an innate endowment that permits the growth of rich and highly articulated (...) structures along an intrinsically determined course under the triggering and partially shaping effect of experience, which fixes parameters in an intricate system of predetermined form. It is argued that the mind is modular in character, with a diversity of cognitive structures, each with its specific properties arid principles. Knowledge of language, of the behavior of objects, and much else crucially involves these mental structures, and is thus not characterizable in terms of capacities, dispositions, or practical abilities, nor is it necessarily grounded in experience in the standard sense of this term.Various types of knowledge and modes of knowledge acquisition are discussed in these terms. Some of the properties of the language faculty are investigated. The basic cognitive relation is “knowing a grammar”; knowledge of language is derivative and, correspondingly, raises further problems. Language as commonly understood is not a unitary phenomenon but involves a number of interacting systems: the “computational” system of grammar, which provides the representations of sound and meaning that permit a rich range of expressive potential, is distinct from a conceptual system with its own properties; knowledge of language must be distinguished from knowledge of how to use a language; and the various systems that enter into the knowledge and use of language must be further analyzed into their specific subcomponents. (shrink)

Chomsky proposes a reformulation of the theory of transformational generative grammar that takes recent developments in the descriptive analysis of particular ...

Recent theories of agency (sees to it that) of Nuel Belnap and Michael Perloff are examined, particularly in the context of an early proposal of the author.

In this article we strive to provide a detailed and principled analysis of the role of beliefs in goal processing—that is, the cognitive transition that leads from a mere desire to a proper intention. The resulting model of belief-based goal processing has also relevant consequences for the analysis of intentions, and constitutes the necessary core of a constructive theory of intentions, i.e. a framework that not only analyzes what an intention is, but also explains how it becomes what it is. (...) We discuss similarities and differences between our approach and other standard accounts of intention, in particular Bratman’s planning theory. The aim here is to question and refine the conceptual foundations of many theories of intentional action: as a consequence, although our analysis is not formal in itself, it is ultimately meant to have deep consequences for formal models of intentional agency. (shrink)

The Dappled World: A Study of the Boundaries of Science. nancy cartwright. Plato's Reception of Parmenides. john a. palmer.

This paper contains a formal treatment of the system of quantified epistemic logic sketched in Appendix II of Carlson (1983). Section 1 defines the syntax and recapitulates the model set rules and principles of the Appendix system. Section 2 defines a possible worlds semantics for this system, and shows that the Appendix system is complete with respect to this semantics. Section 3 extends the system by an explicit truth operatorT it is true that and considers quantification over nonexistent individuals. Section (...) 4 formalizes the idea of variable identity criteria typical of Hintikkian epistemic logic. (shrink)

Among the various meanings in which the word ‘probability’ is used in everyday language, in the discussion of scientists, and in the theories of probability, there are especially two which must be clearly distinguished. We shall use for them the terms ‘probability1’ and ‘probability2'. Probability1 is a logical concept, a certain logical relation between two sentences ; it is the same as the concept of degree of confirmation. I shall write briefly “c” for “degree of confirmation,” and “c” for “the (...) degree of confirmation of the hypothesis h on the evidence e“; the evidence is usually a report on the results of our observations. On the other hand, probability2 is an empirical concept; it is the relative frequency in the long run of one property with respect to another. The controversy between the so-called logical conception of probability, as represented e.g. by Keynes, and Jeffreys, and others, and the frequency conception, maintained e.g. by v. Mises and Reichenbach, seems to me futile. These two theories deal with two different probability concepts which are both of great importance for science. Therefore, the theories are not incompatible, but rather supplement each other. (shrink)

This is identical with the first edition (see 21: 2716) except for the addition of a Supplement containing 5 previously published articles and the bringing of the bibliography (now 73 items) up to date. The 5 added articles present clarifications or modifications of views expressed in the first edition. (PsycINFO Database Record (c) 2009 APA, all rights reserved).

In the current paper, we re-examine how abstract argumentation can be formulated in terms of labellings, and how the resulting theory can be applied in the field of modal logic. In particular, we are able to express the (complete) extensions of an argumentation framework as models of a set of modal logic formulas that represents the argumentation framework. Using this approach, it becomes possible to define the grounded extension in terms of modal logic entailment.