The book is about logical analysis of natural language. Since we humans communicate by means of natural language, we need a tool that helps us to understand in a precise manner how the logical and formal mechanisms of natural language work. Moreover, in the age of computers, we need to communicate both with and through computers as well. Transparent Intensional Logic is a tool that is helpful in making our communication and reasoning smooth and precise. It deals with all kinds (...) of linguistic context in a fully compositional and anti-contextual way. (shrink)

This volume is about abstract objects and the ways we refer to them in natural language. Asher develops a semantical and metaphysical analysis of these entities in two stages. The first reflects the rich ontology of abstract objects necessitated by the forms of language in which we think and speak. A second level of analysis maps the ontology of natural language metaphysics onto a sparser domain--a more systematic realm of abstract objects that are fully analyzed. This second level reflects the (...) commitments of real metaphysics. The models for these commitments assign truth conditions to natural language discourse. Annotation copyright by Book News, Inc., Portland, OR. (shrink)

A number of authors have taken a family of paradoxes, whose members trace back to theorems due either in whole or in part to Richard Montague, to pose a serious, possibly fatal challenge to theories of fine-grained, hyperintensional content. These paradoxes all assume that we can represent attitudes such as knowledge and belief with sentential predicates, and this assumption is at the heart of the purported challenge: the thought is that we must reject such predicates to avoid the paradoxes, and (...) that hyperintensionality precludes such a rejection. In this paper I examine in more detail both parts of this thought. I first argue that while there are relatively few satisfactory alternatives to rejecting sentential attitude predicates, we cannot conclusively rule them all out—there are, at least, bullets that proponents of hyperintensionality can bite. I then argue that while most forms of hyperintensional content do in fact guarantee the existence of sentential attitude predicates, one relatively underexplored sort of content, due to Max Cresswell, does not. I thus conclude that while these Montagovian paradoxes present a serious challenge to nearly every popular theory of hyperintensionality, they do not on their own require that we retreat all the way to a familiar, coarse-grained, possible-worlds account of propositions. (shrink)

What are the objects of knowledge, belief, probability, apriority or analyticity? For at least some of these properties, it seems plausible that the objects are sentences, or sentence-like entities. However, results from mathematical logic indicate that sentential properties are subject to severe formal limitations. After surveying these results, I argue that they are more problematic than often assumed, that they can be avoided by taking the objects of the relevant property to be coarse-grained (“sets of worlds”) propositions, and that all (...) this has little to do with the choice between operators and predicates. (shrink)

Self-referential sentences have troubled our understanding of language for centuries. The most famous self-referential sentence is probably the Liar, a sentence that says of itself that it is false. The Liar Paradox has encouraged many philosophers to establish theories of truth that manage to give a proper account of the truth predicate in a formal language. Kripke’s Fixed Point Theory from 1975 is one famous example of such a formal theory of truth that aims at giving a plausible notion of (...) truth by allowing truth value gaps. However, not only the concept of truth gives rise to paradoxes. A syntactical treatment of epistemic notions like belief and knowledge leads to contradictions that very much resemble the Liar Paradox. Therefore, it seems to be fruitful to apply the established theories of truth to epistemic concepts. In this paper, I will present one such attempt of solving the epistemic paradoxes: I adapt Kripke’s Fixed Point Theory and interpret truth, knowledge and belief within the framework of a partial logic. Thereby I find not only the fixed point of truth but also the fixed points of knowledge and belief. In this fixed point, the predicates of truth, belief and knowledge find their definite interpretation and the paradoxes are avoided. (shrink)

Justified belief is a core concept in epistemology and there has been an increasing interest in its logic over the last years. While many logical investigations consider justified belief as an operator, in this paper, we propose a logic for justified belief in which the relevant notion is treated as a predicate instead. Although this gives rise to the possibility of liar-like paradoxes, a predicate treatment allows for a rich and highly expressive framework, which lives up to the universal ambitions (...) of investigating epistemological concepts. We start with a base theory for justified belief, and then systematically present putative additional axioms for justified belief. We provide an overview of consistency results when the additional principles are added to the base theory, and discuss their philosophical plausibility. (shrink)

This article shows that there is a liar-like paradox that arises for rational credence that relies only on very weak logical and credal principles. The paradox depends on a weak rational reflection principle, logical principles governing conjunction, and principles governing the relationship between rational credence and proof. To respond to this paradox, we must either reject even very weak rational reflection principles or reject some highly plausible logical or credal principle.

Russell’s type theory has been the standard property theory for years, relying on rigid type distinctions at the grammatical level to circumvent the paradoxes of predication. In recent years it has been convincingly argued by Bealer, Cochiarella, Turner and others that many linguistic and ontological data are best accounted for by using a type-free property theory. In the spirit of exploring alternatives and “to have as many opportunities as possible for theory comparison”, this paper presents another type-free property theory, to (...) be called P*, intended for applications in Montague-style natural language semantics and formal ontology. The theory is philosophically grounded on Gupta’s and Belnap’s revision theory of definitions and its basic idea is viewing predication (exemplification) as a ‘circular concept’ that can be captured by circular definitions. The paper has the following fourteen sections: (1) Introduction; (2) Formal type-free property theory; (3) Applying RTD [revision theory of definitions] to exemplification; (4) The system P*; (5) Some features of P*; (6) A comparison with Turner’s system; (7) Entailment and P*; (8) P* and natural language semantics; (9) Noun phrases; (10) The need for type-freedom in semantics; (11) Arithmetic in P*; (12) Arithmetic in PN*; (13) Complexity of P*; (14) Conclusion, and acknowledgments. (shrink)

Konolige''s technical notion of belief based on deduction structures is briefly reviewed and its usefulness for the design of artificial agents with limited representational and deductive capacities is pointed out. The design of artificial agents with more sophisticated representational and deductive capacities is then taken into account. Extended representational capacities require in the first place a solution to the intensional context problems. As an alternative to Konolige''s modal first-order language, an approach based on type-free property theory is proposed. It considers (...) often neglected issues, such as the need for a more general account of thede dicto-de re distinction, and quasi-indicators. Extended deductive capacities require a subdivision of Konolige''s notion of belief into two distinct technical notions,potential anddispositional belief. The former has to do with what an artificial agent could in principle come to actively believe, given enough time and its specific logical competence; the latter with what an agent can be assumed to believe with respect to a specific goal to be fulfilled. (shrink)

Syntactical treatments of propositional attitudes are attractive to artificial intelligence researchers. But results of Montague (1974) and Thomason (1980) seem to show that syntactical treatments are not viable. They show that if representation languages are sufficiently expressive, then axiom schemes characterizing knowledge and belief give rise to paradox. Des Rivières and Levesque (1988) characterize a class of sentences within which these schemes can safely be instantiated. These sentences do not quantify over the propositional objects of knowledge and belief. We argue (...) that their solution is incomplete, and extend it by characterizing a more inclusive class of sentences over which the axiom schemes can safely range. Our sentences do quantify over propositional objects. (shrink)

The epistemic paradox of 'belief instability' has recently received notable attention from many philosophers. Understanding this paradox is very important because belief is a central notion of psychologically motivated semantic theories in philosophy, linguistics, and cognitive science, and this paradox poses serious problems for these theories. In this dissertation I criticize previous proposals and offer a new proposal, which I call a 'revision theory of belief'. ;My revision theory of belief is in many respects an application of Gupta's and Belnap's (...) revision theory of truth, which is proposed to deal with the Liar paradox. They argue that truth is a circular notion because Tarski biconditionals provide circular, partial definitions of truth. And this circularity of truth is the source of the Liar paradox. I offer a similar proposal for handling the paradox of belief instability. In particular, I argue that our notion of belief involved in the paradox of belief instability is circular, and that is why this paradox arises. ;If the notion of belief involved in the paradox is circular, we have to employ a hypothetical evaluation of the belief predicate, and if we do so through a revision process, we can avoid the contradiction which seems to be generated by some paradoxical belief sentences. But it is not easy to show that our notion of belief is circular. Especially, there is nothing like Tarski biconditionals in the case of belief. Nonetheless, I show in this dissertation that there is a certain schema, which I call the B-schema, whose instances can be taken as circular, partial definitions of a notion of belief, and it is that notion of belief which is involved in the paradox of belief instability. In this dissertation I also show that the revision approach can be extended for handling the Knower paradox. I argue that the Knower paradox arises because our notion of knowledge involved in the paradox is circular. (shrink)

Patrick Grim advances arguments meant to show that the doctrine of divine omniscience—the classical doctrine according to which God knows all truths—is false. In particular, we here have in mind to focus on two such arguments: the set theoretic argument and the semantic argument. These arguments due to Grim run parallel to, respectively, familiar paradoxes in set theory and naive truth theory. It is beyond the purview of this article to adjudicate whether or not these are successful arguments against the (...) classical doctrine of omniscience. What we are here interested in is a way in which these arguments can be generalized. In particular, we show how generalizations of those arguments can target, explicitly, alternatives to the classical doctrine of omniscience, including what we here call 'restricted omniscience' and 'open future open theism'. As a corollary, considerations of Grim-style arguments do not support these alternatives to the classical doctrine of omniscience over the classical doctrine. We conclude that what is paradoxical is not the classical doctrine of omniscience just as such; rather, what is paradoxical is a core commitment shared by the classical doctrine and its more modest alternatives, namely, the thesis that God is a perfectly logical reasoner. (shrink)

Although the notion of common or mutual belief plays a crucial role in game theory, economics and social philosophy, no thoroughly representational account of it has yet been developed. In this paper, I propose two desiderata for such an account, namely, that it take into account the possibility of inconsistent data without portraying the human mind as logically and mathematically omniscient. I then propose a definition of mutual belief which meets these criteria. This account takes seriously the existence of computational (...) limitations. Finally, I point out that the epistemic logic (or theory) needed to make the definition work is subject to the Kaplan/Montague Paradox of the Knower. I argue that this is not a defect of the account, and I discuss briefly the bearing of recent work on the paradox of the Liar upon this problem. (shrink)

The logical omniscience problem, whereby standard models of epistemic logic treat an agent as believing all consequences of its beliefs and knowing whatever follows from what else it knows, has received plenty of attention in the literature. But many attempted solutions focus on a fairly narrow specification of the problem: avoiding the closure of belief or knowledge, rather than showing how the proposed logic is of philosophical interest or of use in computer science or artificial intelligence. Sentential epistemic logics, as (...) opposed to traditional possible worlds approaches, do not suffer from the problems of logical omniscience but are often thought to lack interesting epistemic properties. In this paper, I focus on the case of rule-based agents, which play a key role in contemporary AI research but have been neglected in the logical literature. I develop a framework for modelling monotonic, nonmonotonic and introspective rule-based reasoners which have limited cognitive resources and prove that the resulting models have a number of interesting properties. An axiomatization of the resulting logic is given, together with completeness, decidability and complexity results. (shrink)

This article contains an overview of the main problems, themes and theories relating to the semantic paradoxes in the twentieth century. From this historical overview I tentatively draw some lessons about the way in which the field may evolve in the next decade.

The difficulties with formalizing the intensional notions necessity, knowability and omniscience, and rational belief are well-known. If these notions are formalized as predicates applying to (codes of) sentences, then from apparently weak and uncontroversial logical principles governing these notions, outright contradictions can be derived. Tense logic is one of the best understood and most extensively developed branches of intensional logic. In tense logic, the temporal notions future and past are formalized as sentential operators rather than as predicates. The question therefore (...) arises whether the notions that are investigated in tense logic can be consistently formalized as predicates. In this paper it is shown that the answer to this question is negative. The logical treatment of the notions of future and past as predicates gives rise to paradoxes due the specific interplay between both notions. For this reason, the tense paradoxes that will be presented are not identical to the paradoxes referred to above. (shrink)

This paper propounds a systematic examination of the link between the Knower Paradox and provability interpretations of modal logic. The aim of the paper is threefold: to give a streamlined presentation of the Knower Paradox and related results; to clarify the notion of a syntactical treatment of modalities; finally, to discuss the kind of solution that modal provability logic provides to the Paradox. I discuss the respective strength of different versions of the Knower Paradox, both in the framework of first-order (...) arithmetic and in that of modal logic with fixed point operators. It is shown that the notion of a syntactical treatment of modalities is ambiguous between a self-referential treatment and a metalinguistic treatment of modalities, and that these two notions are independent. I survey and compare the provability interpretations of modality respectively given by Skyrms, B. (1978, The Journal of Philosophy 75: 368–387) Anderson, C.A. (1983, The Journal of Philosophy 80: 338–355) and Solovay, R. (1976, Israel Journal of Mathematics 25: 287–304). I examine how these interpretations enable us to bypass the limitations imposed by the Knower Paradox while preserving the laws of classical logic, each time by appeal to a distinct form of hierarchy. (shrink)

Thomason (1979/2010)'s argument against competence psychologism in semantics envisages a representation of a subject's competence as follows: he understands his own language in the sense that he can identify the semantic content of each of its sentences, which requires that the relation between expression and content be recursive. Then if the scientist constructs a theory that is meant to represent the body of the subject's beliefs, construed as assent to the content of the pertinent sentences, and that theory satisfies certain (...) 'natural assumptions', then it implies that the subject is inconsistent if the beliefs include arithmetic. I challenge the result by insisting that the motivation for Thomason's principle (ii), via Moore's Paradox, leads to a more complex representation, in which stating the facts and expressing one's beliefs are treated differently. Certain logical connections among expressions of assent, and between expression and statement, are a matter of consequence on pain of pragmatic incoherence, not consequence on pain of classical logical inconsistency. But while this salvages the possibility that a modification of the above sort of representation could be adequate, Thomason's devastating conclusion returns if the scientist identifies himself as the subject of that representation, even when paying heed to the requirement of pragmatic coherence of the sort highlighted by Moore's Paradox. (shrink)

Thomason (1979/2010)’s argument against competence psychologism in semantics envisages a representation of a subject’s competence as follows: he understands his own language in the sense that he can identify the semantic content of each of its sentences, which requires that the relation between expression and content be recursive. Then if the scientist constructs a theory that is meant to represent the body of the subject’s beliefs, construed as assent to the content of the pertinent sentences, and that theory satisfies certain (...) ‘natural assumptions’, then it implies that the subject is inconsistent if the beliefs include arithmetic. I challenge the result by insisting that the motivation for Thomason’s principle (ii), via Moore’s Paradox, leads to a more complex representation, in which stating the facts and expressing one’s beliefs are treated differently. Certain logical connections among expressions of assent, and between expression and statement, are a matter of consequence on pain of pragmatic incoherence, not consequence on pain of classical logical inconsistency. But while this salvages the possibility that a modification of the above sort of representation could be adequate, Thomason’s devastating conclusion returns if the scientist identifies himself as the subject of that representation, even when paying heed to the requirement of pragmatic coherence of the sort highlighted by Moore’s Paradox. (shrink)

[IMPORTANT CORRECTION - See end of abstract.] In Syntactical Treatments of Modality, with Corollaries on Reflexion Principles and Finite Axiomatizability, Acta Philosophica Fennica 16 (1963), 153–167, Richard Montague shows that the use of a single syntactic predicate (with a context-independent semantic value) to represent modalities of alethic necessity and idealized knowledge leads to inconsistency. In A Note on Syntactical Treatments of Modality, Synthese 44 (1980), 391–395, Richmond Thomason obtains a similar impossibility result for idealized belief: under a syntactical treatment of (...) belief, the assumption that idealized belief is deductively closed, together with certain other plausible conditions on idealized belief, imply that an ideal believer with consistent beliefs cannot believe the truth of Robinson's Arithmetic. In this essay I assert an impossibility result similar to Thomason's but which does not assume that belief is deductively closed or ideal in any other way. There are technical mistakes in the formulations of Lemmas 1-4 and Theorem 2, however. Corrections can be found in the Erratum section of the author's website. (shrink)

This is a paper for a special issue of Semiotic Studies devoted to Stanislaw Krajewski’s paper. This paper gives some supplementary notes to Krajewski’s on the Anti-Mechanist Arguments based on Gödel’s incompleteness theorem. In Section 3, we give some additional explanations to Section 4–6 in Krajewski’s and classify some misunderstandings of Gödel’s incompleteness theorem related to AntiMechanist Arguments. In Section 4 and 5, we give a more detailed discussion of Gödel’s Disjunctive Thesis, Gödel’s Undemonstrability of Consistency Thesis and the definability (...) of natural numbers as in Section 7–8 in Krajewski’s, describing how recent advances bear on these issues. (shrink)

W.V. Quine is committed to the claim that all beliefs are rationally revisable; Jerrold Katz has argued that this commitment is unstable on grounds of self-application. The subsequent discussion of this issue has largely proceeded in terms of the logic of belief revision, but there is also an issue here for the treatment of Quine’s views in a doxastic modal system. In this paper I explore the treatment of Quinean epistemology in modal terms. I argue that a set of formal (...) revisability desiderata can be distilled from Quine’s epistemic writings, and that there are demonstrably coherent and non-trivial systems that meet these conditions. (shrink)

Georg Kreisel suggested various ways out of the Gödel incompleteness theorems. His remarks on ways out were somewhat parenthetical, and suggestive. He did not develop them in subsequent papers. One aim of this paper is not to develop those remarks, but to show how the basic idea that they express can be used to reason about the Lucas-Penrose-Putnam arguments that human minds are not finitary computational machines. Another aim is to show how one of Putnam’s two anti-functionalist arguments avoids the (...) logical error in the Lucas-Penrose arguments, extends those arguments, but succumbs to an absurdity. A third aim is to provide a categorization of the Lucas-Penrose-Putnam anti-functionalist arguments. (shrink)

A paradox of self-reference in beliefs in games is identified, which yields a game-theoretic impossibility theorem akin to Russell’s Paradox. An informal version of the paradox is that the following configuration of beliefs is impossible:Ann believes that Bob assumes that.

I hope I have convinced the reader that DR theory offers at least some exciting potential when applied to the semantics of belief reports. It differs considerably from other approaches, and it makes intuitively acceptable predictions that other theories do not. The theory also provides a novel approach to the semantics of other propsitional attitude reports. Further, DR theory enables one to approach the topic of anaphora within belief and other propositional attitude contexts in a novel way, thus combining the (...) semantics developed here with one of the theory's original motivations (Kamp, 1981a). However, these are unfortunately topics that I must reserve for another time. (shrink)