Presenting the first comprehensive, in-depth study of hyperintensionality, this book equips readers with the basic tools needed to appreciate some of current and future debates in the philosophy of language, semantics, and metaphysics. After introducing and explaining the major approaches to hyperintensionality found in the literature, the book tackles its systematic connections to normativity and offers some contributions to the current debates. The book offers undergraduate and graduate students an essential introduction to the topic, while also helping professionals in related (...) fields get up to speed on open research-level problems. (shrink)

Sortal concepts are at the center of certain logical discussions and have played a significant role in solutions to particular problems in philosophy. Apart from logic and philosophy, the study of sortal concepts has found its place in specific fields of psychology, such as the theory of infant cognitive development and the theory of human perception. In this monograph, different formal logics for sortal concepts and sortal-related logical notions are characterized. Most of these logics are intensional in nature and possess, (...) in addition, a bidimensional character. That is, they simultaneously represent two different logical dimensions. In most cases, the dimensions are those of time and natural necessity, and, in other cases, those of time and epistemic necessity. Another feature of the logics in question concerns second-order quantification over sortal concepts, a logical notion that is also represented in the logics. Some of the logics adopt a constant domain interpretation, others a varying domain interpretation of such quantification. Two of the above bidimensional logics are philosophically grounded on predication sortalism, that is, on the philosophical view that predication necessarily requires sortal concepts. Another bidimensional logic constitutes a logic for complex sortal predicates. These three sorts of logics are among the important novelties of this work since logics with similar features have not been developed up to now, and they might be instrumental for the solution of philosophically significant problems regarding sortal predicates. The book assumes a modern variant of conceptualism as a philosophical background. For this reason, the approach to sortal predicates is in terms of sortal concepts. Concepts, in general, are here understood as intersubjective realizable cognitive capacities. The proper features of sortal concepts are determined by an analysis of the main features of sortal predicates. Posterior to this analysis, the sortal-related logical notions represented in the above logics are discussed. There is also a discussion on the extent to which the set-theoretic formal semantic systems of the book capture different aspects of the conceptualist approach to sortals. These different semantic frameworks are also related to realist and nominalist approaches to sortal predicates, and possible modifications to them are considered that might represent those alternative approaches. (shrink)

I discuss two competing theories of the progressive: the theory proposed in Parsons (1980, 1985, 1989, 1990) and the theory proposed in Landman (1992). These theories differ in more than one way. Landman regards the progressive as an intentional operator, while Parsons doesn't. Moreover, Landman and Parsons disagree on what uninflected predicates denote. For Landman, cross the street has in its denotation complete events of crossing the street; the aspectual contribution of English simple past (perfective aspect) is the identity function. (...) For Parsons, both complete and incomplete events of crossing the street can be in the denotation of the base VP; perfective aspect restricts its denotation to the events that culminate. I present a version of ParsonÕs theory that avoids the problems raised by Landman, in particular the problem posed for Parsons by creation verbs. The repaired version and Landman's theory still differ in the way they analyze uninflected verbs. The repaired version and Landman's theory still differ in the way they analyze uninflected predicates. I present evidence from Slavic languages that both theories are needed. Finally, I discuss some evidence that may favor one or the other approach to the semantics of the English progressive. (shrink)

This paper is based on Tarski’s theory of truth. The purpose of this paper is to solve the liar paradox (and its cousins) and keep both of the deductive power of classical logic and the expressive power of the word “true” in natural language. The key of this paper lies in the distinction between the predicate usage and the operator usage of the word “true”. The truth operator is primarily used for characterizing the semantics of the language. Then, we do (...) not need the hierarchy of languages. The truth predicate is mainly used for grammatical function. Tarski’s schema of the truth predicate is not necessary in this proposal. The schema of the word "true" is the schema of the truth operator. The liar paradox (and its cousins) can be solved in this way. In the appendix, I show a consistent model for both of the truth predicate and the truth operator. (shrink)

The paper concentrates on the problem of adequate reflection of fragments of reality via expressions of language and inter-subjective knowledge about these fragments, called here, in brief, language adequacy. This problem is formulated in several aspects, the most being: the compatibility of language syntax with its bi-level semantics: intensional and extensional. In this paper, various aspects of language adequacy find their logical explication on the ground of the formal-logical theory T of any categorial language L generated by the so-called classical (...) categorial grammar, and also on the ground of its extension to the bi-level, intensional and extensional semantic-pragmatic theory ST for L. In T, according to the token-type distinction of Ch.S. Peirce, L is characterized first as a language of well-formed expression-tokens (wfe-tokens) - material, concrete objects - and then as a language of wfe-types - abstract objects, classes of wfe-tokens. In ST the semantic-pragmatic notions of meaning and interpretation for wfe-types of L of intensional semantics and the notion of denotation of extensional semanics for wfe-types and constituents of knowledge are formalized. These notions allow formulating a postulate (an axiom of categorial adequacy) from which follow all the most important conditions of the language adequacy, including the above, and a structural one connected with three principles of compositionality. (shrink)

This paper continues a strain of intellectual complaint against the presumptions of certain kinds of formal semantics (the qualification is important) and their bad effects on those areas of artificial intelligence concerned with machine understanding of human language. After some discussion of the use of the term epistemology in artificial intelligence, the paper takes as a case study the various positions held by McDermott on these issues and concludes, reluctantly, that, although he has reversed himself on the issue, there was (...) no time at which he was right. (shrink)

Michael Dummett famously maintained that analytic philosophy was simply philosophy that followed Frege in treating the philosophy of language as the basis for all other philosophy (1978, 441). But one important insight to emerge from computer science is how difficult it is to animate the linguistic artifacts that the analysis of thought produces. Yet, modeling the effects of thought requires a new skill that goes beyond analysis: procedural literacy. Some of the most promising research in philosophy makes use of a (...) variety of modeling techniques that go beyond basic logic and elementary probability theory. What unifies this approach is a focus on what Alan Perlis called procedural literacy. This essay argues that the future spoils in philosophical research will disproportionally go to those who are procedurally literate. (shrink)

In his recent article “Verbs, Time and Modality,” M. J. Steedman (1977) proposes a recursive scheme for identifying the aspectual character of a proposition. The purpose of this squib is to point out some faults and gaps in that account that may suggest some interesting directions for future research.

The psychological orientation treats semantics as a matter of idealized computation over symbolic structures, and semantic relations like denotation as relations between linguistic expressions and these structures. I argue that results similar to Gödel's incompleteness theorems and Tarski's theorem on truth create foundational difficulties for this view of semantics.

In this paper we show that the membership problem for second order non-linear Abstract Categorial Grammars is decidable. A consequence of that result is that Montague-like semantics yield to a decidable text generation problem. Furthermore the proof we propose is based on a new tool, Higher Order Intersection Signatures, which grasps statically dynamic properties of λ-terms and presents an interest in its own.

The sentences employed in semantic paradoxes display a wide range of semantic behaviours. However, the main theories of truth currently available either fail to provide a theory of paradox altogether, or can only account for some paradoxical phenomena by resorting to multiple interpretations of the language. In this paper, I explore the wide range of semantic behaviours displayed by paradoxical sentences, and I develop a unified theory of truth and paradox, that is a theory of truth that also provides a (...) unified account of paradoxical sentences. The theory I propose here yields a threefold classification of paradoxical sentences – liar-like sentences, truth-teller-like sentences, and revenge sentences. Unlike existing treatments of semantic paradox, the theory put forward in this paper yields a way of interpreting all three kinds of paradoxical sentences, as well as unparadoxical sentences, within a single model. (shrink)

In this paper we defend structural representations, more specifically neural structural representation. We are not alone in this, many are currently engaged in this endeavor. The direction we take, however, diverges from the main road, a road paved by the mathematical theory of measure that, in the 1970s, established homomorphism as the way to map empirical domains of things in the world to the codomain of numbers. By adopting the mind as codomain, this mapping became a boon for all those (...) convinced that a representation system should bear similarities with what was being represented, but struggled to find a precise account of what such similarities mean. The euforia was brief, however, and soon homomorphism revealed itself to be affected by serious weaknesses, the primary one being that it included systems embarrassingly alien to representations. We find that the defense attempts that have followed, adopt strategies that share a common format: valid structural representations come as “homomorphism plus X”, with various “X”, provided in descriptive format only. Our alternative direction stems from the observation of the overlooked departure from homomorphism as used in the theory of measure and its later use in mental representations. In the former case, the codomain or the realm of numbers, is the most suited for developing theorems detailing the existence and uniqueness of homomorphism for a wide range of empirical domains. In the latter case, the codomain is the realm of the mind, possibly more vague and more ill-defined than the empirical domain itself. The time is ripe for articulating the mapping between represented domains and the mind in formal terms, by exploiting what is currently known about coding mechanisms in the brain. We provide a sketch of a possible development in this direction, one that adopts the theory of neural population coding as codomain. We will show that our framework is not only not in disagreement with the “plus X” proposals, but can lead to natural derivation of several of the “X”. (shrink)

In this essay I will consider two theses that are associated with Frege,and will investigate the extent to which Frege really believed them.Much of what I have to say will come as no surprise to scholars of thehistorical Frege. But Frege is not only a historical figure; he alsooccupies a site on the philosophical landscape that has allowed hisdoctrines to seep into the subconscious water table. And scholars in a widevariety of different scholarly establishments then sip from thesedoctrines. I believe (...) that some Frege-interested philosophers at various ofthese establishments might find my conclusions surprising.Some of these philosophical establishments have arisen from an educationalmilieu in which Frege is associated with some specific doctrine at theexpense of not even being aware of other milieux where other specificdoctrines are given sole prominence. The two theses which I will discussillustrate this point. Each of them is called Frege''s Principle, but byphilosophers from different milieux. By calling them milieux I do not want to convey the idea that they are each located at some specificsocio-politico-geographico-temporal location. Rather, it is a matter oftheir each being located at different places on the intellectuallandscape. For this reason one might (and I sometimes will) call them(interpretative) traditions. (shrink)

In a recent article [4], Fred I. Dretske has proposed a new analysis of natural laws. Dretske rejects the more or less standard view which says that laws are universal truths with a special function or status in science. As an alternative account, he suggests that laws are expressed by singular statements describing the relationship between universal properties and magnitudes: the statement It is a law that F's are G's3.is to be analysed as F-ness ↦ G-ness.I shall argue, however, that (...) Dretske's reasons for rejecting the standard account are not conclusive. Moreover, his own proposal seems to be either inadequate or reducible to that version of the standard account which takes laws to be nomically necessary generalizations. (shrink)

This is the introductory essay to a collection commemorating the 100th anniversary of the publication in Mind of Bertrand Russell’s paper ‘On Denoting’.

We present Logical Description Grammar (LDG), a model ofgrammar and the syntax-semantics interface based on descriptions inelementary logic. A description may simultaneously describe the syntacticstructure and the semantics of a natural language expression, i.e., thedescribing logic talks about the trees and about the truth-conditionsof the language described. Logical Description Grammars offer a naturalway of dealing with underspecification in natural language syntax andsemantics. If a logical description (up to isomorphism) has exactly onetree plus truth-conditions as a model, it completely specifies thatgrammatical (...) object. More common is the situation, corresponding tounderspecification, in which there is more than one model. A situation inwhich there are no models corresponds to an ungrammatical input. (shrink)

This paper argues for the idea that in describing language we should follow Haskell Curry in distinguishing between the structure of an expression and its appearance or manifestation . It is explained how making this distinction obviates the need for directed types in type-theoretic grammars and a simple grammatical formalism is sketched in which representations at all levels are lambda terms. The lambda term representing the abstract structure of an expression is homomorphically translated to a lambda term representing its manifestation, (...) but also to a lambda term representing its semantics. (shrink)

This paper is a reflexion on the computability of natural language semantics. It does not contain a new model or new results in the formal semantics of natural language: it is rather a computational analysis, in the context for type-logical grammars, of the logical models and algorithms currently used in natural language semantics, defined as a function from a grammatical sentence to a set of logical formulas—because a statement can be ambiguous, it can correspond to multiple formulas, one for each (...) reading. We argue that as long as we do not explicitly compute the interpretation in terms of possible world models, one can compute the semantic representation of a given statement, including aspects of lexical meaning. This is a very generic process, so the results are, at least in principle, widely applicable. We also discuss the algorithmic complexity of this process. (shrink)

The transformers that drive chatbots and other AI systems constitute large language models (LLMs). These are currently the focus of a lively discussion in both the scientific literature and the popular media. This discussion ranges from hyperbolic claims that attribute general intelligence and sentience to LLMs, to the skeptical view that these devices are no more than “stochastic parrots”. I present an overview of some of the weak arguments that have been presented against LLMs, and I consider several of the (...) more compelling criticisms of these devices. The former significantly underestimate the capacity of transformers to achieve subtle inductive inferences required for high levels of performance on complex, cognitively significant tasks. In some instances, these arguments misconstrue the nature of deep learning. The latter criticisms identify significant limitations in the way in which transformers learn and represent patterns in data. They also point out important differences between the procedures through which deep neural networks and humans acquire knowledge of natural language. It is necessary to look carefully at both sets of arguments in order to achieve a balanced assessment of the potential and the limitations of LLMs. (shrink)

The unwinding that Cook, 767–774 2004) proposed is a simple but powerful method of generating new paradoxes from known ones. This paper extends Cook’s unwinding to a larger class of paradoxes and studies further the basic properties of the unwinding. The unwinding we study is a procedure, by which when inputting a Boolean modal net together with a definable digraph, we get a set of sentences in which we have a ‘counterpart’ for each sentence of the Boolean modal net and (...) each point of the digraph. What is more, whenever a sentence of the Boolean modal net says another sentence is necessary, then the counterpart of the first sentence at a point correspondingly says the counterparts of the second one at all accessible points of that point are all true. The output of the procedure is called ‘the unwinding of a Boolean modal net on a definable digraph’. We prove that the unwinding procedure preserves paradoxicality: a Boolean modal net is paradoxical on a definable digraph, iff the unwinding of it on this digraph is also paradoxical. Besides, the dependence digraph for the unwinding of a Boolean modal net on a definable digraph is proved to be isomorphic to the unwinding of the dependence digraph for the Boolean modal net on the previous definable digraph. So the unwinding of a Boolean modal net on a digraph is self-referential, iff the Boolean modal net is self-referential and the digraph is cyclic. Thus, on the one hand, the unwinding of any Boolean modal net on an acyclic digraph is non-self-referential. In particular, the unwinding of any Boolean modal net on \ is non-self-referential. On the other hand, if a Boolean modal net is paradoxical on a locally finite digraph, the unwinding of it on that digraph must be self-referential. Hence, starting from a Boolean modal paradox, the unwinding can output a non-self-referential paradox only if the digraph is not locally finite. (shrink)

If □ is conceived as an operator, i.e., an expression that gives applied to a formula another formula, the expressive power of the language is severely restricted when compared to a language where □ is conceived as a predicate, i.e., an expression that yields a formula if it is applied to a term. This consideration favours the predicate approach. The predicate view, however, is threatened mainly by two problems: Some obvious predicate systems are inconsistent, and possible-worlds semantics for predicates of (...) sentences has not been developed very far. By introducing possible-worlds semantics for the language of arithmetic plus the unary predicate □, we tackle both problems. Given a frame (W, R) consisting of a set W of worlds and a binary relation R on W, we investigate whether we can interpret □ at every world in such a way that □ $\ulcorner A \ulcorner$ holds at a world ᵆ ∊ W if and only if A holds at every world $\upsilon$ ∊ W such that ᵆR $\upsilon$ . The arithmetical vocabulary is interpreted by the standard model at every world. Several 'paradoxes' (like Montague's Theorem, Gödel's Second Incompleteness Theorem, McGee's Theorem on the ω-inconsistency of certain truth theories, etc.) show that many frames, e.g., reflexive frames, do not allow for such an interpretation. We present sufficient and necessary conditions for the existence of a suitable interpretation of □ at any world. Sound and complete semi-formal systems, corresponding to the modal systems K and K4, for the class of all possible-worlds models for predicates and all transitive possible-worlds models are presented. We apply our account also to nonstandard models of arithmetic and other languages than the language of arithmetic. (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)

The Idea behind Tarski's Definition of Truth. In Tarski's presentations of his truth-definition, the steps of the construction are not sufficiently explained. It is not clear, on what general strategy the construction is based, what the fundamental ideas are, how some crucial steps work, and especially how the transition from the definition of satisfaction to the definition of truth should be understood. The paper shows that the account given in the model-theoretic literature, which is supported by Tarski's lemmata A and (...) B, is unsatisfactory, because Tarski's notion of truth can't be interpreted as ‘truth independent of the assignment of values to the variables’. Moreover, a satisfactory account of all the crucial steps is given. (shrink)

This paper is a demonstration of an application of Semiotic Textology to a limited case study. The main aspects of Semiotic Textology, the theory elaborated by Petöfi, are presented; secondly the linguistic aspects of the interpretation of lines 133–134 of the Theognis of Megara’s poem, analysed in the framework of said theory, are presented. All the relevant syntactic, semantic, pragmatic information involved in text processing have been considered. Through fixed steps, it is shown that text processing is not exclusively a (...) grammatical activity, because within a theoretical interpretation an Interpreter needs a number of contextual hypotheses, in order to understand the author’s ontology. (shrink)

Quotation has been much studied in philosophy. Given that quotation allows one to diagonalize out of any grammar, there have been comparatively few attempts within the linguistic literature to develop an account within a formal linguistic theory. Nonetheless, given the ubiquity of quotation in natural language, linguists need to explicate the formal mechanisms it employs. The central claim of this paper is that once one assumes a dialogical perspective on language such as provided by the KoS (KoS is not an (...) acronym, despite emphasizing a Konversationally Oriented Semantics) framework, formalized in a rich type theory like Type Theory with Records, much of the mystery evaporates. In particular, one can utilize as denotations for quotative constructions entities that are independently motivated for dialogue processing—utterance types and locutionary propositions, Austinian propositions about speech events. (shrink)

According to the structured theory of propositions, if two sentences express the same proposition, then they have the same syntactic structure, with corresponding syntactic constituents expressing the same entities. A number of philosophers have recently focused attention on a powerful argument against this theory, based on a result by Bertrand Russell, which shows that the theory of structured propositions is inconsistent in higher order-logic. This paper explores a response to this argument, which involves restricting the scope of the claim that (...) propositions are structured, so that it does not hold for all propositions whatsoever, but only for those which are expressible using closed sentences of a given formal language. We call this restricted principle Closed Structure, and show that it is consistent in classical higher-order logic. As a schematic principle, the strength of Closed Structure is dependent on the chosen language. For its consistency to be philosophically significant, it also needs to be consistent in every extension of the language which the theorist of structured propositions is apt to accept. But, we go on to show, Closed Structure is in fact inconsistent in a very natural extension of the standard language of higher-order logic, which adds resources for plural talk of propositions. We conclude that this particular strategy of restricting the scope of the claim that propositions are structured is not a compelling response to the argument based on Russell’s result, though we note that for some applications, for instance to propositional attitudes, a restricted thesis in the vicinity may hold some promise. (shrink)

Mathematicians and physical scientists depend heavily on the formal symbolism of mathematics in order to express and develop their theories. For this and other reasons the last hundred years has seen a growing interest in the nature of formal language and the way it expresses meaning; particularly the objective, shared aspect of meaning as opposed to subjective, personal aspects. This dichotomy suggests the question: do the objective philosophical theories of meaning offer concepts which can be applied in psychological theories of (...) meaning? In recent years cognitive scientists such as Chomsky [1980], Fodor [1981] and MacNamara [1982] have used philosophical approaches to the meaning of formal language expressions as the basis for their psychological theories. Following this lead it seems appropriate to review some of the main treatments of meaning with a view to their transferability. (shrink)

Prior’s puzzle is standardly taken to be the puzzle of why, given the assumption that that-clauses denote propositions, substitution of “the proposition that P” for “that P” within the complements of many propositional attitude verbs is invalid. I show that Prior’s puzzle is much more general than is ordinarily supposed. There are two variants on the substitutional form of the puzzle—a quantificational variant and a pronominal variant—and all three forms of the puzzle arise in a wide range of grammatical positions, (...) rather than merely in the complements of propositional attitude verbs. The generalized puzzle shows that a range of proposed solutions to the original puzzle fail, or are radically incomplete, and also reveals the connections between Prior’s puzzle and debates over the nature of semantic types and higher-order quantification. I go on to develop a novel, higher-order solution to the generalized form of the puzzle, and I argue that this higher-approach is superior to its first-order alternatives. (shrink)

One of the claims of Type Theory with Records is that it can be used to model types learned by agents in order to classify objects and events in the world, including speech events. That is, the types can be represented by patterns of neural activation in the brain. This claim would be empty if it turns out that the types are in principle impossible to represent on a finite network of neurons. We will discuss how to represent types in (...) terms of neural events on a network and present a preliminary computational implementation that maps types to events on a network. The kind of networks we will use are closely related to the transparent neural networks discussed by Strannegård. (shrink)

Conceptual realism begins with a conceptualist theory of the nexus of predication in our speech and mental acts, a theory that explains the unity of those acts in terms of their referential and predicable aspects. This theory also contains as an integral part an intensional realism based on predicate nominalization and a reflexive abstraction in which the intensional contents of our concepts are “object”-ified, and by which an analysis of predication with intensional verbs can be given. Through a second nominalization (...) of the common names that are part of conceptual realism’s theory of reference (via quantifier phrases), the theory also accounts for both plural reference and predication and mass noun reference and predication. Finally, a separate nexus of predication based on natural kinds and the natural properties and relations nomologically related to those natural kinds, is also an integral part of the framework of conceptual realism. (shrink)

It is argued that the English bare plural (an NP with plural head that lacks a determiner), in spite of its apparently diverse possibilities of interpretation, is optimally represented in the grammar as a unified phenomenon. The chief distinction to be dealt with is that between the generic use of the bare plural (as in Dogs bark) and its existential or indefinite plural use (as in He threw oranges at Alice). The difference between these uses is not to be accounted (...) for by an ambiguity in the NP itself, but rather by explicating how the context of the sentence acts on the bare plural to give rise to this distinction. A brief analysis is sketched in which bare plurals are treated in all instances as proper names of kinds of things. A subsidiary argument is that the null determiner is not to be regarded as the plural of the indefinite article a. (shrink)

When dealing with ‘meaning’ or related notions, one cannot ignore what for a long time was the dominant paradigm in semantics. According to such paradigm, truth-conditional formal semantics for natural language is a theory of semantic competence. In this article, I shall discuss a foundational problem for such semantic program. I shall first be following authors who claim that truth-conditional formal semantics is unable to provide a complete account of lexical competence, and, therefore, it suffers from incompleteness. Moreover, as a (...) few authors observed, a coherent completion of lexical meaning/competence cannot be easily provided in the philosophical framework of truth-conditional semantics. The problem is a consequence of Kripke’s and Putnam’s arguments against the view that semantic values of words are cognitively determined. I shall argue that these arguments undermine the notion that formal semantics can be, at the same time, a theory of truth-conditions and a theory of semantic competence. I shall outline and critically discuss two general attempts to solve this problem, which I shall refer to as the social/ideal route and the concepts route. The conclusions of the article are deliberately open. I shall argue that both these attempts are exposed to conceptual troubles and counterintuitive consequences, and so the lexical problem still remains a deep and unresolved issue for semantics. (shrink)

Khemlani et al. (2018) mischaracterize logic in the course of seeking to show that mental model theory (MMT) can accommodate a form of inference (, let us label it) they find in a high percentage of their subjects. We reveal their mischaracterization and, in so doing, lay a landscape for future modeling by cognitive scientists who may wonder whether human reasoning is consistent with, or perhaps even capturable by, reasoning in a logic or family thereof. Along the way, we note (...) that the properties touted by Khemlani et al. as innovative aspects of MMT‐based modeling (e.g., nonmonotonicity) have for decades been, in logic, acknowledged and rigorously specified by families of (implemented) logics. Khemlani et al. (2018) further declare that is “invalid in any modal logic.” We demonstrate this to be false by our introduction (Appendix A) of a new propositional modal logic (within a family of such logics) in which is provably valid, and by the implementation of this logic. A second appendix, B, partially answers the two‐part question, “What is a formal logic, and what is it for one to capture empirical phenomena?”. (shrink)

This paper defends the view that perceptual ascriptions such as “Jones sees a cat” are sometimes intensional. I offer a range of examples of intensional perceptual ascriptions, respond to objections to intensional readings of perceptual ascriptions, and show how widely accepted semantic accounts of intensionality can explain the key features of intensional perceptual ascriptions.

In this paper we argue that Prior and Reichenbach are best viewed as allies, not antagonists. We do so by combining the central insights of Prior and Reichenbach in the framework of hybrid tense logic. This overcomes a well-known defect of Reichenbach’s tense schema, namely that it gives multiple representations to sentences in the future perfect and the future-in-the-past. It also makes it easy to define an iterative schema for tense that allows for multiple points of reference, a possibility noted (...) by Prior and demanded by Comrie, and we sketch how this schema can be generalized to a shift-and-restrict pattern in which special propositional symbols act as restrictors on the range of tense operators. (shrink)

Kellert (In the Wake of Chars, University of Chicago press, Chicago, 1993) has argued that Laplacean determinism in classical physics is actually a layered concept, where various properties or layers composing this form of determinism can be peeled away. Here, I argue that a layered conception of determinism is inappropriate and that we should think in terms of different deterministic models applicable to different kinds of systems. The upshot of this analysis is that the notion of state is more closely (...) tied to the kind of system being investigated than is usually considered in discussions of determinism. So when investigating determinism corresponding changes to the appropriate notion of state – and, perhaps, the state space itself – also need to be considered. (shrink)

This is part I of a two-part essay introducing case-intensional first order logic, an easy-to-use, uniform, powerful, and useful combination of first-order logic with modal logic resulting from philosophical and technical modifications of Bressan’s General interpreted modal calculus. CIFOL starts with a set of cases; each expression has an extension in each case and an intension, which is the function from the cases to the respective case-relative extensions. Predication is intensional; identity is extensional. Definite descriptions are context-independent terms, and lambda-predicates (...) and -operators can be introduced without constraints. These logical resources allow one to define, within CIFOL, important properties of properties, viz., extensionality and absoluteness, Bressan’s chief innovation that allows tracing an individual across cases without recourse to any notion of “rigid designation” or “trans-world identity.” Thereby CIFOL abstains from incorporating any metaphysical principles into the quantificational machinery, unlike extant frameworks of quantified modal logic. We claim that this neutrality makes CIFOL a useful tool for discussing both metaphysical and scientific arguments involving modality and quantification, and we illustrate by discussing in diagrammatic detail a number of such arguments involving the extensional identification of individuals via absolute properties, essential properties, de re vs. de dicto, and the results of possible tests. (shrink)

This paper follows Part I of our essay on case-intensional first-order logic (CIFOL; Belnap and Müller (2013)). We introduce a framework of branching histories to take account of indeterminism. Our system BH-CIFOL adds structure to the cases, which in Part I formed just a set: a case in BH-CIFOL is a moment/history pair, specifying both an element of a partial ordering of moments and one of the total courses of events (extending all the way into the future) that that moment (...) is part of. This framework allows us to define the familiar Ockhamist temporal/modal connectives, most notably for past, future, and settledness. The novelty of our framework becomes visible in our discussion of substances in branching histories, i.e., in its first-order part. That discussion shows how the basic idea of tracing an individual thing from case to case via an absolute property is applicable in a branching histories framework. We stress the importance of keeping apart extensionality and moment-definiteness, and give a formal account of how the specification of natural sortals and natural qualities turns out to be a coordination task in BH-CIFOL. We also provide a detailed answer to Lewis’s well-known argument against branching histories, exposing the fallacy in that argument. (shrink)

A natural language argument may be valid in at least two nonequivalent senses: it may be interpretationally or representationally valid (Etchemendy in The concept of logical consequence. Harvard University Press, Cambridge, 1990). Interpretational and representational validity can both be formally exhibited by classical first-order logic. However, as these two notions of informal validity differ extensionally and first-order logic fixes one determinate extension for the notion of formal validity (or consequence), some arguments must be formalized by unrelated nonequivalent formalizations in order (...) to formally account for their interpretational or representational validity, respectively. As a consequence, arguments must be formalized subject to different criteria of adequate formalization depending on which variant of informal validity is to be revealed. This paper develops different criteria that formalizations of an argument have to satisfy in order to exhibit the latter’s interpretational or representational validity. (shrink)

This article identifies problems with regard to providing criteria that regulate the matching of logical formulae and natural language. We then take on to solve these problems by defining a necessary and sufficient criterion of adequate formalization. On the basis of this criterion we argue that logic should not be seen as an ars iudicandi capable of evaluating the validity or invalidity of informal arguments, but as an ars explicandi that renders transparent the formal structure of informal reasoning.

This paper aims to argue for two related statements: first, that formal semantics should not be conceived of as interpreting natural language expressions in a single model (a very large one representing the world as a whole, or something like that) but as interpreting them in many different models (formal counterparts, say, of little fragments of reality); second, that accepting such a conception of formal semantics yields a better comprehension of the relation between semantics and pragmatics and of the role (...) to be played by formal semantics in the general enterprise of understanding meaning. For this purpose, three kinds of arguments are given: firstly, empirical arguments showing that the many models approach is the most straightforward and natural way of giving a formal counterpart to natural language sentences. Secondly, logical arguments proving the logical impossibility of a single universal model. And thirdly, theoretical arguments to the effect that such a conception of formal semantics fits in a natural and fruitful way with pragmatic theories and facts. In passing, this conception will be shown to cast some new light on the old problems raised by liar and sorites paradoxes. (shrink)

Quantificational arguments can take scope outside of temporal adjunct clauses, in an apparent violation of locality restrictions: the sentence few secretaries cried after each executive resigned allows the quantificational NP each executive to take scope above few secretaries. I show how this scope relation is the result of local operations: the adjunct clause is a temporal generalized quantifier which takes scope over the main clause (Pratt and Francez, Linguistic and Philosophy 24(2), 187–222. [2001]), and within the adjunct clause, the quantificational (...) argument takes scope above the implicit determiner which forms the temporal generalized quantifier. The paper explores various relations among quantificational arguments across clause boundaries, including temporal clauses that are modified internally by a temporal adverbial and temporal clauses with embedded sentential complements. (shrink)