The usual treatment of a dinner table utterance of ‘Can you pass the salt?’ is that it involves an indirect request to pass the salt as well as a direct question about the hearer’s ability to do so: an indirect speech act. These are held to involve two illocutionary forces and two illocutionary acts. Rod Bertolet has raised doubts about whether consideration of such examples warrants the postulation of indirect speech acts and illocutionary forces other than the literal ones. In (...) a recent article, Mary Kate McGowan, Shan Shan Tam, and Margaret Hall claim to show that these doubts are unfounded. The purpose of this paper is to show that they have not established this. (shrink)

The first edition, published by Acumen in 2000, became a prescribed textbook on modal logic courses. The second edition has been fully revised in response to readers' suggestions, including two new chapters on conditional logic, which was not covered in the first edition. "Modal Logics and Philosophy" is a fully comprehensive introduction to modal logics and their application suitable for course use. Unlike most modal logic textbooks, which are both forbidding mathematically and short on philosophical discussion, "Modal Logics and Philosophy" (...) places its emphasis firmly on showing how useful modal logic can be as a tool for formal philosophical analysis. In part 1 of the book, the reader is introduced to some standard systems of modal logic and encouraged through a series of exercises to become proficient in manipulating these logics. The emphasis is on possible world semantics for modal logics and the semantic emphasis is carried into the formal method, Jeffrey-style truth-trees. Standard truth-trees are extended in a simple and transparent way to take possible worlds into account. Part 2 systematically explores the applications of modal logic to philosophical issues such as truth, time, processes, knowledge and belief, obligation and permission. (shrink)

We report on some recent work centered on attempts to understand when one set is more random than another. We look at various methods of calibration by initial segment complexity, such as those introduced by Solovay [125], Downey, Hirschfeldt, and Nies [39], Downey, Hirschfeldt, and LaForte [36], and Downey [31]; as well as other methods such as lowness notions of Kučera and Terwijn [71], Terwijn and Zambella [133], Nies [101, 100], and Downey, Griffiths, and Reid [34]; higher level randomness notions (...) going back to the work of Kurtz [73], Kautz [61], and Solovay [125]; and other calibrations of randomness based on definitions along the lines of Schnorr [117].These notions have complex interrelationships, and connections to classical notions from computability theory such as relative computability and enumerability. Computability figures in obvious ways in definitions of effective randomness, but there are also applications of notions related to randomness in computability theory. For instance, an exciting by-product of the program we describe is a more-or-less naturalrequirement-freesolution to Post's Problem, much along the lines of the Dekker deficiency set. (shrink)

Robert I. Soare, Automorphisms of the Lattice of Recursively Enumerable Sets. Part I: Maximal Sets.Manuel Lerman, Robert I. Soare, $d$-Simple Sets, Small Sets, and Degree Classes.Peter Cholak, Automorphisms of the Lattice of Recursively Enumerable Sets.Leo Harrington, Robert I. Soare, The $\Delta^0_3$-Automorphism Method and Noninvariant Classes of Degrees.

Traces the development of recursive functions from their origins in the late nineteenth century to the mid-1930s, with particular emphasis on the work and influence of Kurt Gödel.

As a natural example of a 1-random real, Chaitin proposed the halting probability Ω of a universal prefix-free machine. We can relativize this example by considering a universal prefix-free oracle machine U. Let [Formula: see text] be the halting probability of UA; this gives a natural uniform way of producing an A-random real for every A ∈ 2ω. It is this operator which is our primary object of study. We can draw an analogy between the jump operator from computability theory (...) and this Omega operator. But unlike the jump, which is invariant under the choice of an effective enumeration of the partial computable functions, [Formula: see text] can be vastly different for different choices of U. Even for a fixed U, there are oracles A =* B such that [Formula: see text] and [Formula: see text] are 1-random relative to each other. We prove this and many other interesting properties of Omega operators. We investigate these operators from the perspective of analysis, computability theory, and of course, algorithmic randomness. (shrink)

A splitting of an r.e. set A is a pair A1, A2 of disjoint r.e. sets such that A1 A2 = A. Theorems about splittings have played an important role in recursion theory. One of the main reasons for this is that a splitting of A is a decomposition of A in both the lattice, , of recursively enumerable sets and in the uppersemilattice, R, of recursively enumerable degrees . Thus splitting theor ems have been used to obtain results about (...) the structure of , the structure of R, and the relationship between the two structures. Furthermore it is fair to say that questions about splittings have often generated important new technical developments in recursion theory. In this article we survey most of the results and techniques associated with splitting properties of r.e. sets in ordinary recursion theory. (shrink)

Ever since Saul Kripke and others developed a semantic interpretation for modal logic, 'possible worlds' has been a much debated issue in contemporary metaphysics. To propose the idea of a possible world that differs in some way from our actual world - for example a world where the grass is red or where no people exist - can help us to analyse and understand a wide range of philosophical concepts, such as counterfactuals, properties, modality, and of course, the notions of (...) possibility and necessity. This book examines the ways in which possible worlds have been used as a framework for considering problems in logic and argument analysis. The book begins with a non-technical introduction to the basic ideas of modal logic in terms of Kripke's possible worlds and then moves on to a discussion of 'possible for' and 'possible that'. The central chapters examine questions of meaning, epistemic possibility, temporal logic, metaphysics, and impossibility. Girle also investigates how the idea of a possible world can be put to use in different areas of philosophy, the problems it may raise, and the benefits that can be gained. (shrink)

We examine the randomness and triviality of reals using notions arising from martingales and prefix-free machines.

We describe punctual categoricity in several natural classes, including binary relational structures and mono-unary functional structures. We prove that every punctually categorical structure in a finite unary language is${\text {PA}}(0')$-categorical, and we show that this upper bound is tight. We also construct an example of a punctually categorical structure whose degree of categoricity is$0''$. We also prove that, with a bit of work, the latter result can be pushed beyond$\Delta ^1_1$, thus showing that punctually categorical structures can possess arbitrarily complex (...) automorphism orbits.As a consequence, it follows that binary relational structures and unary structures are not universal with respect to primitive recursive interpretations; equivalently, in these classes every rich enough interpretation technique must necessarily involve unbounded existential quantification or infinite disjunction. In contrast, it is well-known that both classes are universal for Turing computability. (shrink)

We construct the set of the title, answering a question of Cholak, Jockusch, and Slaman [1], and discuss its connections with the study of the proof-theoretic strength and effective content of versions of Ramsey's Theorem. In particular, our result implies that every ω-model of RCA 0 + SRT 2 2 must contain a nonlow set.

First Published in 2003. Routledge is an imprint of Taylor & Francis, an informa company.

We prove that there exists a noncomputable c.e. real which is low for weak 2-randomness, a definition of randomness due to Kurtz, and that all reals which are low for weak 2-randomness are low for Martin-Löf randomness.

We characterize the class of c.e. degrees that bound a critical triple as those degrees that compute a function that has no ω-c.e. approximation.

We introduce a new hierarchy of computably enumerable degrees. This hierarchy is based on computable ordinal notations measuring complexity of approximation of${\rm{\Delta }}_2^0$functions. The hierarchy unifies and classifies the combinatorics of a number of diverse constructions in computability theory. It does so along the lines of the high degrees (Martin) and the array noncomputable degrees (Downey, Jockusch, and Stob). The hierarchy also gives a number of natural definability results in the c.e. degrees, including a definable antichain.

We give a proof of a theorem of Harrington that there is no orbit of the lattice of recursively enumerable sets containing elements of each nonzero recursively enumerable degree. We also establish some degree theoretical extensions.

A problem is a multivalued function from a set of instances to a set of solutions. We consider only instances and solutions coded by sets of integers. A problem admits preservation of some computability-theoretic weakness property if every computable instance of the problem admits a solution relative to which the property holds. For example, cone avoidance is the ability, given a noncomputable set A and a computable instance of a problem ${\mathsf {P}}$, to find a solution relative to which A (...) is still noncomputable.In this article, we compare relativized versions of computability-theoretic notions of preservation which have been studied in reverse mathematics, and prove that the ones which were not already separated by natural statements in the literature actually coincide. In particular, we prove that it is equivalent to admit avoidance of one cone, of $\omega $ cones, of one hyperimmunity or of one non- $\Sigma ^{0}_1$ definition. We also prove that the hierarchies of preservation of hyperimmunity and non- $\Sigma ^{0}_1$ definitions coincide. On the other hand, none of these notions coincide in a nonrelativized setting. (shrink)

In their book, Darwinism Evolving: Systems Dynamics and the Genealogy of Natural Selection, Depew and Weber argued for the need to address the relationship between self-organization and natural selection in evolutionary theory, and focused on seven “visions” for doing so. Recently, Batten et al. in a paper in this journal, entitled “Visions of evolution: self-organization proposes what natural selection disposes,” picked up the issue with the work of Depew and Weber as a starting point. While the efforts of both sets (...) of authors are to be commended, there are substantive errors in both the presentations of my work and of my work with colleagues that undermine theirs. My purpose here is to correct the errors in question, thereby removing the undermining effects and in so doing reassert the position my colleagues and I first advanced more than two decades ago, and that I still stand by and argue for today. The central points are as follows: Self-organization or spontaneous ordering is a process of selection; this selection process is governed by a “physical selection principle”; this principle is the law of maximum entropy production; and natural selection is a special case where the components are replicating. (shrink)

The theorem of the title is proven, solving an old question of Remmel. The method of proof uses an algebraic technique of Remmel-Vaught combined with a complex tree of strategies argument where the true path is needed to figure out the final isomorphism.

A splitting A1A2 = A of an r.e. set A is called a Friedberg splitting if for any r.e. set W with W — A not r.e., W — Ai≠0 for I = 1,2. In an earlier paper, the authors investigated Friedberg splittings of maximal sets and showed that they formed an orbit with very interesting degree-theoretical properties. In the present paper we continue our investigations, this time analyzing Friedberg splittings and in particular their orbits and degrees for various classes (...) of r.e. sets. (shrink)

We classify the asymptotic densities of the sets according to their level in the Ershov hierarchy. In particular, it is shown that for, a real is the density of an n‐c.e. set if and only if it is a difference of left‐ reals. Further, we show that the densities of the ω‐c.e. sets coincide with the densities of the sets, and there are ω‐c.e. sets whose density is not the density of an n‐c.e. set for any.

Generalized Darwinism (GD) claims to be a conceptual and theoretical framework for researching evolutionary change processes in organizations. This paper examines the claims of GD. It finds that in contrast to Darwin’s theory of evolution by natural selection proper, the GD framework is not an explanatory deductive argument form. What it is that GD actually generalizes and intends to explain thereby becomes somewhat moot. It is proposed that the so-called ‘generalization’ that the GD framework supplies might be best understood schematically. (...) Two general schemata that purport to distil commonalities between processes of organizational evolution and biological evolution are thereby identified. But in considering the applicability of the two schemata to organizational evolution, criticism reveals one to be problematic, whereas the other one, to which the GD programme collapses if the problematical schema is dispensed with, has been long associated with another so-called ‘evolutionary approach’ to the understanding of social change: Sir Karl Popper’s ‘evolutionary epistemology’. The paper concludes that if the research problem is to account for the evolutionary character of social and organizational change, then theorists need not commit to the GD framework. They may elect to use Popper’s evolutionary epistemology instead. (shrink)

The new edition of this widely used and respected textbook includes three new chapters on conditional logic. Other chapters have been revised and updated, making the second edition a fully comprehensive introduction to modal logics and their application. Unlike most modal logic textbooks, which are both forbidding mathematically and short on philosophical discussion, Modal Logics and Philosophy focuses on showing how useful modal logic can be as a tool for formal philosophical analysis. In Part 1, the reader is introduced to (...) some standard systems of modal logic and provided with a series of exercises that encourage proficiency in manipulating these logics. Girle emphasizes possible world semantics for modal logics and its formal method, Jeffrey-style truth-trees, in which standard truth-trees are extended in a simple and transparent way to take possible worlds into account. Part 2 explores the applications of modal logic to philosophical issues such as truth, time, processes, knowledge and belief, and obligation and permission. (shrink)

In Plato on the Unity of the Virtues, Rod Jenks argues that while Plato makes several attempts to show how virtue is one, he deliberately fails to secure this because he thinks the way in which the virtues are both one and many is finally ineffable.

Uses Sir Karl Popper’s philosophy of critical rationalism to examine the discussion of the UK ‘credit crunch’ as presented by the public record of the UK House of Commons Treasury Select Committee’s investigation. Identifies various philosophical doctrines that acted to shape that investigation and the testimony presented before it. Presents those doctrines as prejudicial to the advancement of knowledge, learning and rationality. Concludes that the philosophy of critical rationalism is relevant to the problems of modern society.

We study the Turing degrees which contain a real of effective packing dimension one. Downey and Greenberg showed that a c.e. degree has effective packing dimension one if and only if it is not c.e. traceable. In this paper, we show that this characterization fails in general. We construct a real $A\leq_T\emptyset''$ which is hyperimmune-free and not c.e. traceable such that every real $\alpha\leq_T A$ has effective packing dimension 0. We construct a real $B\leq_T\emptyset'$ which is not c.e. traceable such (...) that every real $\alpha\leq_T B$ has effective packing dimension 0. (shrink)

This paper revisits some recent contributions on ‘Why Management Theory Needs Popper’ to the journal Philosophy of Management. It proposes that those discussions provided an appraisal of the relevance of Popper’s falsification schema to management theory, but that they did not thereby bring to the fore all of the issues pertinent to a balanced and well-rounded understanding of Popper’s philosophy of critical rationalism. It is argued that such an understanding requires a discussion of what Popper himself declared to be the (...) real lynchpin of his thought: fallibilism and a critical approach. It is noted that this represents a rejection of the historical problem situation of philosophy — that knowledge claims need to be positively justified as true. It is argued that this rejection implies an anti-authoritarian, non-justificational philosophy based on the use of critical reason. Its application to several different objects of criticism is demonstrated and its ethical dimensions are explored. The relevance of critical rationalism to management studies and practice is assessed and an inherent limitation on the prospects of its adoption in management practice is identified. … the appeal to authorities is the death of knowledge… the growth of knowledge depends entirely upon disagreement. (shrink)

In this paper, we solve a long-standing open question, about the spectrum of the successivity relation on a computable linear ordering. We show that if a computable linear ordering [Formula: see text] has infinitely many successivities, then the spectrum of the successivity relation is closed upwards in the computably enumerable Turing degrees. To do this, we use a new method of constructing [Formula: see text]-isomorphisms, which has already found other applications such as Downey, Kastermans and Lempp [9] and is of (...) independent interest. It would seem to promise many further applications. (shrink)