Cognitive science is founded on the conjecture that natural intelligence can be explained in terms of computation. Yet, notoriously, there is no consensus among philosophers of cognitive science as to how computation should be characterised. While there are subtle differences between the various accounts of computation found in the literature, the largest fracture exists between those that unpack computation in semantic terms (and hence view computation as the processing of representations) and those, such as (...) that defended by Chalmers (2011), that cleave towards a purely syntactic formulation (and hence view computation in terms of abstract functional organisation). It will be the main contention of this paper that this dispute arises because contemporary computer science is an amalgam of two different historical traditions, each of which has developed its own proprietary conception of computation. Once these historical trajectories have been properly delineated, and the motivations behind the associated conceptions of computation revealed, it becomes a little clearer which should form the foundation for cognitive science. (shrink)

The semantic view of computation is the claim that semantic properties play an essential role in the individuation of physical computing systems such as laptops and brains. The main argument for the semantic view rests on the fact that some physical systems simultaneously implement different automata at the same time, in the same space, and even in the very same physical properties. Recently, several authors have challenged this argument. They accept the premise of simultaneous implementation but (...) reject the semantic conclusion. In this paper, I aim to explicate the semantic view and to address these objections. I first characterize the semantic view and distinguish it from other, closely related views. Then, I contend that the master argument for the semantic view survives the counter-arguments against it. One counter-argument is that computational individuation is not forced to choose between the implemented automata but rather always picks out a more basic computational structure. My response is that this move might undermine the notion of computational equivalence. Another counter-argument is that while computational individuation is forced to rely on extrinsic features, these features need not be semantic. My reply is that the semantic view better accounts for these extrinsic features than the proposed non-semantic alternatives. (shrink)

According to the semantic view of computation, computations cannot be individuated without invoking semantic properties. A traditional argument for the semantic view is what we shall refer to as the argument from the cognitive science practice. In its general form, this argument rests on the idea that, since cognitive scientists describe computations (in explanations and theories) in semantic terms, computations are individuated semantically. Although commonly invoked in the computational literature, the argument from the cognitive science (...) practice has never been discussed in detail. In this paper, we shall provide a critical reconstruction of this argument and an extensive analysis of its prospects, taking into account some ways of defending it that have never been explored so far. We shall argue that explanatory considerations support at best a weak version of the argument from the cognitive science practice, according to which semantic properties concur with formal syntactic properties in individuating computations in cognitive science, but not a strong version, according to which computation individuation in cognitive science is semantic as opposed to formal syntactic. (shrink)

There is no consensus as to whether a Liar sentence is meaningful or not. Still, a widespread conviction with respect to Liar sentences (and other ungrounded sentences) is that, whether or not they are meaningful, they are useless . The philosophical contribution of this paper is to put this conviction into question. Using the framework of assertoric semantics , which is a semantic valuation method for languages of self-referential truth that has been developed by the author, we show that (...) certain computational problems, called query structures , can be solved more efficiently by an agent who has self-referential resources (amongst which are Liar sentences) than by an agent who has only classical resources; we establish the computational power of self-referential truth . The paper concludes with some thoughts on the implications of the established result for deflationary accounts of truth. (shrink)

Both in formal and computational natural language semantics, the classical correspondence view of meaning – and, more specifically, the view that the meaning of a declarative sentence coincides with its truth conditions – is widely held. Truth (in the world or a situation) plays the role of the given, and meaning is analysed in terms of it. Both language and the world feature in this perspective on meaning, but language users are conspicuously absent. In contrast, the inferentialist semantics that Robert (...) Brandom proposes in his magisterial book ‘Making It Explicit’ puts the language user centre stage. According to his theory of meaning, the utterance of a sentence is meaningful in as far as it is a move by a language user in a game of giving and asking for reasons (with reasons underwritten by a notion of good inferences). In this paper, I propose a proof-theoretic formalisation of the game of giving and asking for reasons that lends itself to computer implementation. In the current proposal, I flesh out an account of defeasible inferences, a variety of inferences which play a pivotal role in ordinary (and scientific) language use. (shrink)

There is a prevalent notion among cognitive scientists and philosophers of mind that computers are merely formal symbol manipulators, performing the actions they do solely on the basis of the syntactic properties of the symbols they manipulate. This view of computers has allowed some philosophers to divorce semantics from computational explanations. Semantic content, then, becomes something one adds to computational explanations to get psychological explanations. Other philosophers, such as Stephen Stich, have taken a stronger view, advocating doing away with (...) semantics entirely. This paper argues that a correct account of computation requires us to attribute content to computational processes in order to explain which functions are being computed. This entails that computational psychology must countenance mental representations. Since anti-semantic positions are incompatible with computational psychology thus construed, they ought to be rejected. Lastly, I argue that in an important sense, computers are not formal symbol manipulators. (shrink)

There is a prevalent notion among cognitive scientists and philosophers of mind that computers are merely formal symbol manipulators, performing the actions they do solely on the basis of the syntactic properties of the symbols they manipulate. This view of computers has allowed some philosophers to divorce semantics from computational explanations. Semantic content, then, becomes something one adds to computational explanations to get psychological explanations. Other philosophers, such as Stephen Stich, have taken a stronger view, advocating doing away with (...) semantics entirely. This paper argues that a correct account of computation requires us to attribute content to computational processes in order to explain which functions are being computed. This entails that computational psychology must countenance mental representations. Since anti-semantic positions are incompatible with computational psychology thus construed, they ought to be rejected. Lastly, I argue that in an important sense, computers are not formal symbol manipulators. (shrink)

In recent works, Chomsky has once more endorsed a computational view of rulefollowing, whereby to follow a rule is to operate certain computations on a subject’s mental representations. As is well known, this picture does not conform to what we may call the grammatical conception of rule-following outlined by Wittgenstein, whereby an elucidation of the concept of rule-following is aimed at by isolating grammatical statements regarding the phrase ‘to follow a rule’. As a result, Chomskyan and Wittgensteinian treatments of topics (...) immediately connected with rule-following, namely linguistic competence and understanding, are utterly different from one another. There are two possible stances that computationalists like Chomsky may adopt with regard to the discrepancy between the two aforementioned modes of dealing with rule-following, namely a conciliatory and a non-conciliatory attitude. According to the former attitude, grammatical remarks on and computationallyoriented theories of rule-following investigate one and the same topic although admittedly at different levels, namely a conceptual and an empirical one. According to the latter attitude, grammatical remarks are just a preliminary step in the investigation of rule-following which scientific advancement, presently represented by computationally-oriented theories on this matter, is well entitled to put aside. In what follows, however, I will try to show that both stances are problematic. The conciliatory attitude simply does not work, for it hardly copes with the fact that the concept of rule-following does not supervene, even weakly, on the property of rule-following, namely the property instantiated in the mental/cerebral phenomena that computationally-oriented theories of rule-following study. To take the contrary attitude, on the other hand, is to end up with another disappointing result, namely that the computational treatment of rule-following ultimately deals with something different from that which we wished to gain knowledge of when we began our inquiry into rule-following.. (shrink)

I present a computational-level model of semantic interference effects in online word production within a rate–distortion framework. I consider a bounded-rational agent trying to produce words. The agent's action policy is determined by maximizing accuracy in production subject to computational constraints. These computational constraints are formalized using mutual information. I show that semantic similarity-based interference among words falls out naturally from this setup, and I present a series of simulations showing that the model captures some of the key (...) empirical patterns observed in Stroop and Picture–Word Interference paradigms, including comparisons to human data from previous experiments. (shrink)

We present an analysis of the game semantics of general references introduced by Abramsky, Honda and McCusker which exposes the algebraic structure of the model. Using the notion of sequoidal category, we give a coalgebraic definition of the denotational semantics of storage cells of arbitrary type. We identify further conditions on the model which allow an axiomatic presentation of the proof that finite elements of the model are definable by programs, in the style of Abramsky’s Axioms for Definability.

Recent theories of scalar implicature, such as that proposed by Gennaro Chierchia, have sought to bring them within the domain of compositional semantic theory. These approaches contrast with standard pragmatic explanations of the phenomena in that implicatures are calculated by default and are computed locally. One motivation for Chierchia's approach, the purported connection between the computation of scalar implicatures and 'any'-licensing polarity items, is shown to be weak. Difficulties are then presented for his approach which are not shared (...) by the pragmatic theory. (shrink)

Some computational phenomena rely essentially on pragmatic considerations, and seem to undermine the independence of the specification from the implementation. These include software development, deviant uses, esoteric languages and recent data-driven applications. To account for them, the interaction between pragmatics, epistemology and ontology in computational artefacts seems essential, indicating the need to recover the role of the language metaphor. We propose a User Levels (ULs) structure as a pragmatic complement to the Levels of Abstraction (LoAs)-based structure defining the ontology (...) and epistemology of computational artefacts. ULs identify a flexible hierarchy in which users bear their own semantic and normative requirements, possibly competing with the logical specification. We formulate a notion of computational act intended in its pragmatic sense, alongside pragmatic versions of implementation and correctness. (shrink)

The present article provides an analysis of the existing proof systems for dynamic epistemic logic from the viewpoint of proof-theoretic semantics. Dynamic epistemic logic is one of the best known members of a family of logical systems that have been successfully applied to diverse scientific disciplines, but the proof-theoretic treatment of which presents many difficulties. After an illustration of the proof-theoretic semantic principles most relevant to the treatment of logical connectives, we turn to illustrating the main features of display (...) calculi, a proof-theoretic paradigm that has been successfully employed to give a proof-theoretic semantic account of modal and substructural logics. Then, we review some of the most significant proposals of proof systems for dynamic epistemic logics, and we critically reflect on them in the light of the previously introduced proof-theoretic semantic principles. The contributions of the present article include a generalization of Belnap's cut-elimination metatheorem for display calculi, and a revised version of the display-style calculus D.EAK. We verify that the revised version satisfies the previously mentioned proof-theoretic semantic principles, and show that it enjoys cut-elimination as a consequence of the generalized metatheorem. (shrink)

A single physical process may often be described equally well as computing several different mathematical functions—none of which is explanatorily privileged. How, then, should the computational identity of a physical system be determined? Some computational mechanists hold that computation is individuated only by either narrow physical or functional properties. Even if some individuative role is attributed to environmental factors, it is rather limited. The computational semanticist holds that computation is individuated, at least in part, by semantic properties. (...) She claims that the mechanistic account lacks the resources to individuate the computations performed by some systems, thereby leaving interesting cases of computational indeterminacy unaddressed. This article examines some of these views, and claims that more cases of computational indeterminacy can be addressed, if the system-environment interaction plays a greater role in individuating computations. A new, long-arm functional strategy for individuating computation is advanced. (shrink)

Logics based on weak Kleene algebra (WKA) and related structures have been recently proposed as a tool for reasoning about flaws in computer programs. The key element of this proposal is the presence, in WKA and related structures, of a non-classical truth-value that is “contaminating” in the sense that whenever the value is assigned to a formula ϕ, any complex formula in which ϕ appears is assigned that value as well. Under such interpretations, the contaminating states represent occurrences of a (...) flaw. However, since different programs and machines can interact with (or be nested into) one another, we need to account for different kind of errors, and this calls for an evaluation of systems with multiple contaminating values. In this paper, we make steps toward these evaluation systems by considering two logics, HYB1 and HYB2, whose semantic interpretations account for two contaminating values beside classical values 0 and 1. In particular, we provide two main formal contributions. First, we give a characterization of their relations of (multiple-conclusion) logical consequence—that is, necessary and sufficient conditions for a set Δ of formulas to logically follow from a set Γ of formulas in HYB1 or HYB2 . Second, we provide sound and complete sequent calculi for the two logics. (shrink)

In this paper, I show how semantic factors constrain the understanding of the computational phenomena to be explained so that they help build better mechanistic models. In particular, understanding what cognitive systems may refer to is important in building better models of cognitive processes. For that purpose, a recent study of some phenomena in rats that are capable of ‘entertaining’ future paths (Pfeiffer and Foster 2013) is analyzed. The case shows that the mechanistic account of physical computation (...) may be complemented with semantic considerations, and in many cases, it actually should. (shrink)

A graph-theoretic account of logics is explored based on the general notion of m-graph (that is, a graph where each edge can have a finite sequence of nodes as source). Signatures, interpretation structures and deduction systems are seen as m-graphs. After defining a category freely generated by a m-graph, formulas and expressions in general can be seen as morphisms. Moreover, derivations involving rule instantiation are also morphisms. Soundness and completeness theorems are proved. As a consequence of the generality of (...) the approach our results apply to very different logics encompassing, among others, substructural logics as well as logics with nondeterministic semantics, and subsume all logics endowed with an algebraic semantics. (shrink)

In this paper I consider the idea of external language and examine the role it plays in our understanding of human linguistic practice. Following Michael Devitt, I assume that the subject matter of a linguistic theory is not a psychologically real computational module, but a semiotic system of physical entities equipped with linguistic properties. 2 What are the physical items that count as linguistic tokens and in virtue of what do they possess phonetic, syntactic and semantic properties? According to (...) Devitt, the entities in question are particular bursts of sound or bits of ink that count as standard linguistic entities3 — that is, strings of phonemes, sequences of words and sentences — in virtue of the conventional rules that constitute the structure of the linguistic reality. In my view, however, the bearers of linguistic properties should rather be understood as complex physical states of affairs — that I call, following Ruth G. Millikan, complete linguistic signs4 — within which one can single out their narrow and wide components, that is, (0 sounds or inscriptions produced by the speaker and (if) salient aspects of the context of their production. Moreover, I do not share Devitt's view on the nature of linguistic properties. Even though I maintain the general idea of convention-based semantics — according to which semantic properties of linguistic tokens are essentially conventional — I reject the Lewisian robust account of conventionality. Following Millikan, I assume that language conventions involve neither regular conformity nor mutual understanding. (shrink)

With increasing publication and data production, scientific knowledge presents not simply an achievement but also a challenge. Scientific publications and data are increasingly treated as resources that need to be digitally ‘managed.’ This gives rise to scientific Knowledge Management : second-order scientific work aiming to systematically collect, take care of and mobilise first-hand disciplinary knowledge and data in order to provide new first-order scientific knowledge. We follow the work of Leonelli, Efstathiou and Hislop in our analysis of the use of (...) KM in semantic systems biology. Through an empirical philosophical account of KM-enabled biological research, we argue that KM helps produce new first-order biological knowledge that did not exist before, and which could not have been produced by traditional means. KM work is enabled by conceiving of ‘knowledge’ as an object for computational science: as explicated in the text of biological articles and computable via appropriate data and metadata. However, these founded knowledge concepts enabling computational KM risk focusing on only computationally tractable data as knowledge, underestimating practice-based knowing and its significance in ensuring the validity of ‘manageable’ knowledge as knowledge. (shrink)

The reconciliation of theories of concepts based on prototypes, exemplars, and theory-like structures is a longstanding problem in cognitive science. In response to this problem, researchers have recently tended to adopt either hybrid theories that combine various kinds of representational structure, or eliminative theories that replace concepts with a more finely grained taxonomy of mental representations. In this paper, we describe an alternative approach involving a single class of mental representations called “semantic pointers.” Semantic pointers are symbol-like representations (...) that result from the compression and recursive binding of perceptual, lexical, and motor representations, effectively integrating traditional connectionist and symbolic approaches. We present a computational model using semantic pointers that replicates experimental data from categorization studies involving each prior paradigm. We argue that a framework involving semantic pointers can provide a unified account of conceptual phenomena, and we compare our framework to existing alternatives in accounting for the scope, content, recursive combination, and neural implementation of concepts. (shrink)

Miriam Schoenfield argues that moral realism and moral vagueness imply ontic vagueness. In particular, she argues that neither shifty nor rigid semantic accounts of vagueness can provide a satisfactory explanation of moral vagueness for moral realists. This paper constitutes a response. I argue that Schoenfield's argument against the shifty semantic account presupposes that moral indeterminacies can, in fact, be resolved determinately by crunching through linguistic data. I provide different reasons for rejecting this assumption. Furthermore, I argue that (...) Schoenfield's rejection of the rigid semantic account is based on a presupposition that ultimately implies the very same claim that is under dispute: the vagueness of moral predicates in imperfect languages persists in the perfect language, as well. (shrink)

Both formal semantics and cognitive semantics are the source of important insights about language. By developing precise statements of the rules of meaning in fragmentary, abstract languages, formalists have been able to offer perspicuous accounts of how we might come to know such rules and use them to communicate with others. Conversely, by charting the overall landscape of interpretations, cognitivists have documented how closely interpretations draw on the commonsense knowledge that lets us make our way in the world. There is (...) no opposition between these insights. Sooner or later we will have a semantics that responds to both. However, developing such a semantics is profoundly difficult, because there are certain tensions to be overcome in reconciling the two perspectives. For one thing, the overall landscape of meaning does seem to be characterized by a much richer ontology and more dynamic categories than are exhibited by the fragments typically studied in the formal tradition. One sign of strain is the recent tendency to talk of “procedural”, “non-compositional”, or “computational” semantics, as in Hamm, Kamp and van Lambalgen 2006, hereafter HK&vL. We think such locutions can serve as useful reminders to keep semantics fixed on the central question of how language allows us to share information that some have and others need to get. However, there is some danger that formalists will merely by put off by an idea that, taken literally, may not be such a good one. In this short article, we want to explore and defend the traditional realist view attributed by HK&vL to Lewis among others. In fact, this view offers a well-developed, extremely straightforward and robust account of the relation between semantics and cognition. Moreover, while the realist view has ways of accommodating the representationalist insights of DRT (Lewis 1979; Thomason 1990; Stalnaker 1998), it remains unclear how “computational” semantics can account for the key data for the realist view: cases where we judge interlocutors to be ignorant about aspects of meaning in their native language (Kripke 1972; Putnam 1975; Stalnaker 1979; Williamson 1994).. (shrink)

Over the past 15 years, there have been two increasingly popular approaches to the study of meaning in cognitive science. One, based on theories of embodied cognition, treats meaning as a simulation of perceptual and motor states. An alternative approach treats meaning as a consequence of the statistical distribution of words across spoken and written language. On the surface, these appear to be opposing scientific paradigms. In this review, we aim to show how recent cross-disciplinary developments have done much to (...) reconcile these two approaches. The foundation to these developments has been the recognition that intralinguistic distributional and sensory-motor data are interdependent. We describe recent work in philosophy, psychology, cognitive neuroscience, and computational modeling that are all based on or consistent with this conclusion. We conclude by considering some possible directions for future research that arise as a consequence of these developments. (shrink)

Written as a comment on Crispin Wright's "Vagueness: A Fifth Column Approach", this paper defends a form of supervaluationism against Wright's criticisms. Along the way, however, it takes up the question what is really wrong with Epistemicism, how the appeal of the Sorities ought properly to be understood, and why Contextualist accounts of vagueness won't do.

Read as a comment on Crispin Wright's \"Vagueness: A Fifth Column Approach\", this paper defends a form of supervaluationism against Wright's criticisms. Along the way, however, it takes up the question what is really wrong with Epistemicism, how the appeal of the Sorities ought properly to be understood, and why Contextualist accounts of vagueness won't do.

Each of our theories of mental representation provides some insight into how the mind works. However, these insights often seem incompatible, as the debates between symbolic, dynamical, emergentist, sub-symbolic, and grounded approaches to cognition attest. Mental representations—whatever they are—must share many features with each of our theories of representation, and yet there are few hypotheses about how a synthesis could be possible. Here, I develop a theory of the underpinnings of symbolic cognition that shows how sub-symbolic dynamics may give rise (...) to higher-level cognitive representations of structures, systems of knowledge, and algorithmic processes. This theory implements a version of conceptual role semantics by positing an internal universal representation language in which learners may create mental models to capture dynamics they observe in the world. The theory formalizes one account of how truly novel conceptual content may arise, allowing us to explain how even elementary logical and computational operations may be learned from a more primitive basis. I provide an implementation that learns to represent a variety of structures, including logic, number, kinship trees, regular languages, context-free languages, domains of theories like magnetism, dominance hierarchies, list structures, quantification, and computational primitives like repetition, reversal, and recursion. This account is based on simple discrete dynamical processes that could be implemented in a variety of different physical or biological systems. In particular, I describe how the required dynamics can be directly implemented in a connectionist framework. The resulting theory provides an “assembly language” for cognition, where high-level theories of symbolic computation can be implemented in simple dynamics that themselves could be encoded in biologically plausible systems. (shrink)

Computationalism says that brains are computing mechanisms, that is, mechanisms that perform computations. At present, there is no consensus on how to formulate computationalism precisely or adjudicate the dispute between computationalism and its foes, or between different versions of computationalism. An important reason for the current impasse is the lack of a satisfactory philosophical account of computing mechanisms. The main goal of this dissertation is to offer such an account.
I also believe that the history of computationalism sheds light (...) on the current debate. By tracing different versions of computationalism to their common historical origin, we can see how the current divisions originated and understand their motivation. Reconstructing debates over computationalism in the context of their own intellectual history can contribute to philosophical progress on the relation between brains and computing mechanisms and help determine how brains and computing mechanisms are alike, and how they differ. Accordingly, my dissertation is divided into a historical part, which traces the early history of computationalism up to 1946, and a philosophical part, which offers an account of computing mechanisms.
The two main ideas developed in this dissertation are that (1) computational states are to be identified functionally not semantically, and (2) computing mechanisms are to be studied by functional analysis. The resulting account of computing mechanism, which I call the functional account of computing mechanisms, can be used to identify computing mechanisms and the functions they compute. I use the functional account of computing mechanisms to taxonomize computing mechanisms based on their different computing power, and I use this taxonomy of computing mechanisms to taxonomize different versions of computationalism based on the functional properties that they ascribe to brains. By doing so, I begin to tease out empirically testable statements about the functional organization of the brain that different versions of computationalism are committed to. I submit that when computationalism is reformulated in the more explicit and precise way I propose, the disputes about computationalism can be adjudicated on the grounds of empirical evidence from neuroscience. (shrink)

Many if not all evidential languages have a mirative evidential: an indirect evidential that can, in some contexts, mark mirativity (the expression of speaker surprise) instead of indirect evidence. We address several questions posed by this systematic polysemy: What is the affinity between indirect evidence and speaker surprise? What conditions the two interpretations? And how do mirative evidentials relate to other mirative markers? We propose a unified analysis of mirative evidentials where indirect evidentiality and mirativity involve a common epistemic component. (...) A mirative interpretation requires a close temporal proximity between the speech event and the event of the speaker's learning the at-issue content. (shrink)

This paper revisits intervention effects in Mandarin Chinese why-questions. I present a novel empirical generalization, in which it is shown that the ability for quantifiers to induce intervention hinges upon their monotonicity and their ability to be interpreted as topics. I then propose a semantic account of intervention that correlates topicality with the monotone properties of intervening operators. A crucial assumption in this account is that why-questions in Chinese are idiosyncratic, in that the Chinese equivalent of why (...) directly merges at a high scope position that stays above a propositional argument. Combining the semantic idiosyncrasies of why-questions with the theory of topicality, I conclude that a wide range of intervention phenomena can be explained in terms of interpretation failure. (shrink)

This essay considers what it means to understand natural language and whether a computer running an artificial-intelligence program designed to understand natural language does in fact do so. It is argued that a certain kind of semantics is needed to understand natural language, that this kind of semantics is mere symbol manipulation (i.e., syntax), and that, hence, it is available to AI systems. Recent arguments by Searle and Dretske to the effect that computers cannot understand natural language are discussed, and (...) a prototype natural-language-understanding system is presented as an illustration. (shrink)

What does it mean to say that an object or system computes? What is it about laptops, smartphones, and nervous systems that they are considered to compute, and why does it seldom occur to us to describe stomachs, hurricanes, rocks, or chairs that way? Though computing systems are everywhere today, it is very difficult to answer these questions. The book aims to shed light on the subject by arguing for the semantic view of computation, which states that computingsystems (...) are always accompanied by representations. This view is presented as an alternative to non-semantic views such as the mechanistic account of computation. (shrink)

According to Alberto Coffa in The Semantic Tradition from Kant to Carnap, Kant’s account of mathematical judgment is built on a ‘semantic swamp’. Kant’s primitive semantics led him to appeal to pure intuition in an attempt to explain mathematical necessity. The appeal to pure intuition was, on Coffa’s line, a blunder from which philosophy was forced to spend the next 150 years trying to recover. This dismal assessment of Kant’s contributions to the evolution of accounts of mathematical (...) necessity is fundamentally backward-looking. Coffa’s account of how semantic theories of the a priori evolved out of Kant’s doctrine of pure intuition rightly emphasizes those developments, both scientific and philosophical, that collectively served to undermine the plausibility of Kant’s account. What is missing from Coffa’s story, apart from any recognition of Kant’s semantic innovations, is an attempt to appreciate Kant’s philosophical context and the distinctive perspective from which Kant viewed issues in the philosophy of mathematics. When Kant’s perspective and context are brought out, he can not only be seen to have made a genuinely progressive contribution to the development of accounts of mathematical necessity, but also to be relevant to contemporary issues in the philosophy of mathematics in underappreciated ways. (shrink)

Here we give a semantical account of propositional quantification that is intended to formally represent Russell’s view that one cannot express a proposition about "all" propositions. According to the account the authors give, Russell’s view bears an interesting relation to the view that there are no sets which are members of themselves.

I offer an understanding of what it is for a term to be rigid which makes no serious metaphysical commitments to or about identity across possible worlds. What makes a term rigid is not that it 'refers to the same object(property) with respect to all worlds' - rather (roughly) it is that the criteria of application for the term with respect to other worlds, when combined with the criteria of identity associated with the term, ensure that whatever meets the criteria (...) of identity also meets the criteria of application and vice versa - in the simplest case, the criteria of application just are the criteria of identity - but things can be more complex to allow for the necessary a posteriori. This makes rigidity a non-metaphysically loaded semantic matters, and allows us to see that the phenomenon of and involving rigidity - especially the necessary a posteriori - are of no metaphysical significance on their own. (shrink)

Explanations in cognitive science and computational neuroscience rely predominantly on computational modeling. Although the scientific practice is systematic, and there is little doubt about the empirical value of numerous models, the methodological account of computational explanation is not up-to-date. The current chapter offers a systematic account of computational explanation in cognitive science and computational neuroscience within a mechanistic framework. The account is illustrated with a short case study of modeling of the mirror neuron system in terms of (...) predictive coding. (shrink)

We formulate a Curry-typed logic with fine-grained intensionality within Turner’s typed predicate logic. This allows for an elegant presentation of a theory that corresponds to Fox and Lappin’s property theory with curry typing, but without the need for a federation of languages. We then consider how the fine-grained intensionality of this theory can be given an operational interpretation. This interpretation suggests itself as expressions in the theory can be viewed as terms in the untyped lambda-calculus, which provides a model of (...) computation. (shrink)

Polysemy has recently emerged as a popular topic in philosophy of language. While much existing research focuses on the relatedness among senses, this article introduces a novel perspective that emphasizes the continuity of sense individuation, sense regularity, and sense productivity. This new perspective has only recently gained traction, largely due to advancements in computational linguistics. It also poses a serious challenge to semantic minimalism, so I present three arguments against minimalism from the continuous perspective that touch on the minimal (...) concept, the distinction from homonymy, and the quasi‐rule‐like nature of polysemy. Last, I provide an account of polysemy that incorporates this continuous perspective. (shrink)

The resemblance of the theory of formal consequence first offered by the fourteenth-century logician John Buridan to that later offered by Alfred Tarski has long been remarked upon. But it has not yet been subjected to sustained analysis. In this paper, I provide just such an analysis. I begin by reviewing today’s classical understanding of formal consequence, then highlighting its differences from Tarski’s 1936 account. Following this, I introduce Buridan’s account, detailing its philosophical underpinnings, then its content. This (...) then allows us to separate those aspects of Tarski’s account representing genuine historical advances, unavailable to Buridan, from others merely differing from—and occasionally explicitly rejected by—Buridan’s account. (shrink)

In this paper we consider persuasion in the context of practical reasoning, and discuss the problems associated with construing reasoning about actions in a manner similar to reasoning about beliefs. We propose a perspective on practical reasoning as presumptive justification of a course of action, along with critical questions of this justification, building on the account of Walton. From this perspective, we articulate an interaction protocol, which we call PARMA, for dialogues over proposed actions based on this theory. We (...) outline an axiomatic semantics for the PARMA Protocol, and discuss two implementations which use this protocol to mediate a discussion between humans. We then show how our proposal can be made computational within the framework of agents based on the Belief-Desire-Intention model, and illustrate this proposal with an example debate within a multi agent system. (shrink)

William Whewell’s account of induction differs dramatically from the one familiar from twentieth-century debates. I argue that Whewell’s induction can be usefully understood by comparing the difference between his views and more standard accounts to contemporary debates between semantic and syntactic views of theories: rather than understanding inductive inference as capturing a relationship between sentences or propositions, Whewell understands it as a method for constructing a model of the world. The difference between this view and the more familiar (...) picture of induction is reflected in other aspects of Whewell’s philosophy of science, particularly his treatment of consilience and the order of discovery. (shrink)

We study the computational complexity of polyadic quantifiers in natural language. This type of quantification is widely used in formal semantics to model the meaning of multi-quantifier sentences. First, we show that the standard constructions that turn simple determiners into complex quantifiers, namely Boolean operations, iteration, cumulation, and resumption, are tractable. Then, we provide an insight into branching operation yielding intractable natural language multi-quantifier expressions. Next, we focus on a linguistic case study. We use computational complexity results to investigate (...) class='Hi'>semantic distinctions between quantified reciprocal sentences. We show a computational dichotomy<br>between different readings of reciprocity. Finally, we go more into philosophical speculation on meaning, ambiguity and computational complexity. In particular, we investigate a possibility to<br>revise the Strong Meaning Hypothesis with complexity aspects to better account for meaning shifts in the domain of multi-quantifier sentences. The paper not only contributes to the field of the formal<br>semantics but also illustrates how the tools of computational complexity theory might be successfully used in linguistics and philosophy with an eye towards cognitive science. (shrink)

We provide a semantic analysis of respective readings, including butnot limited to the interpretation of examples containing the adverbrespectively, which accounts for a number of facts that haveeither proven difficult for previous studies or heretofore goneunnoticed in the literature. The analysis introduces the new notionsof property sum and proposition sum which integrate smoothly with existing analyses of plurals and distributivity. The analysis also admits of a straightforward account of previouslyunacknowledged examples involving filler-gap dependencies that areproblematic for contemporary syntactic (...) theories. Ramifications anddirections for future research are discussed. (shrink)

This paper offers an account of what it is for a physical system to be a computing mechanism—a mechanism that performs computations. A computing mechanism is any mechanism whose functional analysis ascribes it the function of generating outputs strings from input strings in accordance with a general rule that applies to all strings. This account is motivated by reasons that are endogenous to the philosophy of computing, but it may also be seen as an application of recent literature (...) on mechanisms. The account can be used to individuate computing mechanisms and the functions they compute and to taxonomize computing mechanisms based on their computing power. This makes it ideal for grounding the comparison and assessment of computational theories of mind and brain. (shrink)

In this paper, we propose a framework capable of dealing with anaphora and ellipsis which is both general and algorithmic. This generality is ensured by the compination of two general ideas. First, we use a dynamic semantics which reperent effects using a monad structure. Second we treat scopes flexibly, extending them as needed. We additionally implement this framework as an algorithm which translates abstract syntax to logical formulas. We argue that this framework can provide a unified account of a (...) large number of anaphoric phenomena. Specifically, we show its effectiveness in dealing with pronominal and VP-anaphora, strict and lazy pronouns, lazy identity, bound variable anaphora, e-type pronouns, and cataphora. This means that in particular we can handle complex cases like Bach–Peters sentences, which require an account dealing simultaneously with several phenomena. We use Haskell as a meta-language to present the theory, which also consitutes an implementation of all the phenomena discussed in the paper. To demonstrate coverage, we propose a test suite that can be used to evaluate computational approaches to anaphora. (shrink)

Open peer commentary on the article “A Cybernetic Computational Model for Learning and Skill Acquisition” by Bernard Scott & Abhinav Bansal. Upshot: The Computational Theory of Mind suffers from an inherent weakness owing to its difficulty in taking semantics and embodiment properly into account. It is suggested that these difficulties could be alleviated if it were recognized that the fact that the model presented here employs a computer as a tool, to highlight certain key features of its dynamics, does (...) not necessarily involve assuming that the underlying processes that are modelled are themselves strictly computational in nature. (shrink)

This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. Our approach is to view such models as full subcategories of categorical models of intuitionistic set theory. It is shown that the existence of solutions to recursive domain equations depends upon the strength of the set theory. We observe that the internal set theory of an elementary topos is not strong enough to guarantee their existence. In (...) contrast, as our first main result, we establish that solutions to recursive domain equations do exist when the category of sets is a model of full intuitionistic Zermelo–Fraenkel set theory. We then apply this result to obtain a denotational interpretation of FPC, a recursively typed lambda-calculus with call-by-value operational semantics. By exploiting the intuitionistic logic of the ambient model of intuitionistic set theory, we analyse the relationship between operational and denotational semantics. We first prove an “internal” computational adequacy theorem: the model always believes that the operational and denotational notions of termination agree. This allows us to identify, as our second main result, a necessary and sufficient condition for genuine “external” computational adequacy to hold, i.e. for the operational and denotational notions of termination to coincide in the real world. The condition is formulated as a simple property of the internal logic, related to the logical notion of 1-consistency. We provide useful sufficient conditions for establishing that the logical property holds in practice. Finally, we outline how the methods of the paper may be applied to concrete models of FPC. In doing so, we obtain computational adequacy results for an extensive range of realizability and domain-theoretic models. (shrink)

The article discusses the possibilities of the formal analysis of the fine-art painting composition on the basis of the classical definitions of beauty and computational aesthetics’ approaches of the second half of the 20th century he authors define the problem and consider solutions for the formalization of aesthetic perception in the context of aesthetic text, i.e., as part of the fine arts composition – a formal sequence of signs simply ordered in accordance with the syntactic rules’ system. The methodology of (...) the research is defined by the general semiotics, distinguishing semantics, syntax, and pragmatics of a sign, by the aesthetic analysis’ methods, ranging according to the author’s message aesthetics, receptive aesthetics, and text aesthetics, as well as by the computational analysis methods connected with neural network means of defining the images’ symmetry. The article reveals preconditions for the emergence and also the current state of computational aesthetics as an interdisciplinary branch of knowledge. Analyzing the problem from the perspective of philosophy, aesthetics, semiotics, and technology, the authors draw attention to the need to improve the computational aesthetics methods. Firstly, the existing methods do not always enable to describe the fine-art object adequately. Secondly, there exists the so-called reduction of aesthetic assertion transforming it into the assertion concerning the object’s external characteristics. As a result, the authors assume that the increasing complexity of the current mathematical models and the experts’ subjective assessment support will allow to reach a compromise solution that enables the development of computational aesthetics as a branch of knowledge. Enhancement and development of the mathematical models, taking into account the rules of semiotics and subjectivism of the human perception, is the relevant objective of computational analysis of the aesthetic fine-arts text. The results of the present research supports the classic statement regarding the underivability of semantic and pragmatic propositions from syntax. The research concludes that relevant objectives are to find a correlation between, one the one hand, the axes and points of symmetry, deriving from the neural simulation, and, on the other hand, aesthetic effect, emerging from the perception of fine-art paintings. (shrink)

I examine the abstraction/representation theory of computation put forward by Horsman et al., connecting it to the broader notion of modeling, and in particular, model-based explanation, as considered by Rosen. I argue that the ‘representational entities’ it depends on cannot themselves be computational, and that, in particular, their representational capacities cannot be realized by computational means, and must remain explanatorily opaque to them. I then propose that representation might be realized by subjective experience, through being the bearer of the (...) structure of abstract objects that are represented. (shrink)