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)

John Searle once said: "The Chinese room shows what we knew all along: syntax by itself is not sufficient for semantics. (Does anyone actually deny this point, I mean straight out? Is anyone actually willing to say, straight out, that they think that syntax, in the sense of formal symbols, is really the same as semantic content, in the sense of meanings, thought contents, understanding, etc.?)." I say: "Yes". Stuart C. Shapiro has said: "Does that make any sense? Yes: Everything (...) makes sense. The question is: What sense does it make?" This essay explores what sense it makes to say that syntax by itself is sufficient for semantics. (shrink)

The Computational Theory of Mind (CTM) holds that cognitive processes are essentially computational, and hence computation provides the scientific key to explaining mentality. The Representational Theory of Mind (RTM) holds that representational content is the key feature in distinguishing mental from non-mental systems. I argue that there is a deep incompatibility between these two theoretical frameworks, and that the acceptance of CTM provides strong grounds for rejecting RTM. The focal point of the incompatibility is the fact that representational content (...) is extrinsic to formal procedures as such, and the intended interpretation of syntax makes no difference to the execution of an algorithm. So the unique 'content' postulated by RTM is superfluous to the formal procedures of CTM. And once these procedures are implemented in a physical mechanism, it is exclusively the causal properties of the physical mechanism that are responsible for all aspects of the system's behaviour. So once again, postulated content is rendered superfluous. To the extent that semantic content may appear to play a role in behaviour, it must be syntactically encoded within the system, and just as in a standard computational artefact, so too with the human mind/brain - it's pure syntax all the way down to the level of physical implementation. Hence 'content' is at most a convenient meta-level gloss, projected from the outside by human theorists, which itself can play no role in cognitive processing. (shrink)

A computer can come to understand natural language the same way Helen Keller did: by using “syntactic semantics”—a theory of how syntax can suffice for semantics, i.e., how semantics for natural language can be provided by means of computational symbol manipulation. This essay considers real-life approximations of Chinese Rooms, focusing on Helen Keller’s experiences growing up deaf and blind, locked in a sort of Chinese Room yet learning how to communicate with the outside world. Using the SNePS computational knowledge-representation (...) system, the essay analyzes Keller’s belief that learning that “everything has a name” was the key to her success, enabling her to “partition” her mental concepts into mental representations of: words, objects, and the naming relations between them. It next looks at Herbert Terrace’s theory of naming, which is akin to Keller’s, and which only humans are supposed to be capable of. The essay suggests that computers at least, and perhaps non-human primates, are also capable of this kind of naming. (shrink)

A response to a recent critique by Cem Bozşahin of the theory of syntactic semantics as it applies to Helen Keller, and some applications of the theory to the philosophy of computer science.

We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path axioms, and for bi-intuitionistic logic. These logics do not have straightforward formalisations in the traditional Gentzen-style sequent calculus, but have all been shown to have cut-free nested sequent calculi. The proof of the interpolation theorem uses these calculi and is purely syntactic, without resorting to (...) embeddings, semantic arguments, or interpreted connectives external to the underlying logical language. A novel feature of our proof includes an orthogonality condition for defining duality between interpolants. (shrink)

The paper presents a paradoxical feature of computational systems that suggests that computationalism cannot explain symbol grounding. If the mind is a digital computer, as computationalism claims, then it can be computing either over meaningful symbols or over meaningless symbols. If it is computing over meaningful symbols its functioning presupposes the existence of meaningful symbols in the system, i.e. it implies semantic nativism. If the mind is computing over meaningless symbols, no intentional cognitive processes are available prior to symbol grounding. (...) In this case, no symbol grounding could take place since any grounding presupposes intentional cognitive processes. So, whether computing in the mind is over meaningless or over meaningful symbols, computationalism implies semantic nativism. (shrink)

Saul Kripke once noted that there is a tight connection between computation and de re knowledge of whatever the computation acts upon. For example, the Euclidean algorithm can produce knowledge of which number is the greatest common divisor of two numbers. Arguably, algorithms operate directly on syntactic items, such as strings, and on numbers and the like only via how the numbers are represented. So we broach matters of notation. The purpose of this article is to explore (...) the relationship between the notations acceptable for computation, the usual idealizations involved in theories of computability, flowing from Alan Turing’s monumental work, and de re propositional attitudes toward numbers and other mathematical objects. (shrink)

Sentences that are ungrammatical and yet intelligible are instances of what I call perfectly thinkable thoughts. I argue that the existence of perfectly thinkable thoughts is revealing in regard to the question of why syntactic islands should exist. If language is an instrument of thought as understood in the biolinguistics tradition, then a uniquely human subset of thoughts is generated in narrow syntax, which suggests that island constraints cannot be rooted in narrow syntax alone and thus must reflect interface (...) conditions imposed on the output of the computational system and its mapping to external systems. (shrink)

This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on classes given by universal and universal-existential sentences. In particular, we prove two amalgamation results using the technique of diagrams in the setting of structures valued on a finite MTL-algebra, from which analogues of the Łoś–Tarski and the Chang–Łoś–Suszko preservation theorems follow.

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)

Most formalisms for representing common-sense knowledge allow incomplete and potentially inconsistent information. When strong negation is also allowed, contradictory conclusions can arise. A criterion for deciding between them is needed. The aim of this paper is to investigate an inherent and autonomous comparison criterion, based on specificity as defined in [POO 85, SIM 92]. In contrast to other approaches, we consider not only defeasible, but also strict knowledge. Our criterion is context-sensitive, i. e., preference among defeasible rules is determined dynamically (...) during the dialectical analysis.We show how specificity can be defined in terms of two different approaches: activation sets and derivation trees. This allows us to get a syntactic criterion that can be implemented in a computationally attractive way. The resulting definitions may be applied in general rulebased formalisms. We present theorems linking both characterizations. Finally we discuss other frameworks for defeasible reasoning in which preference handling is considered explicitly. (shrink)

In this paper, I argue for a modified version of what Devitt calls the Representational Thesis. According to RT, syntactic rules or principles are psychologically real, in the sense that they are represented in the mind/brain of every linguistically competent speaker/hearer. I present a range of behavioral and neurophysiological evidence for the claim that the human sentence processing mechanism constructs mental representations of the syntactic properties of linguistic stimuli. I then survey a range of psychologically plausible computational models (...) of comprehension and show that they are all committed to RT. I go on to sketch a framework for thinking about the nature of the representations involved in sentence processing. My claim is that these are best characterized not as propositional attitudes but, rather, as subpersonal states whose representational properties are determined by their functional role. Finally, I distinguish between explicit and implicit representations and argue that the latter can be drawn on as data by the algorithms that constitute our sentence processing routines. I conclude that skepticism concerning the psychological reality of grammars cannot be sustained. (shrink)

A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL$^{*}$ into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL$^{*}$-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive medium (...) for reasoning about branching time. (shrink)

The ambition of this paper is extensive: to bring about a new paradigm and firm mathematical foundations to Metaphysics, to aid its progress from the realm of mystical speculation to the realm of scientific scrutiny. -/- More precisely, this paper aims to introduce the field of Metaphysical Cosmology. The Metaphysical Cosmos here refers to the complete structure containing all entities, both existent and non-existent, with the physical universe as a subset. Through this paradigm, future endeavours in Metaphysical Science could thus (...) analyse non-physical parts of the Metaphysical Cosmos. New logical notions are displayed as tools for Metaphysical Cosmology, such as a Metric-Space-based predicate system, as well as a revised version of the Existential Quantifier. -/- A type system is presented to derive a construction of the Metaphysical Cosmos. The system is structured through semantic and syntactic definitions in a coherent way and holds only one proper axiom: the existence of (at least) one entity. This paper itself serves as an empirical proof for this axiom. Formulae and equations that depict a clear logical and mathematical structure of the Metaphysical Cosmos are derived from the definitions of the system and this axiom. -/- This culminates in the "Sixth Theorem", whose proof displays logically that there must be something rather than nothing. A computational simulation of the Sixth Theorem is also provided, alongside with methods for a future Metaphysical Science. Thus, this paper does not aim to provide a traditional philosophical argument but rather a mathematical foundation and new paradigm for the science of Metaphysics. (shrink)

This essay examines the possibility that phenomenological laws might be implemented by a computational mechanism by carefully analyzing key passages from the Prolegomena to Pure Logic. Part I examines the famous Denkmaschine passage as evidence for the view that intuitions of evidence are causally produced by computational means. Part II connects the less famous criticism of Avenarius & Mach on thought-economy with Husserl's 1891 essay 'On the Logic of Signs (Semiotic).' Husserl is shown to reaffirm his earlier opposition to associationist (...) (Humean) and adaptationist (Darwinian) explanations of our thought-machine on the ground that they cannot reconstruct the notion of truth and its syntactic mental preservation in symbolic thought-trains. Part III reveals Husserl's interesting commitment to the idea that descriptive sciences necessarily transform into explanatory sciences on pain of contradicting the essence of science as a rational ideal. Since explanation in relation to phenomenology means causal explanation, and causal explanation in the form of the Denkmaschine accounts for phenomenological intuition, it is inferred that the rationally compelling ideal of explanatory science requires a computationalist reading of the subsequent logical investigations. (shrink)

According to the computational theory of mind , to think is to compute. But what is meant by the word 'compute'? The generally given answer is this: Every case of computing is a case of manipulating symbols, but not vice versa - a manipulation of symbols must be driven exclusively by the formal properties of those symbols if it is qualify as a computation. In this paper, I will present the following argument. Words like 'form' and 'formal' are ambiguous, (...) as they can refer to form in either the syntactic or the morphological sense. CTM fails on each disambiguation, and the arguments for CTM immediately cease to be compelling once we register that ambiguity. The terms 'mechanical' and 'automatic' are comparably ambiguous. Once these ambiguities are exposed, it turns out that there is no possibility of mechanizing thought, even if we confine ourselves to domains where all problems can be settled through decision-procedures. The impossibility of mechanizing thought thus has nothing to do with recherché mathematical theorems, such as those proven by Gödel and Rosser. A related point is that CTM involves, and is guilty of reinforcing, a misunderstanding of the concept of an algorithm. (shrink)

Floridi and Taddeo propose a condition of “zero semantic commitment” for solutions to the grounding problem, and a solution to it. I argue briefly that their condition cannot be fulfilled, not even by their own solution. After a look at Luc Steels' very different competing suggestion, I suggest that we need to re-think what the problem is and what role the ‘goals’ in a system play in formulating the problem. On the basis of a proper understanding of computing, I come (...) to the conclusion that the only sensible ground-ing problem is how we can explain and re-produce the behavioral ability and function of meaning in artificial computational agents. (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)

The theoretical underpinnings and practical worth of content-based, intentional, or "folk" psychology have been challenged by three distinct groups of philosophical critics in the past 15 years or so. The first group, comprised by Hilary Putnam, Tyler Burge, and other advocates of "wide" or "externalist" theories of meaning, claims that traditional psychologists have been mistaken in assuming that our beliefs, desires, and other content-laden states supervene on or inhere in our individual minds or brains. The other two groups are both (...) "eliminative materialists," who charge that the intentional approach is inadequate and that it can or will be replaced by a completely non-interpretive discipline: either neuropsychology, in the view of Patricia and Paul Churchland, or a strictly syntactic computational psychology, according to Stephen Stich. ;This dissertation defends "notional world" or narrow intentional psychology against these charges, primarily on the strength of its practical merits, in contrast to the limitations and adverse effects of the proposed alternatives. Psychology is at least partly an applied science with a mandate to help understand and treat concrete psychological problems such as Post Traumatic Stress Disorder and depression, I argue, so any theorist who proposes to reconfigure or phase out existing approaches must be prepared to take over these duties with at least equal facility. However, whereas various "narrow" schools of psychotherapy such as Cognitive Therapy are fairly successful in this regard and show every indication of continuing to be needed for the foreseeable future, the Syntactic Theory seems to show very poor promise of being able to help relieve the distress of people with psychological disturbances, while a purely neurobiological approach is inappropriate in many cases, and tends to cause a variety of untoward and dangerous side-effects. As for the "wide" theorists with their emphasis upon the social and environmental contributions to meaning: they must acknowledge that a good deal of content is in the head; and, more importantly, by focusing on the role of the "experts" in a society's language-game, they miss the whole point of a psychological attribution, which is to understand an individual's reasons--however idiosyncratic--for acting as he or she does. (shrink)

I want to suggest that the major influence of classical arguments for embodiment like "The Embodied Mind" by Varela, Thomson & Rosch (1991) has been a changing of positions rather than a refutation: Cognitivism has found ways to retreat and regroup at positions that have better fortification, especially when it concerns theses about artificial intelligence or artificial cognitive systems. For example: a) Agent-based cognitivism' that understands humans as taking in representations of the world, doing rule-based processing and then acting on (...) them (sense-plan-act) is often limited to conscious decision processes; and b) Purely syntactic cognition is compatible with embodiment, or supplemented by embodiment (e.g. for 'grounding'). While the empirical thesis of embodied cognition ('embodied cognitive science') is true and the practical engineering thesis ('morphological computation', 'cheap design') is often true, the conceptual thesis ('embodiment is necessary for cognition') is likely false - syntax is often enough for cognition, unless grounding is really necessary. I conclude that it has become more sensible to integrate embodiment with traditional approaches rather than "fight for embodiment" or "against cognitivism". (shrink)

The standard view of classical cognitive science stated that cognition consists in the manipulation of language-like structures according to formal rules. Since cognition is ‘linguistic’ in itself, according to this view language is just a complex communication system and does not influence cognitive processes in any substantial way. This view has been criticized from several perspectives and a new framework (Embodied Cognition) has emerged that considers cognitive processes as non-symbolic and heavily dependent on the dynamical interactions between the cognitive system (...) and its environment. But notwithstanding the successes of the embodied cognitive science in explaining low-level cognitive behaviors, it is still not clear whether and how it can scale up for explaining high-level cognition. In this paper we argue that this can be done by considering the role of language as a cognitive tool: i.e. how language transforms basic cognitive functions in the high-level functions that are characteristic of human cognition. In order to do that, we review some computational models that substantiate this view with respect to categorization and memory. Since these models are based on a very rudimentary form of non-syntactic ‘language’ we argue that the use of language as a cognitive tool might have been an early discovery in hominid evolution, and might have played a substantial role in the evolution of language itself. (shrink)

Ways of Scope Taking is concerned with syntactic, semantic and computational aspects of scope. Its starting point is the well-known but often neglected fact that different types of quantifiers interact differently with each other and other operators. The theoretical examination of significant bodies of data, both old and novel, leads to two central claims. (1) Scope is a by-product of a set of distinct Logical Form processes; each quantifier participates in those that suit its particular features. (2) Scope interaction (...) is further constrained by the semantics of the interacting operators. The arguments are developed using Minimalist syntax, Generalized Quantify theory, Discourse Representation Theory, and algebraic semantics. The contributors (Beghelli, Ben-Shalom, Doetjes, Farkas, Gutiérrez Rexach, Honcoop, Stabler, Stowell, Szabolcsi and Zwarts) make tightly related theoretical assumptions and focus on related empirical phenomena, which include the direct and inverse scope of quantifiers, distributivity, negation, modal and intensional contexts, weak islands, event-related readings, interrogatives, wh/quantifier interactions, and Hungarian syntax. An introduction to the formal semantics background is provided. Audience: Linguists, philosophers, computational and psycholinguists; advanced undergraduates, graduate students and researchers in these fields. (shrink)

In this paper we suggest a clarification in relation to the notions of computational and intrinsic emergence, by showing how the latter is deeply connected to the new Logical Openness Theory, an original extension of Gödel theorems to the model theory. The epistemological scenario we are going to make use of is that of the theory of vision, a particularly instructive one. In order to reach our goal we introduce a dynamic theory of relationship between the observer and the observed (...) which takes into account the co-adaptive processes as well as the ecological nature of the mind/world relations. In order to fulfill the requirements of complexity sciences, this theory assumes that the scientific activity has to be able to comprehend the adaptive dynamics between system and environment as well as the model and the context where it is applied. This leads to an adaptive epistemology based on logical openness which overcomes the thigh corners of both naïve objectivist conception and radical relativism temptations by stressing that the knowledge building is a process of continuous shifting from the “frozen” syntactical dimensions to the plurality choices which make possible for mind and world to meet each other. (shrink)

I critically examine some provocative arguments that John Searle presents in his book The Rediscovery of Mind to support the claim that the syntactic states of a classical computational system are "observer relative" or "mind dependent" or otherwise less than fully and objectively real. I begin by explaining how this claim differs from Searle's earlier and more well-known claim that the physical states of a machine, including the syntactic states, are insufficient to determine its semantics. In contrast, his (...) more recent claim concerns the syntax, in particular, whether a machine actually has symbols to underlie its semantics. I then present and respond to a number of arguments that Searle offers to support this claim, including whether machine symbols are observer relative because the assignment of syntax is arbitrary, or linked to universal realizability, or linked to the sub-personal interpretive acts of a homunculus, or linked to a person's consciousness. I conclude that a realist about the computational model need not be troubled by such arguments. Their key premises need further support. (shrink)

Natural recursion in syntax is recursion by linguistic value, which is not syntactic in nature but semantic. Syntax-specific recursion is not recursion by name as the term is understood in theoretical computer science. Recursion by name is probably not natural because of its infinite typeability. Natural recursion, or recursion by value, is not species-specific. Human recursion is not syntax-specific. The values on which it operates are most likely domain-specific, including those for syntax. Syntax seems to require no more (and (...) no less) than the resource management mechanisms of an embedded push-down automaton (EPDA). We can conceive EPDA as a common automata-theoretic substrate for syntax, collaborative planning, i-intentions, and we-intentions. They manifest the same kind of dependencies. Therefore, syntactic uniqueness arguments for human behavior can be better explained if we conceive automata-constrained recursion as the most unique human capacity for cognitive processes. (shrink)

In the first part of this investigation we highlight two, seemingly irreconcilable, beliefs that suggest an impending crisis in the teaching, research, and practice of—primarily state-supported—mathematics: (a) the belief, with increasing, essentially faith-based, conviction and authority amongst academics that first-order Set Theory can be treated as the lingua franca of mathematics, since its theorems—even if unfalsifiable—can be treated as ‘knowledge’ because they are finite proof sequences which are entailed finitarily by self-evidently Justified True Beliefs; and (b) the slowly emerging, but (...) powerfully rooted in economic imperatives, belief that only those Justified True Beliefs can be treated as ‘knowledge’ which are, further, categorically communicable as Factually Grounded Beliefs—hence as comprehensible pre-formal ‘mathematical truths’—by any intelligence that lays claims to a mathematical lingua franca. We argue that this seeming irreconcilability merely reflects a widening chasm between an increasing under-estimation of the value to society of ‘semantic arithmetical truth’, and an increasing over-estimation of the value to society of ‘syntactic set-theoretical provability’; a chasm which must be narrowed and bridged explicitly. We thus proffer a Complementarity Thesis which seeks to recognize that mathematical ‘provability’ and mathematical ‘truth’ need to be interdependent and complementary, ‘evidence-based’, assignments-by-convention to the formulas of a formal mathematical language; where (a) the goal of mathematical ‘proofs’ may be viewed as seeking to ensure that any mathematical language intended to formally represent our pre-formal conceptual metaphors and their inter-relatedness is unambiguous, and free from contradiction; whilst (b) the goal of mathematical ‘truths’ must be viewed as seeking to ensure that any such representation does, indeed, uniquely identify and adequately represent such metaphors and their inter-relatedness. Our thesis is that, by universally ignoring the need to introduce goal (b) in our curriculum, the teaching of, and research in, mathematics at the post-graduate level cannnot justify its value to society beyond the mere intellectual stimulation of individual minds. In the second part we appeal to some recent—and hitherto unsuspected—unarguably constructive Tarskian interpretations, of the first-order Peano Arithmetic PA, which establish PA as both finitarily consistent, and categorical. Since we also show that the second order subsystem ACA0 of Peano Arithmetic and PA cannot both be assumed provably consistent, we conclude that there can be no mathematical, or meta-mathematical, proof of consistency for Set Theory. Hence the theorems of any Set Theory are not sufficient for distinguishing between (i) what we can believe to be a ‘mathematical truth’; (ii) what we can evidence as a ‘mathematical truth’; and (iii) what we ought not to believe is a ‘mathematical truth’; whilst the theorems of the first-order Peano Arithmetic PA are sufficient for distinguishing between (i), (ii) and (iii). We conclude from this that the holy grail of mathematics ought to be ‘arithmetical truth’, not ‘set-theoretical proof’. (shrink)

Health Level 7 (HL7) is an international standards development organisation in the domain of healthcare information technology. Initially the mission of HL7 was to enable data exchange via the creation of syntactic standards which supported point-to-point messaging. Currently HL7 sees its mission as one of creating standards for semantic interoperability in healthcare IT on the basis of its flagship “version 3” (v3). Unfortunately, v3 has been plagued by quality and consistency issues, and it has not been able to keep (...) pace with recent developments either in semantics and ontology or in computer science and engineering. HL7’s response has been to develop its “Services-Aware Interoperability Framework” (SAIF), which is intended to provide a foundation for work on all aspects of standardization in HL7 henceforth. We here summarise the major design principles that must be satisfied by a semantic interoperability framework – principles relating both to static semantics and to computational behaviour. We then assess the SAIF in light of these principles. We conclude that the SAIF is not in a position to support the needed reform of the HL7 v3 family of standards. (shrink)

It is commonly assumed that images, whether in the world or in the head, do not have a privileged analysis into constituent parts. They are thought to lack the sort of syntactic structure necessary for representing complex contents and entering into sophisticated patterns of inference. I reject this assumption. “Image grammars” are models in computer vision that articulate systematic principles governing the form and content of images. These models are empirically credible and can be construed as literal grammars for (...) images. Images can have rich syntactic structure, though of a markedly different form than sentences in language. (shrink)

This paper presents an attempt to bridge the gap between logical and cognitive treatments of strategic reasoning in games. There have been extensive formal debates about the merits of the principle of backward induction among game theorists and logicians. Experimental economists and psychologists have shown that human subjects, perhaps due to their bounded resources, do not always follow the backward induction strategy, leading to unexpected outcomes. Recently, based on an eye-tracking study, it has turned out that even human subjects who (...) produce the outwardly correct ‘backward induction answer’ use a different internal reasoning strategy to achieve it. The paper presents a formal language to represent different strategies on a finer-grained level than was possible before. The language and its semantics help to precisely distinguish different cognitive reasoning strategies, that can then be tested on the basis of computational cognitive models and experiments with human subjects. The syntactic framework of the formal system provides a generic way of constructing computational cognitive models of the participants of the Marble Drop game. (shrink)

When reusing existing ontologies for publishing a dataset in RDF (or developing a new ontology), preference may be given to those providing extensive subcategorization for important classes (denoted as focus classes). The subcategories may consist not only of named classes but also of compound class expressions. We define the notion of focused categorization power of a given ontology, with respect to a focus class and a concept expression language, as the (estimated) weighted count of the categories that can be built (...) from the ontology’s signature, conform to the language, and are subsumed by the focus class. For the sake of tractable initial experiments we then formulate a restricted concept expression language based on existential restrictions, and heuristically map it to syntactic patterns over ontology axioms (so-called FCE patterns). The characteristics of the chosen concept expression language and associated FCE patterns are investigated using three different empirical sources derived from ontology collections: first, the concept expression pattern frequency in class definitions; second, the occurrence of FCE patterns in the Tbox of ontologies; and last, for class expressions generated from the Tbox of ontologies (through the FCE patterns); their ‘meaningfulness’ was assessed by different groups of users, yielding a ‘quality ordering’ of the concept expression patterns. The complementary analyses are then compared and summarized. To allow for further experimentation, a web-based prototype was also implemented, which covers the whole process of ontology reuse from keyword-based ontology search through the FCP computation to the selection of ontologies and their enrichment with new concepts built from compound expressions. (shrink)

In this article, I argue that if tacit knowledge of grammar is analyzable in functional‐computational terms, then it cannot ground linguistic meaning, structure, or sound. If to know or cognize a grammar is to be in a certain computational state playing a certain functional role, there can be no unique grammar cognized. Satisfying the functional conditions for cognizing a grammar G entails satisfying those for cognizing many grammars disagreeing with G about expressions' semantic, phonetic, and syntactic values. This threatens (...) the Chomskyan view that expressions have such values for speakers because they cognize grammars assigning them those values. For if this is true, semantics, syntax, and phonology must be indeterminate, thanks to the indeterminacy of grammar‐cognizing (qua functional‐computational state). So, the fact that a speaker cognizes a grammar cannot explain the determinate character of their language. (shrink)

How does one formalize the structure of structures necessary for the foundations of physics? This work is an attempt at conceptualizing the metaphysics of pregeometric structures, upon which new and existing notions of quantum geometry may find a foundation. We discuss the philosophy of pregeometric structures due to Wheeler, Leibniz as well as modern manifestations in topos theory. We draw attention to evidence suggesting that the framework of formal language, in particular, homotopy type theory, provides the conceptual building blocks for (...) a theory of pregeometry. This work is largely a synthesis of ideas that serve as a precursor for conceptualizing the notion of space in physical theories. In particular, the approach we espouse is based on a constructivist philosophy, wherein ``structureless structures'' are syntactic types realizing formal proofs and programs. Spaces and algebras relevant to physical theories are modeled as type-theoretic routines constructed from compositional rules of a formal language. This offers the remarkable possibility of taxonomizing distinct notions of geometry using a common theoretical framework. In particular, this perspective addresses the crucial issue of how spatiality may be realized in models that link formal computation to physics, such as the Wolfram model. (shrink)

Investigation into the sequence structure of the genetic code by means of an informatic approach is a real success story. The features of human language are also the object of investigation within the realm of formal language theories. They focus on the common rules of a universal grammar that lies behind all languages and determine generation of syntactic structures. This universal grammar is a depiction of material reality, i.e., the hidden logical order of things and its relations determined by (...) natural laws. Therefore mathematics is viewed not only as an appropriate tool to investigate human language and genetic code structures through computer sciencebased formal language theory but is itself a depiction of material reality. This confusion between language as a scientific tool to describe observations/experiences within cognitive constructed models and formal language as a direct depiction of material reality occurs not only in current approaches but was the central focus of the philosophy of science debate in the twentieth century, with rather unexpected results. This article recalls these results and their implications for more recent mathematical approaches that also attempt to explain the evolution of human language. (shrink)

There is much discussion about whether the human mind is a computer, whether the human brain could be emulated on a computer, and whether at all physical entities are computers (pancomputationalism). These discussions, and others, require criteria for what is digital. I propose that a state is digital if and only if it is a token of a type that serves a particular function - typically a representational function for the system. This proposal is made on a syntactic level, (...) assuming three levels of description (physical, syntactic, semantic). It suggests that being digital is a matter of discovery or rather a matter of how we wish to describe the world, if a functional description can be assumed. Given the criterion provided and the necessary empirical research, we should be in a position to decide on a given system (e.g. the human brain) whether it is a digital system and can thus be reproduced in a different digital system (since digital systems allow multiple realization). (shrink)

A comprehensive introduction to the Language of Though Hypothesis (LOTH) accessible to general audiences. LOTH is an empirical thesis about thought and thinking. For their explication, it postulates a physically realized system of representations that have a combinatorial syntax (and semantics) such that operations on representations are causally sensitive only to the syntactic properties of representations. According to LOTH, thought is, roughly, the tokening of a representation that has a syntactic (constituent) structure with an appropriate semantics. Thinking thus (...) consists in syntactic operations defined over representations. Most of the arguments for LOTH derive their strength from their ability to explain certain empirical phenomena like productivity, systematicity of thought and thinking. (shrink)

This paper argues that many so-called digital technologies can be construed as notational technologies, explored through the example of Monegraph, an art and digital asset management platform built on top of the blockchain system originally developed for the cryptocurrency bitcoin. As the paper characterizes it, a notational technology is the performance of syntactic notation within a field of reference, a technologized version of what Nelson Goodman called a “notational system.” Notational technologies produce abstracted entities through positive and reliable, or (...) constitutive, tests of socially acceptable meaning. Accordingly, this account deviates from typical narratives of blockchains, instead demonstrating that blockchain technologies are effective at managing digital assets because they produce abstracted identities through the performance of notation. Since notational technologies rely on configurations of socially acceptable meaning, this paper also provides a philosophical account of how blockchain technologies are socially embedded. (shrink)

Much problem solving and learning research in math and science has focused on formal representations. Recently researchers have documented the use of unschooled strategies for solving daily problems -- informal strategies which can be as effective, and sometimes as sophisticated, as school-taught formalisms. Our research focuses on how formal and informal strategies interact in the process of doing and learning mathematics. We found that combining informal and formal strategies is more effective than single strategies. We provide a theoretical account of (...) this multiple strategy effect and have begun to formulate this theory in an ACT-R computer model. We show why students may reach common impasses in the use of written algebra, and how subsequent or concurrent use of informal strategies leads to better problem-solving performance. Formal strategies facilitate computation because of their abstract and syntactic nature; however, abstraction can lead to nonsensical interpretations and conceptual errors. Reapplying the formal strategy will not repair such errors; switching to an informal one may. We explain the multiple strategy effect as a complementary relationship between the computational efficiency of formal strategies and the sense-making function of informal strategies. (shrink)

Here, by introducing a version of “Unexpected hanging paradox” first we try to open a new way and a new explanation for paradoxes, similar to liar paradox. Also, we will show that we have a semantic situation which no syntactical logical system could support it. Finally, we propose a claim in Theory of Computation about the consistency of this Theory. One of the major claim is:Theory of Computation and Classical Logic leads us to a contradiction.

As a philosophical paradigm, differential heterogenesis offers us a novel descriptive vantage with which to inscribe Deleuze’s virtuality within the terrain of “differential becoming,” conjugating “pure saliences” so as to parse economies, microhistories, insurgencies, and epistemological evolutionary processes that can be conceived of independently from their representational form. Unlike Gestalt theory’s oppositional constructions, the advantage of this aperture is that it posits a dynamic context to both media and its analysis, rendering them functionally tractable and set in relation to other (...) objects, rather than as sedentary identities. Surveying the genealogy of differential heterogenesis with particular interest in the legacy of Lautman’s dialectic, I make the case for a reading of the Deleuzean virtual that departs from an event-oriented approach, galvanizing Sarti and Citti’s dynamic a priori vis-à-vis Deleuze’s philosophy of difference. Specifically, I posit differential heterogenesis as frame with which to examine our contemporaneous epistemic shift as it relates to multi-scalar computational modeling while paying particular attention to neuro-inferential modes of inductive learning and homologous cognitive architecture. Carving a bricolage between Mark Wilson’s work on the “greediness of scales” and Deleuze’s “scales of reality”, this project threads between static ecologies and active externalism vis-à-vis endocentric frames of reference and syntactical scaffolding. (shrink)

In a previous work we introduced the algorithm \SQEMA\ for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general correspondence and canonical completeness result. \SQEMA\ is based on transformation rules, the most important of which employs a modal version of a result by Ackermann that enables elimination of an existentially quantified predicate variable in a formula, provided a certain negative polarity condition on that variable is satisfied. In this paper we develop several extensions of (...) \SQEMA\ where that syntactic condition is replaced by a semantic one, viz. downward monotonicity. For the first, and most general, extension \SSQEMA\ we prove correctness for a large class of modal formulae containing an extension of the Sahlqvist formulae, defined by replacing polarity with monotonicity. By employing a special modal version of Lyndon's monotonicity theorem and imposing additional requirements on the Ackermann rule we obtain restricted versions of \SSQEMA\ which guarantee canonicity, too. (shrink)

Viewed in the light of the remarkable performance of ‘Watson’ - IBMs proprietary artificial intelligence computer system capable of answering questions posed in natural language - on the US general knowledge quiz show ‘Jeopardy’, we review two experiments on formal systems - one in the domain of quantum physics, the other involving a pictographic languaging game - whereby behaviour seemingly characteristic of domain understanding is generated by the mere mechanical application of simple rules. By re-examining both experiments in the context (...) of Searle’s Chinese Room Argument, we suggest their results merely endorse Searle’s core intuition: that ‘syntactical manipulation of symbols is not sufficient for semantics’. Although, pace Watson, some artificial intelligence practitioners have suggested that more complex, higher-level operations on formal symbols are required to instantiate understanding in computational systems, we show that even high-level calls to Google translate would not enable a computer qua ‘formal symbol processor’ to understand the language it processes. We thus conclude that even the most recent developments in ‘quantum linguistics’ will not enable computational systems to genuinely understand natural language. (shrink)

Upon what philosophical foundation are semantic network graphs based? Does this foundation allow for the legitimization of other semantic networks and ontological diversity? How can we design our computational and informational systems to accommodate this ontological diversity and the variety of semantic networks? Are semantic networks segmentations of larger semantic landscapes? This paper explores semantic networks from a Heideggerian existentialist and phenomenological perspective. The analysis presented uses cultural schema theory to bridge the syntactic and lexical elements to the semantic (...) and conceptual dimensions of semantic network graphs and offers reasons why the viability of such graphs as they are currently constructed are insufficient for creating semantic interoperability for our informationtechnologies. Reconceptualizing semantic networks as cultural landscapes offers us. (shrink)

Quantification, Negation, and Focus: Challenges at the Conceptual-Intentional Semantic Interface Tista Bagchi National Institute of Science, Technology, and Development Studies (NISTADS) and the University of Delhi Since the proposal of Logical Form (LF) was put forward by Robert May in his 1977 MIT doctoral dissertation and was subsequently adopted into the overall architecture of language as conceived under Government-Binding Theory (Chomsky 1981), there has been a steady research effort to determine the nature of LF in language in light of structurally (...) diverse languages around the world, which has ultimately contributed to the reinterpretation of LF as a Conceptual-Intentional (C-I) interface level between the computational syntactic component of the faculty of language and one or more interpretive faculties of the human mind. While this has opened up further possibilities of research in phenomena such as quantifier scope and scope interactions between negation, quantification, and focus, it has also given rise to a few real challenges to linguistic theory as well. Some of these are: (i) the split between lexical meaning – a matter supposedly belonging to the phase-wise selection of lexical arrays – and issues of semantic interpretation that arise purely from binding and scope phenomena (Mukherji 2010); (ii) partially relatedly, the level at which theta role assignment can be argued to take place, an issue that is taken up by me in Bagchi (2007); and (iii) how supposedly “pure” scopal phenomena relating to quantifiers, negation, and emphasizing expressions such as only and even (comparable to, e.g., Urdu/Hindi hii and bhii, Bangla –i and –o) also have dimensions of both focus and discourse reference. While recognizing all of these challenges, this talk aims to highlight particularly challenge (iii), both in terms of scholarship in the past and for the rich prospects for research on languages of south Asia with the semantics of quantification, negation, and focus in view. The scholarship of the past that I seek to relate this issue to is where, parallel to (and largely independently of) the research on LF that had been happening, Barwise and Cooper were developing their influential view of noun phrases as generalized quantifiers, culminating in their key 1981 article “Generalized Quantifiers and Natural Language” while, independently, McCawley, in his 1981 book Everything that Linguists have Always Wanted to Know about Logic, established through argumentation that all noun phrases semantically behave like generalized quantified expressions (further elaborated by him in the second – 1994 – revised edition of his book). I seek to demonstrate, based on limited data analysis from selected languages of south Asia, that our current understanding of quantification, negation, and focus under the Minimalist view owes something significant to the two major, but now largely marginalized, works of scholarship, and that for the way forward it is essential to adopt a more formal-semantic approach as adopted by them and also by later works such as Denis Bouchard’s (1995) The Semantics of Syntax, Mats Rooth’s work on focus (e.g., Rooth 1996, “Focus” in Shalom Lappin’s Handbook of Contemporary Semantic Theory), Heim and Kratzer’s Semantics in Generative Grammar (1998), and Yoad Winter’s (2002) Linguistic Inquiry article on semantic number, to cite just a few instances. (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)

This thesis considers the following problem: What methods should the epistemology of science use to gain insight into the structure and behaviour of scientific knowledge and method in actual scientific practice? After arguing that the elucidation of epistemological and methodological phenomena in science requires a method that is rooted in formal methods, I consider two alternative methods for epistemology of science. One approach is the classical approaches of the syntactic and semantic views of theories. I show that typical approaches (...) of this sort are inadequate and inaccurate in their representation of scientific knowledge by showing how they fail to account for and misrepresent important epistemological structure and behaviour in science. The other method for epistemology of science I consider is modeled on the methods used to construct valid models of natural phenomena in applied mathematics. This new epistemological method is itself a modeling method that is developed through the detailed consideration of two main examples of theory application in science: double pendulum systems and the modeling of near-Earth objects to compute probability of future Earth impact. I show that not only does this new method accurately represent actual methods used to apply theories in applied mathematics, it also reveals interesting structural and behavioural patterns in the application process and gives insight into what underlies the stability of methods of application. I therefore conclude that for epistemology of science to develop fully as a scientific discipline it must use methods from applied mathematics, not only methods from pure mathematics and metamathematics as traditional formal epistemology of science has done. (shrink)

We describe (essential features and an axiomatization of) a new metamathematical (cognitive) ability, i.e., functional conceptual substratum, used implicitly in the generation of several mathematical proofs and definitions, and playing a fundamental role in Artificial Mathematical Intelligence (or Cognitive-computational metamathematics). Furthermore, we present an initial (first-order) formalization of this mechanism together with its characterizing relation with classic notions like primitive positive definability and Diophantiveness. Additionally, we analyze the semantic variability of functional conceptual substratum when small syntactic modifications are done. (...) Finally, we describe cognitively natural inference rules for (mathematical) definitions inspired by functional conceptual substratum and we show that they are sound and complete w.r.t.\ standard calculi. (shrink)

As historically acknowledged in the Reasoning about Actions and Change community, intuitiveness of a logical domain description cannot be fully automated. Moreover, like any other logical theory, action theories may also evolve, and thus knowledge engineers need revision methods to help in accommodating new incoming information about the behavior of actions in an adequate manner. The present work is about changing action domain descriptions in multimodal logic. Its contribution is threefold: first we revisit the semantics of action theory contraction proposed (...) in previous work, giving more robust operators that express minimal change based on a notion of distance between Kripke-models. Second we give algorithms for syntactical action theory contraction and establish their correctness with respect to our semantics for those action theories that satisfy a principle of modularity investigated in previous work. Since modularity can be ensured for every action theory and, as we show here, needs to be computed at most once during the evolution of a domain description, it does not represent a limitation at all to the method here studied. Finally we state AGM-like postulates for action theory contraction and assess the behavior of our operators with respect to them. Moreover, we also address the revision counterpart of action theory change, showing that it benefits from our semantics for contraction. (shrink)

We introduce the notions of syntactic synonymy and referential syn- onymy due to Moschovakis. Those notions are capable of accounting for fine- grained aspects of the meaning of linguistic expressions, by formalizing the Fregean distinction between sense and denotation. We integrate Moschovakis’s theory with the theory of concepts developed in the foundational ontology DOLCE, in order to enable a formal treatment of equivalence between concepts.

Standard linguistic analysis of syntax uses the T-model. This model requires the ordering: D-structure > S-structure > LF, where D-structure is the sentences deep structure, S-structure is its surface structure, and LF is its logical form. Between each of these representations there is movement which alters the order of the constituent words; movement is achieved using the principles and parameters of syntactic theory. Psychological analysis of sentence production is usually either serial or connectionist. Psychological serial models do not accommodate (...) the T-model immediately so that here a new model called the P-model is introduced. The P-model is different from previous linguistic and psychological models. Here it is argued that the LF representation should be replaced by a variant of Frege'sA three qualities (sense, reference, and force), called the FregeA representation or F-representation. In the F-representation the order of elements is not necessarily the same as that in LF and it is suggested that the correct ordering is: F-representation > D-structure > S-structure. This ordering appears to lead to a more natural view of sentence production and processing. Within this framework movement originates as the outcome of emphasis applied to the sentence. The requirement that the F-representation precedes the D-structure needs a picture of the particular principles and parameters which pertain to movement of words between representations. In general this would imply that there is a preferred or optimal ordering of the symbolic string in the F-representation. The standard ordering is retained because the general way of producing such an optimal ordering is unclear. In this case it is possible to produce an analysis of movement between LF and D-structure similar to the usual analysis of movement between S-structure and LF. The necessity of analyzing corrupted data suggests that a maximal amount of information about a language's grammar and lexicon is stored. (shrink)