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)

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)

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)

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)

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)

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)

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.

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)

The epistemic modal auxiliaries must and might are vehicles for expressing the force with which a proposition follows from some body of evidence or information. Standard approaches model these operators using quantificational modal logic, but probabilistic approaches are becoming increasingly influential. According to a traditional view, must is a maximally strong epistemic operator and might is a bare possibility one. A competing account—popular amongst proponents of a probabilisitic turn—says that, given a body of evidence, must \ entails that \\) (...) is high but non-maximal and might \ that \\) is significantly greater than 0. Drawing on several observations concerning the behavior of must, might and similar epistemic operators in evidential contexts, deductive inferences, downplaying and retractions scenarios, and expressions of epistemic tension, I argue that those two influential accounts have systematic descriptive shortcomings. To better make sense of their complex behavior, I propose instead a broadly Kratzerian account according to which must \ entails that \ = 1\) and might \ that \ > 0\), given a body of evidence and a set of normality assumptions about the world. From this perspective, must and might are vehicles for expressing a common mode of reasoning whereby we draw inferences from specific bits of evidence against a rich set of background assumptions—some of which we represent as defeasible—which capture our general expectations about the world. I will show that the predictions of this Kratzerian account can be substantially refined once it is combined with a specific yet independently motivated ‘grammatical’ approach to the computation of scalar implicatures. Finally, I discuss some implications of these results for more general discussions concerning the empirical and theoretical motivation to adopt a probabilisitic semantic framework. (shrink)

I start out by reviewing the semantics of ‘seem’. As ‘seem’ is a subject-raising verb, ‘it seems’ can be treated as a sentential operator. I look at the semantic and logical properties of ‘it seems’. I argue that ‘it seems’ is a hyperintensional and contextually flexible operator. The operator distributes over conjunction but not over disjunction, conditionals or semantic entailments. I further argue that ‘it seems’ does not commute with negation and does not agglomerate with conjunction. I then (...) show that the mental states expressed by perceptual uses of ‘seem’ have non-conceptual, yet perspectival contents. In the final part of the paper I argue that while the content of the mental states expressed by perceptual uses of ‘seem’ are non-conceptual, having a mental state of this type requires possessing conceptual abilities corresponding to what the mental state represents. (shrink)

Despite their success in describing and predicting cognitive behavior, the plausibility of so-called ‘rational explanations’ is often contested on the grounds of computational intractability. Several cognitive scientists have argued that such intractability is an orthogonal pseudoproblem, however, since rational explanations account for the ‘why’ of cognition but are agnostic about the ‘how’. Their central premise is that humans do not actually perform the rational calculations posited by their models, but only act as if they do. Whether or not the (...) problem of intractability is solved by recourse to ‘as if’ explanations critically depends, inter alia, on the semantics of the ‘as if’ connective. We examine the five most sensible explications in the literature, and conclude that none of them circumvents the problem. As a result, rational ‘as if’ explanations must obey the minimal computational constraint of tractability. (shrink)

Although formal thought disorder (FTD) has been for long a clinical label in the assessment of some psychiatric disorders, in particular of schizophrenia, it remains a source of controversy, mostly because it is hard to say what exactly the “formal” in FTD refers to. We see anomalous processing of terminological knowledge, a core construct of human knowledge in general, behind FTD symptoms and we approach this anomaly from a strictly formal perspective. More specifically, we present here a symbolic computational model (...) of storage in, and activation of, a human semantic network, or semantic memory, whose core element is logical form; this is normalized by description logic (DL), namely by CL, a DL-based language – Conception Language – designed to formalize conceptualization from the viewpoint of individual cognitive agency. In this model, disruptions in the rule-based implementation of the logical form account for the apparently semantic anomalies symptomatic of FTD, which are detected by means of a CL-based algorithmic assessment. (shrink)

The starting point for this paper is a critical discussion of claims of psychological reality articulated within Borg’s (forth.) minimal semantics and Carpintero’s (2007) character*-semantics. It has been proposed, for independent reasons, that their respective accounts can accommodate, or at least avoid the challenge from psychological evidence. I outline their respective motivations, suggesting various shortcomings in their efforts of preserving the virtues of an uncontaminated semantics in the face of psychological objection (I-II), and try to make the case that, at (...) least for a theory of utterance comprehension, a truth-conditional pragmatic stance is far preferable. An alternative from a relevance-theoretic perspective is offered in terms of mutual adjustment between truth-conditional content and implicature(s), arguing that many “free” pragmatic processes are needed to uncover the truth-conditional content, which can then warrant the expected implicature(s) (III). I finally illustrate the difficulties their accounts have in predicting the correct order of interpretation in cases of ironic metaphor, i.e. metaphor is computed first, as part of truth-conditional content, while irony is inferentially grounded in metaphorical content (IV). (shrink)

In 1988, J. Ivlev proposed some (non-normal) modal systems which are semantically characterized by four-valued non-deterministic matrices in the sense of A. Avron and I. Lev. Swap structures are multialgebras (a.k.a. hyperalgebras) of a special kind, which were introduced in 2016 by W. Carnielli and M. Coniglio in order to give a non-deterministic semantical account for several paraconsistent logics known as logics of formal inconsistency, which are not algebraizable by means of the standard techniques. Each swap structure induces naturally (...) a non-deterministic matrix. The aim of this paper is to obtain a swap structures semantics for some Ivlev-like modal systems proposed in 2015 by M. Coniglio, L. Fariñas del Cerro and N. Peron. Completeness results will be stated by means of the notion of Lindenbaum–Tarski swap structures, which constitute a natural generalization to multialgebras of the concept of Lindenbaum–Tarski algebras. (shrink)

The aim of the paper is to argue that the difference between creative and non-creative mental processes is not a functional/computational, but an experiential one. In other words, what is distinctive about creative mental processes is not the functional/computational mechanism that leads to the emergence of a creative idea, be it the recombination of old ideas or the transformation of one’s conceptual space, but the way in which this mental process is experienced. The explanatory power of the functional/computational theories and (...) the experiential account is compared and it is pointed out that if creativity is a natural kind, it is not a functional/computational, but an experiential natural kind. (shrink)

This paper explains three ways to develop a conceptual role view of meaning in metaethics. First, it suggests that there’s a way to combine inspiration from noncognitivism with a particular form of the conceptual role view to form a noncognitivist view with distinctive advantages over other noncognitivist views. Second, it suggests that there’s also a way to combine a strong commitment to cognitivism with a different form of the conceptual role view to form a version of cognitivism with distinctive advantages (...) over other cognitivist views. Finally, it suggests that there's another way to think of the conceptual role view in metaethics is as opening up the space for a third way, beyond cognitivism and noncognitivism. (shrink)

According to the received view of scientific theories, a scientific theory is an axiomatic-deductive linguistic structure which must include some set of guidelines (“correspondence rules”) for interpreting its theoretical terms with reference to the world of observable phenomena. According to the semantic view, a scientific theory need not be formulated as an axiomatic-deductive structure with correspondence rules, but need only specify models which are said to be “isomorphic” with actual phenomenal systems. In this paper, I consider both the received (...) and semantic views as they bear on the issue of how a theory relates to the world (Section 1). Then I offer a critique of some arguments frequently put forth in support of the semantic view (Section 2). Finally, I suggest a more convincing “meta-methodological” argument (based on the thought of Bernard Lonergan) in favor of the semantic view (Section 3). (shrink)

http://www.diva-portal.org/mdh/theses/abstract.xsql?dbid=153.

In most accounts of realization of computational processes by physical mechanisms, it is presupposed that there is one-to-one correspondence between the causally active states of the physical process and the states of the computation. Yet such proposals either stipulate that only one model of computation is implemented, or they do not reflect upon the variety of models that could be implemented physically. In this paper, I claim that mechanistic accounts of computation should allow for a broad variation (...) of models of computation. In particular, some non-standard models should not be excluded a priori. The relationship between mathematical models of computation and mechanistically adequate models is studied in more detail. (shrink)

In most accounts of realization of computational processes by physical mechanisms, it is presupposed that there is one-to-one correspondence between the causally active states of the physical process and the states of the computation. Yet such proposals either stipulate that only one model of computation is implemented, or they do not reflect upon the variety of models that could be implemented physically. -/- In this paper, I claim that mechanistic accounts of computation should allow for a broad (...) variation of models of computation. In particular, some non-standard models should not be excluded a priori. The relationship between mathematical models of computation and mechanistically adequate models is studied in more detail. (shrink)

This essay is divided into two parts. In the first part (§2), I introduce the idea of practical meaning by looking at a certain kind of procedural systems — the motor system — that play a central role in computational explanations of motor behavior. I argue that in order to give a satisfactory account of the content of the representations computed by motor systems (motor commands), we need to appeal to a distinctively practical kind of meaning. Defending the explanatory (...) relevance of semantic properties in a computationalist explanation of motor behavior, my argument concludes that practical meanings play a central role in an adequate psychological theory of motor skill. In the second part of this essay (§3), I generalize and clarify the notion of practical meaning, and I defend the intelligibility of practical meanings against an important objection. (shrink)

The article investigates the significance of the so-called phenomenon of apparent faultless disagreement for debates about the semantics of taste discourse. Two kinds of description of the phenomenon are proposed. The first ensures that faultless disagreement raises a distinctive philosophical challenge; yet, it is argued that Contextualist, Realist and Relativist semantic theories do not account for this description. The second, by contrast, makes the phenomenon irrelevant for the problem of what the right semantics of taste discourse should be. (...) Lastly, the following dilemma is assessed: either faultless disagreement provides strong evidence against semantic theories; or its significance should be considerably downplayed. (shrink)

An argument map visually represents the structure of an argument, outlining its informal logical connections and informing judgments as to its worthiness. Argument mapping can be augmented with dedicated software that aids the mapping process. Empirical evidence suggests that semester‐length subjects using argument mapping along with dedicated software can produce remarkable increases in students’ critical thinking abilities. Introducing such specialised subjects, however, is often practically and politically difficult. This study ascertains student perceptions of the use of argument mapping in two (...) large, regular, semester‐length classes in a Business and Economics Faculty at the University of Melbourne. Unlike the semester‐length expert‐led trials in prior research, in our study only one expert‐led session was conducted at the beginning of the semester and followed by class practice. Survey results conducted at the end of the semester, show that, with reservations, even this minimalist, ‘one‐shot inoculation’ of argument mapping is effective in terms of students’ perceptions of improvements in their critical thinking skills. (shrink)

Bare plural generic sentences pervade ordinary talk. And yet it is extremely controversial what semantics to assign to such sentences. In this paper, I achieve two tasks. First, I develop a novel classification of the various standard uses to which bare plurals may be put. This “variety data” is important—it gives rise to much of the difficulty in systematically theorizing about bare plurals. Second, I develop a novel account of bare plurals, the radical account. On this account, (...) all bare plurals fail to express propositions. The content of a bare plural has to be pragmatically “completed” by a speaker in order for her to make an assertion. At least the content of a quantifier expression has to be supplied. But sometimes, the content of a sentential operator or modal verb is also supplied. The radical account straightforwardly explains the variety data: Speakers’ communicative intentions vary wildly across different contexts. (shrink)

On Kratzer’s canonical account, modal expressions (like “might” and “must”) are represented semantically as quantifiers over possibilities. Such expressions are themselves neutral; they make a single contribution to determining the propositions expressed across a wide range of uses. What modulates the modality of the proposition expressed—as bouletic, epistemic, deontic, etc.—is context.2 This ain’t the canon for nothing. Its power lies in its ability to figure in a simple and highly unified explanation of a fairly wide range of language use. (...) Recently, though, the canon’s neat story has come under attack. The challenge cases involve the epistemic use of a modal sentence for which no single resolution of the contextual parameter appears capable of accommodating all our intuitions.3 According to these revisionaries, such cases show that the canonical story needs to be amended in some way that makes multiple bodies of information relevant to the assessment of such statements. Here I show that how the right canonical, flexibly contextualist account of modals can accommodate the full range of challenge cases. The key will be to extend Kratzer’s formal semantic account with an account of how context selects values for a modal’s.. (shrink)

Starting from certain metalogical results, I argue that first-order logical truths of classical logic are a priori and necessary. Afterwards, I formulate two arguments for the idea that first-order logical truths are also analytic, namely, I first argue that there is a conceptual connection between aprioricity, necessity, and analyticity, such that aprioricity together with necessity entails analyticity; then, I argue that the structure of natural deduction systems for FOL displays the analyticity of its truths. Consequently, each philosophical approach to these (...) truths should account for this evidence, i.e., that first-order logical truths are a priori, necessary, and analytic, and it is my contention that the semantic account is a better candidate. (shrink)

In this paper, the role of the environment and physical embodiment of computational systems for explanatory purposes will be analyzed. In particular, the focus will be on cognitive computational systems, understood in terms of mechanisms that manipulate semantic information. It will be argued that the role of the environment has long been appreciated, in particular in the work of Herbert A. Simon, which has inspired the mechanistic view on explanation. From Simon’s perspective, the embodied view on cognition seems natural (...) but it is nowhere near as critical as its proponents suggest. The only point of difference between Simon and embodied cognition is the significance of body-based off-line cognition; however, it will be argued that it is notoriously over-appreciated in the current debate. The new mechanistic view on explanation suggests that even if it is critical to situate a mechanism in its environment and study its physical composition, or realization, it is also stressed that not all detail counts, and that some bodily features of cognitive systems should be left out from explanations. (shrink)

The article addresses the problem of how semantic information can be upgraded to knowledge. The introductory section explains the technical terminology and the relevant background. Section 2 argues that, for semantic information to be upgraded to knowledge, it is necessary and sufficient to be embedded in a network of questions and answers that correctly accounts for it. Section 3 shows that an information flow network of type A fulfils such a requirement, by warranting that the erotetic deficit, characterising (...) the target semantic information t by default, is correctly satisfied by the information flow of correct answers provided by an informational source s. Section 4 illustrates some of the major advantages of such a Network Theory of Account (NTA) and clears the ground of a few potential difficulties. Section 5 clarifies why NTA and an informational analysis of knowledge, according to which knowledge is accounted semantic information, is not subject to Gettier-type counterexamples. A concluding section briefly summarises the results obtained. (shrink)

We analyse Hutto & Myin's three arguments against computationalism [Hutto, D., E. Myin, A. Peeters, and F. Zahnoun. Forthcoming. “The Cognitive Basis of Computation: Putting Computation In Its Place.” In The Routledge Handbook of the Computational Mind, edited by M. Sprevak, and M. Colombo. London: Routledge.; Hutto, D., and E. Myin. 2012. Radicalizing Enactivism: Basic Minds Without Content. Cambridge, MA: MIT Press; Hutto, D., and E. Myin. 2017. Evolving Enactivism: Basic Minds Meet Content. Cambridge, MA: MIT Press]. The (...) Hard Problem of Content targets computationalism that relies on semantic notion of computation, claiming that it cannot account for the natural origins of content. The Intentionality Problem is targeted against computationalism using non-semantic accounts of computation, arguing that it fails in explaining intentionality. Theion Problem claims that causal interaction between concrete physical processes and abstract computational properties is problematic. We argue that these a... (shrink)

Objective. Conceptualization of the definition of space as a semantic unit of language consciousness. -/- Materials & Methods. A structural-ontological approach is used in the work, the methodology of which has been tested and applied in order to analyze the subject matter area of psychology, psycholinguistics and other social sciences, as well as in interdisciplinary studies of complex systems. Mathematical representations of space as a set of parallel series of events (Alexandrov) were used as the initial theoretical basis of (...) the structural-ontological analysis. In this case, understanding of an event was considered in the context of the definition adopted in computer science – a change in the object properties registered by the observer. -/- Results. The negative nature of space realizes itself in the subject-object structure, the components interaction of which is characterized by a change – a key property of the system under study. Observer’s registration of changes is accompanied by spatial focusing (situational concretization of the field of changes) and relating of its results with the field of potentially distinguishable changes (subjective knowledge about «changing world»). The indicated correlation performs the function of space identification in terms of recognizing its properties and their subjective significance, depending on the features of the observer`s motivational sphere. As a result, the correction of the actual affective dynamics of the observer is carried out, which structures the current perception of space according to principle of the semantic fractal. Fractalization is a formation of such a subjective perception of space, which supposes the establishment of semantic accordance between the situational field of changes, on the one hand, and the worldview, as well as the motivational characteristics of the observer, on the other. -/- Conclusions. Performed structural-ontological analysis of the system formed by the interaction of the perceptual function of the psyche and the semantic field of the language made it possible to conceptualize the space as a field of changes potentially distinguishable by the observer, structurally organized according to the principle of the semantic fractal. The compositional features of the fractalization process consist in fact that the semantic fractal of space is relevant to the product of the difference between the situational field of changes and the field of potentially distinguishable changes, adjusted by the current configuration of the observer`s value-needs hierarchy and reduced by his actual affective dynamics. (shrink)

In this paper I elaborate on previous criticisms of the influential Stalnakerian account of presuppositions, pointing out that the well-known practice of informative presupposition puts heavy strain on Stalnaker’s pragmatic characterization of the phenomenon of presupposition, in particular of the triggering of presuppositions. Stalnaker has replied to previous criticisms by relying on the well-taken point that we should take into account the time at which presupposition-requirements are to be computed. In defense of a different, ‘semantic’ account (...) of the phenomenon of presupposition, I argue that that point does not suffice to rescue the Stalnakerian proposal, and I portray Lewisian ‘accommodation’ as one way in which speakers adjust themselves to one another in the course of conversation. (shrink)

There are three main accounts of scientific progress: 1) the epistemic account, according to which an episode in science constitutes progress when there is an increase in knowledge; 2) the semantic account, according to which progress is made when the number of truths increases; 3) the problem-solving account, according to which progress is made when the number of problems that we are able to solve increases. Each of these accounts has received several criticisms in the last (...) decades. Nevertheless, some authors think that the epistemic account is to be preferred if one takes a realist stance. Recently, Dellsén proposed the noetic account, according to which an episode in science constitutes progress when scientists achieve increased understanding of a phenomenon. Dellsén claims that the noetic account is a more adequate realist account of scientific progress than the epistemic account. This paper aims precisely at assessing whether the noetic account is a more adequate realist account of progress than the epistemic account. (shrink)

Semantic information is usually supposed to satisfy the veridicality thesis: p qualifies as semantic information only if p is true. However, what it means for semantic information to be true is often left implicit, with correspondentist interpretations representing the most popular, default option. The article develops an alternative approach, namely a correctness theory of truth (CTT) for semantic information. This is meant as a contribution not only to the philosophy of information but also to the philosophical (...) debate on the nature of truth. After the introduction, in Sect. 2, semantic information is shown to be translatable into propositional semantic information (i). In Sect. 3, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in Sect. 4, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + A]. This completes the reduction of the truth of i to the correctness of A. In Sects. 5 and 6, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates Q by verifying and validating it (in the computer science’s sense of “verification” and “validation”); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of “proxy”) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of “commutation”); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. Sect. 7 provides some further clarifications about CTT, in the light of semantic paradoxes. Section 8 draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users. In the course of the article all technical expressions from computer science are explained. (shrink)

Igal Kvart A Coding Conception in Action-Directed-Pragmatics -/- I present formal Pragmatics for a domain in Pragmatics that I call Action-Directed Pragmatics, which focuses on the Pragmatic riddle of how implicit contents are conveyed and understood, by adopting a coding model, in which the speaker and addressee simulate each other iteratively in a deliberative context (an ‘action-pregnant’ one). The implicit content, conveyed by a speaker and decoded by her addressee, in such cases, consists in the specified steered-to action, plus modulations (...) on the action-polarity (pro or con) and the degree of the so-called Steering Thrust that accompanies such assertions and is conveyed by verbal locutions, intonation, and/or bodily and facial gestures. There are two main tasks to model (in a given setup and conversational context): First, how is the speaker, with a steered-to action in mind (and Steering Thrust), to select an assertion so as to (say) optimize the successful transmission and decoding of its implicit pragmatic content by her and her addressee? Second, how does the addressee, given an assertion by the speaker, decipher the implicit pragmatic content conveyed via it? Both will invoke pertinent information they have about each other and the setup/context in order to best encode and best decode the implicit pragmatic content. (This coding mechanism proposed here is not offered for the ubiquitous ‘frozen’, ‘trivial’ or ‘routinized’ pragmatic messages.) A prelude to this formal Pragmatics is a general formal Pragmatic account of Assertibility in contexts that are multi-normative (which is the common case). I focus here only on Epistemic/Semantic and Instrumental Norms. A linear representation of degrees of Overall Assertibility (i.e., taking into account various operative norms) will be an n-dimensional qualitative vector space with a function that computes them given different degrees of sub-normative Assertibility on each axis. (shrink)

At first sight the Theory of Computation i) relies on a kind of mathematics based on the notion of potential infinity; ii) its theoretical organization is irreducible to an axiomatic one; rather it is organized in order to solve a problem: “What is a computation?”; iii) it makes essential use of doubly negated propositions of non-classical logic, in particular in the word expressions of the Church-Turing’s thesis; iv) its arguments include ad absurdum proofs. Under such aspects, it is (...) like many other scientific theories, in particular the first theories of both mechanical machines and heat machines. A more accurate examination of Theory of Computation shows a difference from the above mentioned theories in its essentially including an odd notion, “thesis”, to which no theorem corresponds. On the other hand, arguments of each of the other theories conclude a doubly negative predicate which then, by applying the inverse translation of the ‘negative one’, is translated into the corresponding affirmative predicate. By also taking into account three criticisms to the current Theory of Computation a rational re-formulation of it is sketched out; to Turing-Church thesis of the usual theory corresponds a similar proposition, yet connecting physical total computation functions with constructive mathematical total computation functions. -/- . (shrink)

The paper investigates the ethics of information transparency (henceforth transparency). It argues that transparency is not an ethical principle in itself but a pro-ethical condition for enabling or impairing other ethical practices or principles. A new definition of transparency is offered in order to take into account the dynamics of information production and the differences between data and information. It is then argued that the proposed definition provides a better understanding of what sort of information should be disclosed and (...) what sort of information should be used in order to implement and make effective the ethical practices and principles to which an organisation is committed. The concepts of “heterogeneous organisation” and “autonomous computational artefact” are further defined in order to clarify the ethical implications of the technology used in implementing information transparency. It is argued that explicit ethical designs, which describe how ethical principles are embedded into the practice of software design, would represent valuable information that could be disclosed by organisations in order to support their ethical standing. (shrink)

Turner argues that computer programs must have purposes, that implementation is not a kind of semantics, and that computers might need to understand what they do. I respectfully disagree: Computer programs need not have purposes, implementation is a kind of semantic interpretation, and neither human computers nor computing machines need to understand what they do.

We offer a preliminary account of the information-based aspects of punctuation marks. We give our initial treatment within the Discourse Representation Theory and its segmented version. We hypothesize that this work will be useful in classifying the informational contributions of punctuation marks and bringing them to bear on the semantic characterization of written discourse.

According to the Computational/Representational Theory of Thought (CRTT ? Language of Thought Hypothesis, or LOTH), propositional attitudes, such as belief, desire, and the like, are triadic relations among subjects, propositions, and internal mental representations. These representations form a representational _system_ physically realized in the brain of sufficiently sophisticated cognitive organisms. Further, this system of representations has a combinatorial syntax and semantics, but the processes that operate on the representations are causally sensitive only to their syntax, not to their semantics. On (...) this approach, a first pass account of propositional attitudes is the following (cf. Field 1978: 37 and Fodor 1987: 17). (shrink)

Questions of privacy have become particularly salient in recent years due, in part, to information-gathering initiatives precipitated by the 2001 World Trade Center attacks, increasing power of surveillance and computing technologies, and massive data collection about individuals for commercial purposes. While privacy is not new to the philosophical and legal literature, there is much to say about the nature and value of privacy. My focus here is on the nature of informational privacy. I argue that the predominant accounts of privacy (...) are unsatisfactory and offer an alternative: for a person to have informational privacy is for there to be limits on the particularized judgments that others are able to reasonably make about that person. (shrink)

A graph-theoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as a multi-graph (m-graph) where the nodes and the m-edges include the sorts and the constructors of the signatures at hand. Fibring of two models is a multi-graph (m-graph) where the nodes and the m-edges are the values and the operations in the models, respectively. Fibring of two deductive systems (...) is an m-graph whose nodes are language expressions and the m-edges represent the inference rules of the two original systems. The sobriety of the approach is confirmed by proving that all the fibring notions are universal constructions. This graph-theoretic view is general enough to accommodate very different fibrings of propositional based logics encompassing logics with non-deterministic semantics, logics with an algebraic semantics, logics with partial semantics and substructural logics, among others. Soundness and weak completeness are proved to be preserved under very general conditions. Strong completeness is also shown to be preserved under tighter conditions. In this setting, the collapsing problem appearing in several combinations of logic systems can be avoided. (shrink)

This paper aims to establish several interconnected points. First, a particular interpretation of the mathematical definition of information, known as the causal interpretation, is supported largely by misunderstandings of the engineering context from which it was taken. A better interpretation, which makes the definition and quantification of information relative to the function of its user, is outlined. The first half of the paper is given over to introducing communication theory and its competing interpretations. The second half explores three consequences of (...) the main thesis. First, a popular claim that the quantification of information in a signal is irrelevant for the meaning of that signal is exposed as fallacious. Second, a popular distinction between causal and semantic information is shown to be misleading, and I argue it should be replaced with a related distinction between natural and intentional signs. Finally, I argue that recent empirical work from microbiology and cognitive science drawing on resources of mathematical communication theory is best interpreted by the functional account. Overall, a functional approach is shown to be both theoretically and empirically well-supported. (shrink)

Propositional attitude sentences, such as "John believes that snow is white," are traditionally taken to express the holding of a relation between a subject and what ‘that’-clauses like ‘that snow is white’ denote, i.e. propositions. On the traditional account, propositions are abstract, mind- and language-independent entities. Recently, some have raised some serious worries for the traditional account and thought that we were mistaken about the kind of entities propositions are. Over the last ten years there has then been (...) a boom of accounts of propositions in terms of mental acts. But Friederike Moltmann has recently suggested that in accounting for attitudes we should forget about mindand language-independent entities and acts and follow Twardowski in focusing instead on attitudinal objects, which are the products of our mental life. In this paper, I will focus on some semantic problems that any product-based account seems to face. Moreover, I will show that product-based accounts may be also criticised on ontological grounds. My conclusion will be that we lack a reason to think that in accounting for propositional attitudes we should focus on the alleged products of our mental lives. (shrink)

The relationship between abstract formal procedures and the activities of actual physical systems has proved to be surprisingly subtle and controversial, and there are a number of competing accounts of when a physical system can be properly said to implement a mathematical formalism and hence perform a computation. I defend an account wherein computational descriptions of physical systems are high-level normative interpretations motivated by our pragmatic concerns. Furthermore, the criteria of utility and success vary according to our diverse (...) purposes and pragmatic goals. Hence there is no independent or uniform fact to the matter, and I advance the ‘anti-realist’ conclusion that computational descriptions of physical systems are not founded upon deep ontological distinctions, but rather upon interest-relative human conventions. Hence physical computation is a ‘conventional’ rather than a ‘natural’ kind. (shrink)

Although the view that sees proper names as referential singular terms is widely considered orthodoxy, there is a growing popularity to the view that proper names are predicates. This is partly because the orthodoxy faces two anomalies that Predicativism can solve: on the one hand, proper names can have multiple bearers. But multiple bearerhood is a problem to the idea that proper names have just one individual as referent. On the other hand, as Burge noted, proper names can have predicative (...) uses. But the view that proper names are singular terms arguably does not have the resources to deal with Burge’s cases. In this paper I argue that the Predicate View of proper names is mistaken. I first argue against the syntactic evidence used to support the view and against the predicativist’s methodology of inferring a semantic account for proper names based on incomplete syntactic data. I also show that Predicativism can neither explain the behaviour of proper names in full generality, nor claim the fundamentality of predicative names. In developing my own view, however, I accept the insight that proper names in some sense express generality. Hence I propose that proper names—albeit fundamentally singular referential terms—express generality in two senses. First, by being used as predicates, since then they are true of many individuals; and second, by being referentially related to many individuals. I respond to the problem of multiple bearerhood by proposing that proper names are polyreferential, and also explain the behaviour of proper names in light of the wider phenomenon I called category change, and show how Polyreferentialism can account for all uses of proper names. (shrink)

In this paper, I explore a range of existent and possible ameliorative semantic theories of gender terms: invariantism, according to which gender terms are not context-sensitive, contextualism, according to which the meaning of gender terms is established in the context of use, and relativism, according to which the meaning of gender terms is established in the context of assessment. I show that none of these views is adequate with respect to the plight of trans people to use their term (...) of choice to self-identify and be referred to accordingly. I then consider an invariantist view based on self-identification and explore some of its challenges. (shrink)

The field of machine perception is based on standard informational and computational approaches to perception. But naturalistic informational theories are widely regarded as being inadequate, while purely syntactic computational approaches give no account of perceptual content. Thus there is a significant need for a novel, purely naturalistic perceptual theory not based on informational or computational concepts, which could provide a new paradigm for mechanistic perception. Now specifically evolutionary naturalistic approaches to perception have been—perhaps surprisingly—almost completely neglected for this purpose. (...) Arguably perceptual mechanisms enhance evolutionary fitness by facilitating sensorily mediated causal interactions between an organism Z and items X in its environment. A ‘reflexive’ theory of perception of this kind is outlined, according to which an organism Z perceives an item X just in case X causes a sensory organ zi of Z to cause Z to acquire a disposition toward the very same item X that caused the perception. The rest of the paper shows how an intuitively plausible account of mechanistic perception can be developed and defended in terms of the reflexive theory. Also, a compatibilist option is provided for those who wish to preserve a distinct informational concept of perception. (shrink)

Fictional and non-fictional texts rely on the same language to express their meaning; yet many philosophers in the analytic tradition would say, with reason, that fictional texts literally make no truth claims, or more modestly that the rhetorical and literary devices to which fiction and non-fiction writers alike have recourse are unconnected to truth or have no propositional content. These related views are associated with a doctrine in the philosophy of language, most notably advanced by the late Donald Davidson, which (...) holds that we understand the semantic structure of a language by applying to it a theory of truth, which involves discovering the truth conditions of its sentences. This approach to semantic theory raises several seemingly intractable problems, such as the problem of stating the meaning of non-declarative sentences, e.g. questions and imperatives. The chief aim of this paper will be to try to dispel these problems by suggesting an adjustment in Davidson’s account of the relation of truth to meaning, one which will also allow us to picture such troublesome linguistic items as metaphor within a semantic theory, and to expand the range of objects which can be brought into a general theory of meaning. (shrink)