There has been much discussion recently about the scope and limits of purely symbolic models of the mind and about the proper role of connectionism in cognitive modeling. This paper describes the symbol grounding problem : How can the semantic interpretation of a formal symbol system be made intrinsic to the system, rather than just parasitic on the meanings in our heads? How can the meanings of the meaningless symbol tokens, manipulated solely on the basis of (...) their shapes, be grounded in anything but other meaningless symbols? The problem is analogous to trying to learn Chinese from a Chinese/Chinese dictionary alone. A candidate solution is sketched: Symbolic representations must be grounded bottom-up in nonsymbolic representations of two kinds: iconic representations, which are analogs of the proximal sensory projections of distal objects and events, and categorical representations, which are learned and innate feature-detectors that pick out the invariant features of object and event categories from their sensory projections. Elementary symbols are the names of these object and event categories, assigned on the basis of their categorical representations. Higher-order symbolic representations, grounded in these elementary symbols, consist of symbol strings describing category membership relations. Connectionism is one natural candidate for the mechanism that learns the invariant features underlying categorical representations, thereby connecting names to the proximal projections of the distal objects they stand for. In this way connectionism can be seen as a complementary component in a hybrid nonsymbolic/symbolic model of the mind, rather than a rival to purely symbolic modeling. Such a hybrid model would not have an autonomous symbolic module, however; the symbolic functions would emerge as an intrinsically dedicated symbol system as a consequence of the bottom-up grounding of categories ' names in their sensory representations. Symbol manipulation would be governed not just by the arbitrary shapes of the symbol tokens, but by the nonarbitrary shapes of the icons and category invariants in which they are grounded. (shrink)

Every university student has his or her nemesis. Biology and social science students anticipate with great apprehension their required statistics course, while many philosophy students live in fear of formal logic. Math anxiety is the common thread uniting all of them. This article argues that since formal logic is an algebra requiring similar kinds of symbol-manipulation skills needed to succeed in a basic mathematics course, then if logic students have math anxiety, this can impede their progress. Further, (...) it argues that math anxiety is primarily caused by and exacerbated by poor instruction. Formal logic instructors who employ effective instructional techniques for reducing it can help their students overcome math anxiety to foster learning. Methods of instruction leading to anxiety reduction and evidence supporting their efficacy are discussed, including co-operative learning, the mastery goal approach, and self-paced learning. None of these methods holds back more advanced students. (shrink)

The symbol grounding problem is concerned with the question of how the knowledge used in AI programs, expressed as tokens in one form or another or simply symbols, could be grounded to the outside world. By grounding the symbols, it is meant that the system will know the actual objects, events, or states of affairs in the world to which each symbol refers and thus be worldly-wise. Solving this problem, it was hoped, would enable the program to understand (...) its own action and hence be truly intelligent ). The problem becomes more acute after a challenge posed by Searle in his now famous Chinese Room Gedanken experiment. Searle argued that no AI programs can be said to understand or have other cognitive states, if all they do is formal symbol manipulation. (shrink)

Connectionism and computationalism are currently vying for hegemony in cognitive modeling. At first glance the opposition seems incoherent, because connectionism is itself computational, but the form of computationalism that has been the prime candidate for encoding the "language of thought" has been symbolic computationalism (Dietrich 1990, Fodor 1975, Harnad 1990c; Newell 1980; Pylyshyn 1984), whereas connectionism is nonsymbolic (Fodor & Pylyshyn 1988, or, as some have hopefully dubbed it, "subsymbolic" Smolensky 1988). This paper will examine what is and is not (...) a symbol system. A hybrid nonsymbolic/symbolic system will be sketched in which the meanings of the symbols are grounded bottom-up in the system's capacity to discriminate and identify the objects they refer to. Neural nets are one possible mechanism for learning the invariants in the analog sensory projection on which successful categorization is based. "Categorical perception" (Harnad 1987a), in which similarity space is "warped" in the service of categorization, turns out to be exhibited by both people and nets, and may mediate the constraints exerted by the analog world of objects on the formal world of symbols. (shrink)

Kant’s theory of taste supports his political theory by providing the judgment of beauty as a symbol of the good and example of teleological experience, allowing us to imagine the otherwise obscure movement of nature and history toward the ideal human community. If interpreters are correct in believing that Kant should make room for pure judgments of ugliness in his theory of taste, we will have to consider the implications of such judgments for Kant’s political theory. It is here (...) proposed that pure, formal ugliness symbolizes regressive, counter-teleological trends in nature and history. Kant’s paradoxical stance on the right to rebellion, both condemning and supporting the French Revolution, is interpreted as failing to take into account negative social forces signified by ugliness, and therefore neglecting the role of moral agency in social change. (shrink)

I present a formal language that imposes a structure on processes in macro-chemistry. Each symbol in the language invites a type of analysis that is carried out either by looking into the semantics if the language or by looking at the context. Every formal language has assumptions underlying it. The assumptions made in developing the formal language are meant to help with conceptual analysis by inviting certain types of question.

I present a formal language that imposes a structure on processes in macro-chemistry. Each symbol in the language invites a type of analysis that is carried out either by looking into the semantics if the language or by looking at the context. Every formal language has assumptions underlying it. The assumptions made in developing the formal language are meant to help with conceptual analysis by inviting certain types of question.

I present a formal language that imposes a structure on processes in macro-chemistry. Each symbol in the language invites a type of analysis that is carried out either by looking into the semantics if the language or by looking at the context. Every formal language has assumptions underlying it. The assumptions made in developing the formal language are meant to help with conceptual analysis by inviting certain types of question.

Dans un texte désormais célèbre, Ferdinand de Saussure insiste sur l’arbitraire du signe dont il vante les qualités. Toutefois il s’avère que le symbole, signe non arbitraire, dans la mesure où il existe un rapport entre ce qui représente et ce qui est représenté, joue un rôle fondamental dans la plupart des activités humaines, qu’elles soient scientifiques, artistiques ou religieuses. C’est cette dimension symbolique, sa portée, son fonctionnement et sa signification dans des domaines aussi variés que la chimie, la théologie, (...) les mathématiques, le code de la route et bien d’autres qui est l’objet du livre La Pointure du symbole. -/- Jean-Yves Béziau, franco-suisse, est docteur en logique mathématique et docteur en philosophie. Il a poursuivi des recherches en France, au Brésil, en Suisse, aux États-Unis (UCLA et Stanford), en Pologne et développé la logique universelle. Éditeur-en-chef de la revue Logica Universalis et de la collection Studies in Universal Logic (Springer), il est actuellement professeur à l’Université Fédérale de Rio de Janeiro et membre de l’Académie brésilienne de Philosophie. SOMMAIRE -/- PRÉFACE L’arbitraire du signe face à la puissance du symbole Jean-Yves BÉZIAU La logique et la théorie de la notation (sémiotique) de Peirce (Traduit de l’anglais par Jean-Marie Chevalier) Irving H. ANELLIS Langage symbolique de Genèse 2-3 Lytta BASSET -/- Mécanique quantique : quelle réalité derrière les symboles ? Hans BECK -/- Quels langages et images pour représenter le corps humain ? Sarah CARVALLO Des jeux symboliques aux rituels collectifs. Quelques apports de la psychologie du développement à l’étude du symbolisme Fabrice CLÉMENT Les panneaux de signalisation (Traduit de l’anglais par Fabien Shang) Robert DEWAR Remarques sur l’émergence des activités symboliques Jean LASSÈGUE Les illustrations du "Songe de Poliphile" (1499). Notule sur les hiéroglyphes de Francesca Colonna Pierre-Alain MARIAUX Signes de vie Jeremy NARBY Visualising relations in society and economics. Otto Neuraths Isotype-method against the background of his economic thought Elisabeth NEMETH Algèbre et logique symboliques : arbitraire du signe et langage formel Marie-José DURAND – Amirouche MOKTEFI Les symboles mathématiques, signes du Ciel Jean-Claude PONT La mathématique : un langage mathématique ? Alain M. ROBERT. (shrink)

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

In relation to semantics, “grounding” has two relevant meanings. “Symbol grounding” is the process of connecting symbols to perception and the world. “Communicative grounding” is the process of interactively adding to common ground in dialog. Strategies for grounding in human communication include, crucially, strategies for resolving troubles caused by various kinds of miscommunication. As it happens, these two processes of grounding are closely related. As a side-effect of grounding an utterance, dialog participants may adjust the meanings they assign to (...) linguistic expressions, in a process of semantic coordination. Meanings of at least some expressions include perceptual aspects which enable DPs to classify entities as falling under the expression or not based on their perception of those entities. We show how perceptual grounding of symbols can be achieved in a process of interactively adding to common ground. This requires that perceptual aspects of meaning can be updated as a result of participating in linguistic interaction, thereby enabling fine-grained semantic coordination of perceptually grounded linguistic meanings. A formal semantics for low-level perceptual aspects of meaning is presented, tying these together with the logical-inferential aspects of meaning traditionally studied in formal semantics. The key idea is to model perceptual meanings as classifiers of perceptual input. This requires a framework where intensions are represented independently of extensions, and structured objects which can be modified as a result of learning. We use Type Theory with Records, a formal semantics framework which starts from the idea that information and meaning are founded on our ability to perceive and classify the world, that is, to perceive objects and situations as being of types. As an example of our approach, we show how a simple classifier of spatial information based on the Perceptron can be cast in TTR. (shrink)

The fundamental assumptions in Dijkstra''s influential article on computing science teaching are challenged. Dijkstra''s paper presents the radical novelties of computing, and the consequent problems that we must tackle through a formal, logic-based approach to program derivation. Dijkstra''s main premise is that the algorithmic programming paradigm is the only one, in fact, the only possible one. It is argued that there is at least one other, the network-programming paradigm, which itself is a radical novelty with respect to the implementation (...) of problems on computers. And, as one might expect of a radical alternative, it shows much of the conventional wisdom concerning computing science, which Dijkstra variously attacks and dispenses, to be special pleading; not universals of computing at all. Finally, we explore what is known of this new paradigm in order to see what light it sheds on the fundamental problems that computing really does present to us. Not surprisingly, some become less problematic, some disappear altogether and others take their place, but, in general, it must be of benefit to modern computer technology to gain a wider perspective on the possibilities instead of seeing everything through the traditional tunnel of programming as formula derivation, and computers as the requisite, special type of symbol manipulation device. (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)

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)

When certain formal symbol systems (e.g., computer programs) are implemented as dynamic physical symbol systems (e.g., when they are run on a computer) their activity can be interpreted at higher levels (e.g., binary code can be interpreted as LISP, LISP code can be interpreted as English, and English can be interpreted as a meaningful conversation). These higher levels of interpretability are called "virtual" systems. If such a virtual system is interpretable as if it had a mind, is (...) such a "virtual mind" real? This is the question addressed in this "virtual" symposium, originally conducted electronically among four cognitive scientists: Donald Perlis, a computer scientist, argues that according to the computationalist thesis, virtual minds are real and hence Searle's Chinese Room Argument fails, because if Searle memorized and executed a program that could pass the Turing Test in Chinese he would have a second, virtual, Chinese-understanding mind of which he was unaware (as in multiple personality). Stevan Harnad, a psychologist, argues that Searle's Argument is valid, virtual minds are just hermeneutic overinterpretations, and symbols must be grounded in the real world of objects, not just the virtual world of interpretations. Computer scientist Patrick Hayes argues that Searle's Argument fails, but because Searle does not really implement the program: A real implementation must not be homuncular but mindless and mechanical, like a computer. Only then can it give rise to a mind at the virtual level. Philosopher Ned Block suggests that there is no reason a mindful implementation would not be a real one. (shrink)

According to "computationalism" (Newell, 1980; Pylyshyn 1984; Dietrich 1990), mental states are computational states, so if one wishes to build a mind, one is actually looking for the right program to run on a digital computer. A computer program is a semantically interpretable formal symbol system consisting of rules for manipulating symbols on the basis of their shapes, which are arbitrary in relation to what they can be systematically interpreted as meaning. According to computationalism, every physical implementation of (...) the right symbol system will have mental states. (shrink)

It is unlikely that the systematic, compositional properties of formal symbol systems -- i.e., of computation -- play no role at all in cognition. However, it is equally unlikely that cognition is just computation, because of the symbol grounding problem (Harnad 1990): The symbols in a symbol system are systematically interpretable, by external interpreters, as meaning something, and that is a remarkable and powerful property of symbol systems. Cognition (i.e., thinking), has this property too: Our (...) thoughts are systematically interpretable by external interpreters as meaning something. However, unlike symbols in symbol systems, thoughts mean what they mean autonomously: Their meaning does not consist of or depend on anyone making or being able to make any external interpretations of them at all. When I think "the cat is on the mat," the meaning of that thought is autonomous; it does not depend on YOUR being able to interpret it as meaning that (even though you could interpret it that way, and you would be right). (shrink)

Changes in an upper level ontology have obvious conse-quences for the domain ontologies that use it at lower levels. It is therefore crucial to document the changes made between successive versions of ontologies of this kind. We describe and apply a method for tracking, explaining and measuring changes between successive versions of upper level ontologies such as the Basic Formal Ontology (BFO). The proposed change-tracking method extends earlier work on Realism-Based Ontology Versioning (RBOV) and Evolutionary Terminology Auditing (ETA). We (...) describe here the application of this evaluation method to changes between BFO 1.0, BFO 1.1, and BFO 2.0. We discuss the issues raised by this application and describe the extensions which we added to the original evaluation schema in order to account for changes in an ontology of this type. Our results show that BFO has undergone eight types of changes that can be systematically explained by the extended evaluation schema. Finally, we discuss problematic cases, possible pitfalls and certain limits of our study that we propose to address in future work. (shrink)

We propose a formal representation of objects , those being mathematical or empirical objects. The powerful framework inside which we represent them in a unique and coherent way is grounded, on the formal side, in a logical approach with a direct mathematical semantics in the well-established field of constructive topology, and, on the philosophical side, in a neo-Kantian perspective emphasizing the knowing subject’s role, which is constructive for the mathematical objects and constitutive for the empirical ones.

In the era of “big data,” science is increasingly information driven, and the potential for computers to store, manage, and integrate massive amounts of data has given rise to such new disciplinary fields as biomedical informatics. Applied ontology offers a strategy for the organization of scientific information in computer-tractable form, drawing on concepts not only from computer and information science but also from linguistics, logic, and philosophy. This book provides an introduction to the field of applied ontology that is of (...) particular relevance to biomedicine, covering theoretical components of ontologies, best practices for ontology design, and examples of biomedical ontologies in use. -/- After defining an ontology as a representation of the types of entities in a given domain, the book distinguishes between different kinds of ontologies and taxonomies, and shows how applied ontology draws on more traditional ideas from metaphysics. It presents the core features of the Basic Formal Ontology (BFO), now used by over one hundred ontology projects around the world, and offers examples of domain ontologies that utilize BFO. The book also describes Web Ontology Language (OWL), a common framework for Semantic Web technologies. Throughout, the book provides concrete recommendations for the design and construction of domain ontologies. (shrink)

A uniform theory of conditionals is one which compositionally captures the behavior of both indicative and subjunctive conditionals without positing ambiguities. This paper raises new problems for the closest thing to a uniform analysis in the literature (Stalnaker, Philosophia, 5, 269–286 (1975)) and develops a new theory which solves them. I also show that this new analysis provides an improved treatment of three phenomena (the import-export equivalence, reverse Sobel-sequences and disjunctive antecedents). While these results concern central issues in the study (...) of conditionals, broader themes in the philosophy of language and formal semantics are also engaged here. This new analysis exploits a dynamic conception of meaning where the meaning of a symbol is its potential to change an agent’s mental state (or the state of a conversation) rather than being the symbol’s content (e.g. the proposition it expresses). The analysis of conditionals is also built on the idea that the contrast between subjunctive and indicative conditionals parallels a contrast between revising and consistently extending some body of information. (shrink)

One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...) for several systems of the hierarchy of paraconsistent logics known as Logics of Formal Inconsistency (LFIs). Because of this, these logics are uniquely characterized by semantics of non-deterministic kind. This paper offers a solution for two open problems in the domain of paraconsistency, in particular connected to algebraization of LFIs, by obtaining several LFIs weaker than C1, each of one is algebraizable in the standard Lindenbaum-Tarski's sense by a suitable variety of Boolean algebras extended with operators. This means that such LFIs satisfy the replacement property. The weakest LFI satisfying replacement presented here is called RmbC, which is obtained from the basic LFI called mbC. Some axiomatic extensions of RmbC are also studied, and in addition a neighborhood semantics is defined for such systems. It is shown that RmbC can be defined within the minimal bimodal non-normal logic E+E defined by the fusion of the non-normal modal logic E with itself. Finally, the framework is extended to first-order languages. RQmbC, the quantified extension of RmbC, is shown to be sound and complete w.r.t. BALFI semantics. (shrink)

It is often claimed that emotions are linked to formal objects. But what are formal objects? What roles do they play? According to some philosophers, formal objects are axiological properties which individuate emotions, make them intelligible and give their correctness conditions. In this paper, I evaluate these claims in order to answer the above questions. I first give reasons to doubt the thesis that formal objects individuate emotions. Second, I distinguish different ways in which emotions are (...) intelligible and argue that philosophers are wrong in claiming that emotions only make sense when they are based on prior sources of axiological information. Third, I investigate how issues of intelligibility connect with the correctness conditions of emotions. I defend a theory according to which emotions do not respond to axiological information, but to non-axiological reasons. According to this theory, we can allocate fundamental roles to the formal objects of emotions while dispensing with the problematic features of other theories. (shrink)

Basic Formal Ontology (BFO) is a top-level ontology used in hundreds of active projects in scientific and other domains. BFO has been selected to serve as top-level ontology in the Industrial Ontologies Foundry (IOF), an initiative to create a suite of ontologies to support digital manufacturing on the part of representatives from a number of branches of the advanced manufacturing industries. We here present a first draft set of axioms and definitions of an IOF upper ontology descending from BFO. (...) The axiomatization is designed to capture the meanings of terms commonly used in manufacturing and is designed to serve as starting point for the construction of the IOF ontology suite. (shrink)

The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The case of (...) QmbC, the simpler quantified LFI expanding classical logic, will be analyzed in detail. An axiomatic extension of QmbC called QLFI1o is also studied, which is equivalent to the quantified version of da Costa and D'Ottaviano 3-valued logic J3. The semantical structures for this logic turn out to be Tarkian structures based on twist structures. The expansion of QmbC and QLFI1o with a standard equality predicate is also considered. (shrink)

Inspired by impossibility theorems of social choice theory, many democratic theorists have argued that aggregative forms of democracy cannot lend full democratic justification for the collective decisions reached. Hence, democratic theorists have turned their attention to deliberative democracy, according to which “outcomes are democratically legitimate if and only if they could be the object of a free and reasoned agreement among equals” (Cohen 1997a, 73). However, relatively little work has been done to offer a formal theory of democratic deliberation. (...) This article helps fill that gap by offering a formal theory of three different modes of democratic deliberation: myopic discussion, constructive discussion, and debate. We show that myopic discussion suffers from indeterminacy of long run outcomes, while constructive discussion and debate are conclusive. Finally, unlike the other two modes of deliberation, debate is path independent and converges to a unique compromise position, irrespective of the initial status quo. (shrink)

Numerous research groups are now utilizing Basic Formal Ontology as an upper-level framework to assist in the organization and integration of biomedical information. This paper provides elucidation of the three existing BFO subcategories of realizable entity, namely function, role, and disposition. It proposes one further sub-category of tendency, and considers the merits of recognizing two sub-categories of function for domain ontologies, namely, artifactual and biological function. The motivation is to help advance the coherent ontological treatment of functions, roles, and (...) dispositions, to help provide the potential for more detailed classification, and to shed light on BFO’s general make-up and use. (shrink)

The broader context for the formal darwinism project established by two of the commentators, in terms of reconciling the Modern Synthesis with Darwinian arguments over design and in terms of links to other types of selection and design, is discussed and welcomed. Some overselling of the project is admitted, in particular of whether it claims to consider all organic design. One important fundamental question raised in two commentaries is flagged but not answered of whether design is rightly represented by (...) an optimisation program, and another from one commentary of whether the coreplicon dissolves in the face of multi-generational imprinting. Calls for the project to be extended to design at levels above and below the individual are considered sympathetically, but judged impractical at the high level of abstraction of the project. All claims of substantive technical error are emphatically rejected. Close technical readings are welcomed that, among other things, represent the project as 'axiomatizing fitness'. The prospects for the project are set out in the light of this highly varied set of commentaries. (shrink)

This position paper advocates combining formal epistemology and the new paradigm psychology of reasoning in the studies of conditionals and reasoning with uncertainty. The new paradigm psychology of reasoning is characterized by the use of probability theory as a rationality framework instead of classical logic, used by more traditional approaches to the psychology of reasoning. This paper presents a new interdisciplinary research program which involves both formal and experimental work. To illustrate the program, the paper discusses recent work (...) on the paradoxes of the material conditional, nonmonotonic reasoning, and Adams’ Thesis. It also identifies the issue of updating on conditionals as an area which seems to call for a combined formal and empirical approach. (shrink)

The problem of concept representation is relevant for many sub-fields of cognitive research, including psychology and philosophy, as well as artificial intelligence. In particular, in recent years it has received a great deal of attention within the field of knowledge representation, due to its relevance for both knowledge engineering as well as ontology-based technologies. However, the notion of a concept itself turns out to be highly disputed and problematic. In our opinion, one of the causes of this state of affairs (...) is that the notion of a concept is, to some extent, heterogeneous, and encompasses different cognitive phenomena. This results in a strain between conflicting requirements, such as compositionality, on the one hand and the need to represent prototypical information on the other. In some ways artificial intelligence research shows traces of this situation. In this paper, we propose an analysis of this current state of affairs. Since it is our opinion that a mature methodology with which to approach knowledge representation and knowledge engineering should also take advantage of the empirical results of cognitive psychology concerning human abilities, we outline some proposals for concept representation in formal ontologies, which take into account suggestions from psychological research. Our basic assumption is that knowledge representation systems whose design takes into account evidence from experimental psychology may therefore give better results in many applications. (shrink)

The notion of function is indispensable to our understanding of distinctions such as that between being broken and being in working order (for artifacts) and between being diseased and being healthy (for organisms). A clear account of the ontology of functions and functioning is thus an important desideratum for any top-level ontology intended for application to domains such as engineering or medicine. The benefit of using top-level ontologies in applied ontology can only be realized when each of the categories identified (...) and defined by a top-level ontology is integrated with the others in a coherent fashion. Basic Formal Ontology (BFO) has from the beginning included function as one of its categories, exploiting a version of the etiological account of function that is framed at a level of generality sufficient to accommodate both biological and artifactual functions. This account has been subjected to a series of criticisms and refinements. We here articulate BFO’s account of function, provide some reasons for favoring it over competing views, and defend it against objections. (shrink)

We consider the question: under what circumstances can the concept of adaptation be applied to groups, rather than individuals? Gardner and Grafen (2009, J. Evol. Biol.22: 659–671) develop a novel approach to this question, building on Grafen's ‘formal Darwinism’ project, which defines adaptation in terms of links between evolutionary dynamics and optimization. They conclude that only clonal groups, and to a lesser extent groups in which reproductive competition is repressed, can be considered as adaptive units. We re-examine the conditions (...) under which the selection–optimization links hold at the group level. We focus on an important distinction between two ways of understanding the links, which have different implications regarding group adaptationism. We show how the formal Darwinism approach can be reconciled with G.C. Williams’ famous analysis of group adaptation, and we consider the relationships between group adaptation, the Price equation approach to multi-level selection, and the alternative approach based on contextual analysis. (shrink)

Formal principles governing best practices in classification and definition have for too long been neglected in the construction of biomedical ontologies, in ways which have important negative consequences for data integration and ontology alignment. We argue that the use of such principles in ontology construction can serve as a valuable tool in error-detection and also in supporting reliable manual curation. We argue also that such principles are a prerequisite for the successful application of advanced data integration techniques such as (...) ontology-based multi-database querying, automated ontology alignment and ontology-based text-mining. These theses are illustrated by means of a case study of the Gene Ontology, a project of increasing importance within the field of biomedical data integration. (shrink)

La lógica es para Husserl una ciencia de la ciencia, una ciencia de lo que todas las ciencias tienen en común respecto de sus modos de validación. De este modo, la lógica trata por un lado con leyes universales relacionadas con la verdad, la deducción, la verificación y la falsación; y, por otro lado, con leyes relacionadas con la teoría como tal, y con lo que produce la unidad teorética. Ambos tipos de leyes se refieren por una parte a las (...) proposiciones de una teoría y por otra parte al dominio de objetos al que esas proposiciones se refieren. Este ensayo presenta una perspectiva sistemática del punto de vista husserliano sobre estos temas tal como él lo expone en sus Investigaciones Lógicas. Se muestra la manera en que su teoría de los significados lingüísticos en tanto especies de actos mentales, su ontología formal de la parte, el todo y la dependencia, su teoría de las categorías significativas, y su teoría de la intuición categorial combinada con su teoría de la ciencia conforman un todo singular. Finalmente, este trabajo explora la forma en que las ideas de Husserl sobre estos temas pueden ser reactivadas para resolver problemas en la filosofía del lenguaje, la lógica y la matemática de un modo que haga justicia al rol de la actividad mental en cada uno de estos dominios, evitando al mismo tiempo caer en los problemas del psicologismo. (shrink)

In this paper we present a philosophical motivation for the logics of formal inconsistency, a family of paraconsistent logics whose distinctive feature is that of having resources for expressing the notion of consistency within the object language in such a way that consistency may be logically independent of non-contradiction. We defend the view according to which logics of formal inconsistency may be interpreted as theories of logical consequence of an epistemological character. We also argue that in order to (...) philosophically justify paraconsistency there is no need to endorse dialetheism, the thesis that there are true contradictions. Furthermore, we show that mbC, a logic of formal inconsistency based on classical logic, may be enhanced in order to express the basic ideas of an intuitive interpretation of contradictions as conflicting evidence. (shrink)

This paper presents a view of nature as a network of infocomputational agents organized in a dynamical hierarchy of levels. It provides a framework for unification of currently disparate understandings of natural, formal, technical, behavioral and social phenomena based on information as a structure, differences in one system that cause the differences in another system, and computation as its dynamics, i.e. physical process of morphological change in the informational structure. We address some of the frequent misunderstandings regarding the natural/morphological (...) computational models and their relationships to physical systems, especially cognitive systems such as living beings. Natural morphological infocomputation as a conceptual framework necessitates generalization of models of computation beyond the traditional Turing machine model presenting symbol manipulation, and requires agent-based concurrent resource-sensitive models of computation in order to be able to cover the whole range of phenomena from physics to cognition. The central role of agency, particularly material vs. cognitive agency is highlighted. (shrink)

In the formal semantics based on modern type theories, common nouns are interpreted as types, rather than as predicates of entities as in Montague’s semantics. This brings about important advantages in linguistic interpretations but also leads to a limitation of expressive power because there are fewer operations on types as compared with those on predicates. The theory of coercive subtyping adequately extends the modern type theories and, as shown in this paper, plays a very useful role in making type (...) theories more expressive for formal semantics. It not only gives a satisfactory solution to the basic problem of ‘multiple categorisation’ caused by interpreting common nouns as types, but provides a powerful formal framework to model interesting linguistic phenomena such as copredication, whose formal treatment has been found difficult in a Montagovian setting. In particular, we show how to formally introduce dot-types in a type theory with coercive subtyping and study some type-theoretic constructs that provide useful representational tools for reference transfers and multiple word meanings in formal lexical semantics. (shrink)

This paper makes explicit the way in which many theorists of the epistemology of uncertainty, or formal epistemologists, are committed to a version of noncognitivism—one about thoughts that something is likely. It does so by drawing an analogy with metaethical noncognitivism. I explore the degree to which the motivations for both views are similar and how both views have to grapple with the Frege‐Geach Problem about complex thoughts. The major upshot of recognizing this noncognitivism is that it presents challenges (...) and opportunities not only in the philosophy of mind and language but also in epistemology itself. I present some examples where attention to the implicit noncognitivism in formal epistemology has affected or should affect epistemological theory. And I suggest that it is likely that further examples of this sort will arise. (shrink)

Basic Formal Ontology was created in 2002 as an upper-level ontology to support the creation of consistent lower-level ontologies, initially in the subdomains of biomedical research, now also in other areas, including defense and security. BFO is currently undergoing revisions in preparation for the release of BFO version 2.0. We summarize some of the proposed revisions in what follows, focusing on BFO’s treatment of material entities, and specifically of the category object.

The paper first introduces a cube of opposition that associates the traditional square of opposition with the dual square obtained by Piaget’s reciprocation. It is then pointed out that Blanché’s extension of the square-of-opposition structure into an conceptual hexagonal structure always relies on an abstract tripartition. Considering quadripartitions leads to organize the 16 binary connectives into a regular tetrahedron. Lastly, the cube of opposition, once interpreted in modal terms, is shown to account for a recent generalization of formal concept (...) analysis, where noticeable hexagons are also laid bare. This generalization of formal concept analysis is motivated by a parallel with bipolar possibility theory. The latter, albeit graded, is indeed based on four graded set functions that can be organized in a similar structure. (shrink)

Formal epistemology is just what it sounds like: epistemology done with formal tools. Coinciding with the general rise in popularity of experimental philosophy, formal epistemologists have begun to apply experimental methods in their own work. In this entry, I survey some of the work at the intersection of formal and experimental epistemology. I show that experimental methods have unique roles to play when epistemology is done formally, and I highlight some ways in which results from (...) class='Hi'>formal epistemology have been used fruitfully to advance epistemically-relevant experimental work. The upshot of this brief, incomplete survey is that formal and experimental methods often constitute mutually informative means to epistemological ends. (shrink)

The methodological nonreductionism of contemporary biology opens an interesting discussion on the level of ontology and the philosophy of nature. The theory of emergence (EM), and downward causation (DC) in particular, bring a new set of arguments challenging not only methodological, but also ontological and causal reductionism. This argumentation provides a crucial philosophical foundation for the science/theology dialogue. However, a closer examination shows that proponents of EM do not present a unified and consistent definition of DC. Moreover, they find it (...) difficult to prove that higher-order properties can be causally significant without violating the causal laws that operate at lower physical levels. They also face the problem of circularity and incoherence in their explanation. In our article we show that these problems can be overcome only if DC is understood in terms of formal rather than physical (efficient) causality. This breakdown of causal monism in science opens a way to the retrieval of the fourfold Aristotelian notion of causality. (shrink)

ABSTRACT: In its strongest unqualified form, the principle of wholistic reference is that in any given discourse, each proposition refers to the whole universe of that discourse, regardless of how limited the referents of its non-logical or content terms. According to this principle every proposition of number theory, even an equation such as "5 + 7 = 12", refers not only to the individual numbers that it happens to mention but to the whole universe of numbers. This principle, its history, (...) and its relevance to some of Oswaldo Chateaubriand's work are discussed in my 2004 paper "The Principle of Wholistic Reference" in Essays on Chateaubriand's "Logical Forms". In Chateaubriand's réplica (reply), which is printed with my paper, he raised several important additional issues including the three I focus on in this tréplica (reply to his reply): truth-values, universes of discourse, and formal ontology. This paper is self-contained: it is not necessary to have read the above-mentioned works. The principle of wholistic reference (PWR) was first put forth by George Boole in 1847 when he espoused a monistic fixed-universe viewpoint similar to the one Frege and Russell espoused throughout their careers. Later, Boole elaborated PWR in 1854 from the pluralistic multiple-universes perspective. (shrink)

In this paper, we argue that formal ontological relations avoid Bradley's reductio of relations, including his famous relation regress.

Formal ontology as it is presented in Husserl`s Third Logical Investigation can be interpreted as a fundamental tool to describe objects in a formal sense. It is presented one of the main sources: chapter five of Carl Stumpf`s Ûber den psycholoogischen Ursprung der Raumovorstellung (1873), and then it is described how Husserlian Formal Ontology is applied in Fifth Logical Investigation. Finally, it is applied to dramatic structures, in the spirit of Roman Ingarden.

This paper reviews the central points and presents some recent developments of the epistemic approach to paraconsistency in terms of the preservation of evidence. Two formal systems are surveyed, the basic logic of evidence (BLE) and the logic of evidence and truth (LET J ), designed to deal, respectively, with evidence and with evidence and truth. While BLE is equivalent to Nelson’s logic N4, it has been conceived for a different purpose. Adequate valuation semantics that provide decidability are given (...) for both BLE and LET J . The meanings of the connectives of BLE and LET J , from the point of view of preservation of evidence, is explained with the aid of an inferential semantics. A formalization of the notion of evidence for BLE as proposed by M. Fitting is also reviewed here. As a novel result, the paper shows that LET J is semantically characterized through the so-called Fidel structures. Some opportunities for further research are also discussed. (shrink)

This article is the second step in our research into the Symbol Grounding Problem (SGP). In a previous work, we defined the main condition that must be satisfied by any strategy in order to provide a valid solution to the SGP, namely the zero semantic commitment condition (Z condition). We then showed that all the main strategies proposed so far fail to satisfy the Z condition, although they provide several important lessons to be followed by any new proposal. Here, (...) we develop a new solution of the SGP. It is called praxical in order to stress the key role played by the interactions between the agents and their environment. It is based on a new theory of meaning—Action-based Semantics (AbS)—and on a new kind of artificial agents, called two-machine artificial agents (AM²). Thanks to their architecture, AM2s implement AbS, and this allows them to ground their symbols semantically and to develop some fairly advanced semantic abilities, including the development of semantically grounded communication and the elaboration of representations, while still respecting the Z condition. (shrink)

We present a philosophical motivation for the logics of formal inconsistency, a family of paraconsistent logics whose distinctive feature is that of having resources for expressing the notion of consistency within the object language. We shall defend the view according to which logics of formal inconsistency are theories of logical consequence of normative and epistemic character. This approach not only allows us to make inferences in the presence of contradictions, but offers a philosophically acceptable account of paraconsistency.

I distinguish two types of reduction within the context of quantum-classical relations, which I designate “formal” and “empirical”. Formal reduction holds or fails to hold solely by virtue of the mathematical relationship between two theories; it is therefore a two-place, a priori relation between theories. Empirical reduction requires one theory to encompass the range of physical behaviors that are well-modeled in another theory; in a certain sense, it is a three-place, a posteriori relation connecting the theories and the (...) domain of physical reality that both serve to describe. Focusing on the relationship between classical and quantum mechanics, I argue that while certain formal results concerning singular \ limits have been taken to preclude the possibility of reduction between these theories, such results at most provide support for the claim that singular limits block reduction in the formal sense; little if any reason has been given for thinking that they block reduction in the empirical sense. I then briefly outline a strategy for empirical reduction that is suggested by work on decoherence theory, arguing that this sort of account remains a fully viable route to the empirical reduction of classical to quantum mechanics and is unaffected by such singular limits. (shrink)