Science in a new sense arises in the first instance from Plato's establishing of logic, as a place for exploring the essential requirements of "genuine" ...

Logical consequence in first-order predicate logic is defined substitutionally in set theory augmented with a primitive satisfaction predicate: an argument is defined to be logically valid if and only if there is no substitution instance with true premises and a false conclusion. Substitution instances are permitted to contain parameters. Variants of this definition of logical consequence are given: logical validity can be defined with or without identity as a logical constant, and quantifiers can be relativized in substitution instances or not. (...) It is shown that the resulting notions of logical consequence are extensionally equivalent to versions of first-order provability and model-theoretic consequence. Every model-theoretic interpretation has a substitutional counterpart, but not vice versa. In particular, in contrast to the model-theoretic account, there is a trivial intended interpretation on the substitutional account, namely, the homophonic interpretation that does not substitute anything. Applications to free logic, and theories and languages other than set theory are sketched. (shrink)

We propose a formal framework for interpretable machine learning. Combining elements from statistical learning, causal interventionism, and decision theory, we design an idealised explanation game in which players collaborate to find the best explanation for a given algorithmic prediction. Through an iterative procedure of questions and answers, the players establish a three-dimensional Pareto frontier that describes the optimal trade-offs between explanatory accuracy, simplicity, and relevance. Multiple rounds are played at different levels of abstraction, allowing the players to explore overlapping (...) causal patterns of variable granularity and scope. We characterise the conditions under which such a game is almost surely guaranteed to converge on a optimal explanation surface in polynomial time, and highlight obstacles that will tend to prevent the players from advancing beyond certain explanatory thresholds. The game serves a descriptive and a normative function, establishing a conceptual space in which to analyse and compare existing proposals, as well as design new and improved solutions. (shrink)

We propose a formal framework for interpretable machine learning. Combining elements from statistical learning, causal interventionism, and decision theory, we design an idealisedexplanation gamein which players collaborate to find the best explanation(s) for a given algorithmic prediction. Through an iterative procedure of questions and answers, the players establish a three-dimensional Pareto frontier that describes the optimal trade-offs between explanatory accuracy, simplicity, and relevance. Multiple rounds are played at different levels of abstraction, allowing the players to explore overlapping causal patterns (...) of variable granularity and scope. We characterise the conditions under which such a game is almost surely guaranteed to converge on a (conditionally) optimal explanation surface in polynomial time, and highlight obstacles that will tend to prevent the players from advancing beyond certain explanatory thresholds. The game serves a descriptive and a normative function, establishing a conceptual space in which to analyse and compare existing proposals, as well as design new and improved solutions. (shrink)

What is the relation between the intentionality of states and attitudes which can miss their mark, such as belief and desire, and the intentionality of acts, states and attitudes which cannot miss their mark, such as the different types of knowledge and simple seeing? Two theories of the first type of intentionality, the theory of correctness conditions and the theory of satisfaction conditions, are compared. It is argued that knowledge always involves knowledge of formal objects such as facts and (...) values, that emotions are reactions to (apparently) known values and that beliefs are reactions to known or apparently known facts or to the objects of relational states. (shrink)

The authors examined cultural preferences for formal versus intuitive reasoning among East Asian (Chinese and Korean), Asian American, and European American university students. We investigated categorization (Studies 1 and 2), conceptual structure (Study 3), and deductive reasoning (Studies 3 and 4). In each study a cognitive conflict was activated between formal and intuitive strategies of reasoning. European Americans, more than Chinese and Koreans, set aside intuition in favor of formal reasoning. Conversely, Chinese and Koreans relied on intuitive (...) strategies more than European Americans. Asian Americans' reasoning was either identical to that of European Americans, or intermediate. Differences emerged against a background of similar reasoning tendencies across cultures in the absence of conflict between formal and intuitive strategies. (shrink)

We propose a formal framework for interpretable machine learning. Combining elements from statistical learning, causal interventionism, and decision theory, we design an idealised explanation game in which players collaborate to find the best explanation for a given algorithmic prediction. Through an iterative procedure of questions and answers, the players establish a three-dimensional Pareto frontier that describes the optimal trade-offs between explanatory accuracy, simplicity, and relevance. Multiple rounds are played at different levels of abstraction, allowing the players to explore overlapping (...) causal patterns of variable granularity and scope. We characterise the conditions under which such a game is almost surely guaranteed to converge on a optimal explanation surface in polynomial time, and highlight obstacles that will tend to prevent the players from advancing beyond certain explanatory thresholds. The game serves a descriptive and a normative function, establishing a conceptual space in which to analyse and compare existing proposals, as well as design new and improved solutions. (shrink)

system reflected in Saussure's linguistic theory, and so influential in the great progress linguistic theory has made in this century. Indeed, Granger sees linguistic theory as expressing a paradigm for scientific theorizing, which research in other social sciences should adopt. But 'structuralism' as a method in science does not, in Granger's view, begin with Saussure and the linguists. It is nothing less than the strategy of all the sciences, both natural and social, since their beginnings. Now, 'structuralism' is a 'trendy' (...) term no less in Anglophone methodology than in Francophone philosophy. But Granger's employment of the term is not to be assimilated to this trend, nor to the fashionable excesses for which this expression has been a watch word (he explicitly separates himself from this movement in the preface to the second edition). The exact nature of what Granger calls 'structuralist' methods is the subject of a large part of this work, and I will not dwell on it much further in this introduction. Suffice it to say that Granger's demand for structuralist description is nothing less than the recognition that the successful pursuit of science requires that its terms and predicates pick out what we may call 'natural kinds'; that is, describe classes of items that bear uniform nomolog ical relations to one another. A science whose descriptive terms do not meet this condition will never produce any laws that reflect such nomological connections. (shrink)

We consider two formalisations of the notion of a compositionalsemantics for a language, and find some equivalent statements in termsof substitutions. We prove a theorem stating necessary and sufficientconditions for the existence of a canonical compositional semanticsextending a given partial semantics, after discussing what features onewould want such an extension to have. The theorem involves someassumptions about semantical categories in the spirit of Husserl andTarski.

In this article, after presenting the basic idea of causal accounts of implementation and the problems they are supposed to solve, I sketch the model of computation preferred by Chalmers and argue that it is too limited to do full justice to computational theories in cognitive science. I also argue that it does not suffice to replace Chalmers’ favorite model with a better abstract model of computation; it is necessary to acknowledge the causal structure of physical computers that is not (...) accommodated by the models used in computability theory. Additionally, an alternative mechanistic proposal is outlined. (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.

Name der Zeitschrift: Archiv für Geschichte der Philosophie Jahrgang: 97 Heft: 2 Seiten: 196-233.

The now standard definition of logical consequence is model-theoretic. Many writers have tried to justify, or to criticise, the model-theoretic definition by arguing that it extensionally captures, or fails to capture, our intuitions about logical consequence, such as its modal character or its being truth-preservation in virtue of form. One popular means of comparing the extension of model-theoretic consequence with some intuitive notion proceeds by adapting Kreisel's squeezing argument. But these attempts get Kreisel wrong, and try to achieve more than (...) he ever intended. This suggests that the model-theoretic definition should be viewed quite differently as an explication of our intuitions about logical consequence. I introduce Kreisel's squeezing argument in Section 1. Then in Section 2, I show how it is adapted by two prominent writers on logical consequence, Etchemendy (1990) and Shapiro (2005). Finally, in Section 3, I argue that these adaptations fail. (shrink)

The purpose of this study was to extend the knowledge about why procedural justice has behavioral implications within organizations. Since prior studies show that PJ leads to legitimacy, the author suggests that, when formal regulations are unfairly implemented, they lose their validity or efficacy. This “rule deactivation,” in turn, leads to two proposed destructive work behaviors, namely, workplace deviance and decreased citizenship behaviors. The results support this mediating role of RD, thus suggesting that it forms part of the generative (...) mechanism through which unfair procedures influence ethical behavior within organizations. The author ends the article by discussing behavioral ethics and managerial implications as well as suggestions for future research. (shrink)

The General Formal Ontology is a top-level ontology that is being developed at the University of Leipzig since 1999. Besides introducing some of the basic principles of the ontology, we expound axiomatic fragments of its formalization and present ontological models of several use cases. GFO is a top-level ontology that integrates objects and processes into a unified framework, in a way that differs significantly from other ontologies. Another unique selling feature of GFO is its meta-ontological architecture, which includes set (...) theory into ontology and which accounts for its specific role in common representation approaches. The second level of that architecture starts from the distinction of categories and individuals, which forms the backbone of the world’s structure. Furthermore, GFO comprises several kinds of categories, among them universals and concepts, and it considers several ontological regions and levels. In the context of this special issue paper, we study five pre-determined use cases from the perspective of GFO. The results of these analyses yield insights into how the ontology treats several important notions. Very abridged, this covers material objects and their composition; roles and social entities; properties with their relations to objects and processes, and their changing; changes of processes, including a functional perspective; and, eventually, the nature and changing of concepts as well as terminology. A final part summarizes application projects that use GFO in various contexts. (shrink)

I defend moderate formalism about the aesthetics of nature. I argue that anti-formalists cannot account for the incongruousness of much natural beauty. This shows that some natural beauty is not kind-dependent. I then tackle several anti-formalist arguments that can be found in the writings of Ronald Hepburn, Allen Carlson, and Malcolm Budd.

The term ‘formal ontology’ was first used by the philosopher Edmund Husserl in his Logical Investigations to signify the study of those formal structures and relations – above all relations of part and whole – which are exemplified in the subject-matters of the different material sciences. We follow Husserl in presenting the basic concepts of formal ontology as falling into three groups: the theory of part and whole, the theory of dependence, and the theory of boundary, continuity (...) and contact. These basic concepts are presented in relation to the problem of providing an account of the formal ontology of the mesoscopic realm of everyday experience, and specifically of providing an account of the concept of individual substance. (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)

A chronicled approach to the notion of computer simulations shows that there are two predominant interpretations in the specialized literature. According to the first interpretation, computer simulations are techniques for finding the set of solutions to a mathematical model. I call this first interpretation the problem-solving technique viewpoint. In its second interpretation, computer simulations are considered to describe patterns of behavior of a target system. I call this second interpretation the description of patterns of behavior viewpoint of computer simulations. This (...) article explores these two interpretations of computer simulations from three different angles. First, I collect a series of definitions of computer simulation from the historical record. I track back definitions to the early 1960s and show how each viewpoint shares similar interpretations of computer simulations—ultimately clustering into the two viewpoints aforementioned. This reconstruction also includes the most recent literature. Second, I unpack the philosophical assumptions behind each viewpoint, with a special emphasis on their differences. Third, I discuss the philosophical implications of each viewpoint in the context of the recent discussion on the logic of scientific explanation for computer simulations. (shrink)

A chronicled approach to the notion of computer simulations shows that there are two predominant interpretations in the specialized literature. According to the first interpretation, computer simulations are techniques for finding the set of solutions to a mathematical model. I call this first interpretation the problem-solving technique viewpoint. In its second interpretation, computer simulations are considered to describe patterns of behavior of a target system. I call this second interpretation the description of patterns of behavior viewpoint of computer simulations. This (...) article explores these two interpretations of computer simulations from three different angles. First, I collect a series of definitions of computer simulation from the historical record. I track back definitions to the early 1960s and show how each viewpoint shares similar interpretations of computer simulations—ultimately clustering into the two viewpoints aforementioned. This reconstruction also includes the most recent literature. Second, I unpack the philosophical assumptions behind each viewpoint, with a special emphasis on their differences. Third, I discuss the philosophical implications of each viewpoint in the context of the recent discussion on the logic of scientific explanation for computer simulations. (shrink)

The paper presents an argument against a "metaphysical" conception of logic according to which logic spells out a specific kind of mathematical structure that is somehow inherently related to our factual reasoning. In contrast, it is argued that it is always an empirical question as to whether a given mathematical structure really does captures a principle of reasoning. (More generally, it is argued that it is not meaningful to replace an empirical investigation of a thing by an investigation of its (...) a priori analyzable structure without paying due attention to the question of whether it really is the structure of the thing in question.) It is proposed to elucidate the situation by distinguishing two essentially different realms with which our reason must deal: "the realm of the natural", constituted by the things of our empirical world, and "the realm of the formal", constituted by the structures that we use as "prisms" to view, to make sense of, and to reconstruct the world. It is suggested that this vantage point may throw light on many foundational problems of logic. (shrink)

The traditional view is that 'now’ is a pure indexical, denoting the utterance time. Yet, despite its initial appeal, the view has faced criticism. A range of data reveal 'now’ allows for discourse-bound (i.e., anaphoric) uses, and can occur felicitously with the past tense. The reaction to this has typically been to treat ‘now’ as akin to a true demonstrative, selecting the prominent time supplied by the non-linguistic context or prior discourse. We argue this is doubly mistaken. The first mistake (...) concerns the semantic value of ‘now’, which is not a time, but a state — the consequent state of a prominent event. The second is that ‘now’ is a pure indexical after all, insofar as its interpretation is determined without recourse to extra-linguistic supplementation. Specifically, we argue that any occurrence of 'now’ selects the consequent state of the most prominent event, where event-prominence is linguistically maintained through prominence-affecting updates contributed by coherence relations. Our analysis accounts straightforwardly for a wide range of discourse initial and discourse bound uses of ‘now’, while giving it a simple indexical meaning. (shrink)

Originally published in 1965. This is a textbook of modern deductive logic, designed for beginners but leading further into the heart of the subject than most other books of the kind. The fields covered are the Propositional Calculus, the more elementary parts of the Predicate Calculus, and Syllogistic Logic treated from a modern point of view. In each of the systems discussed the main emphases are on Decision Procedures and Axiomatisation, and the material is presented with as much formal (...) rigour as is compatible with clarity of exposition. The techniques used are not only described but given a theoretical justification. Proofs of Consistency, Completeness and Independence are set out in detail. The fundamental characteristics of the various systems studies, and their relations to each other are established by meta-logical proofs, which are used freely in all sections of the book. Exercises are appended to most of the chapters, and answers are provided. (shrink)

In his doctor's thesis [1], Henkin has shown that if a formal logic is consistent, and sufficiently complex, then it must admit a non-standard model. In particular, he showed that there must be a model in which that portion of the model which is supposed to represent the positive integers of the formal logic is not in fact isomorphic to the positive integers; indeed it is not even well ordered by what is supposed to be the relation of (...) ≦.For the purposes of the present paper, we do not need a precise definition of what is meant by a standard model of a formal logic. The non-standard models which we shall discuss will be flagrantly non-standard, as for instance a model of the sort whose existence is proved by Henkin. It will suffice if we and our readers are in agreement that a model of a formal logic is not a standard model if either: The relation in the model which represents the equality relation in the formal logic is not the equality relation for objects of the model. That portion of the model which is supposed to represent the positive integers of the formal logic is not well ordered by the relation ≦. That portion of the model which is supposed to represent the ordinal numbers of the formal logic is not well ordered by the relation ≦. (shrink)

A brief review of Carnap's formal program in philosophy of science.

We present and study the category of formal topologies and some of its variants. Two main results are proven. The first is that, for any inductively generated formal cover, there exists a formal topology whose cover extends in the minimal way the given one. This result is obtained by enhancing the method for the inductive generation of the cover relation by adding a coinductive generation of the positivity predicate. Categorically, this result can be rephrased by saying that (...) inductively generated formal topologies are coreflective into inductively generated formal covers. The second result is that unary formal covers are exponentiable in the category of inductively generated formal covers and hence, thanks to the coreflection, unary formal topologies are exponentiable in the category of inductively generated formal topologies. From a localic point of view the exponentiability of unary formal topologies means that algebraic dcpos are exponentiable in the category of open locales. But, the coreflection theorem states that open locales are coreflective in locales and hence, as a consequence of well-known impredicative results on exponentiable locales, it allows to prove that locally compact open locales are exponentiable in the category of open locales. (shrink)

Originally published in 1966. This is a self-instructional course intended for first-year university students who have not had previous acquaintance with Logic. The book deals with "propositional" logic by the truth-table method, briefly introducing axiomatic procedures, and proceeds to the theory of the syllogism, the logic of one-place predicates, and elementary parts of the logic of many-place predicates. Revision material is provided covering the main parts of the course. The course represents from eight to twenty hours work. depending on the (...) student's speed of work and on whether optional chapters are taken. (shrink)