Several quantitative techniques for choosing among data models are available. Among these are techniques based on algorithmic information theory, minimum description length theory, and the Akaike information criterion. All these techniques are designed to identify a single model of a data set as being the closest to the truth. I argue, using examples, that many data sets in science show multiple patterns, providing evidence for multiple phenomena. For any such data set, there is more than one data model that must (...) be considered close to the truth. I conclude that, since the established techniques for choosing among data models are unequipped to handle these cases, they cannot be regarded as adequate. ‡I presented a previous version of this paper at the 20th Biennial Meeting of the Philosophy of Science Association, Vancouver, November 2006. I am grateful to the audience for constructive discussion. I thank Leiden University students Marjolein Eysink Smeets and Lenneke Schrier for suggesting the cortisol example, and Remko van der Geest for comments on a draft. †To contact the author, please write to: Faculty of Philosophy, University of Leiden, P.O. Box 9515, 2300 RA Leiden, The Netherlands; e-mail: j.w.mcallister@let.leidenuniv.nl. (shrink)

Brit J Aesthetics DOI:_ 10.1093/aesthj/ayz041 _.

A total of 1918 loci, detected by the hybridization of 938 expressed sequence tag unigenes from 26 Triticeae cDNA libraries, were mapped to wheat homoeologous group 4 chromosomes using a set of deletion, ditelosomic, and nulli-tetrasomic lines. The 1918 EST loci were not distributed uniformly among the three group 4 chromosomes; 41, 28, and 31% mapped to chromosomes 4A, 4B, and 4D, respectively. This pattern is in contrast to the cumulative results of EST mapping in all homoeologous groups, as reported (...) elsewhere, that found the highest proportion of loci mapped to the B genome. Sixty-five percent of these 1918 loci mapped to the long arms of homoeologous group 4 chromosomes, while 35% mapped to the short arms. The distal regions of chromosome arms showed higher numbers of loci than the proximal regions, with the exception of 4DL. This study confirmed the complex structure of chromosome 4A that contains two reciprocal translocations and two inversions, previously identified. An additional inversion in the centromeric region of 4A was revealed. A consensus map for homoeologous group 4 was developed from 119 ESTs unique to group 4. Forty-nine percent of these ESTs were found to be homoologous to sequences on rice chromosome 3, 12% had matches with sequences on other rice chromosomes, and 39% had no matches with rice sequences at all. Limited homology was found between wheat ESTs on homoeologous group 4 and the Arabidopsis genome. Forty-two percent of the homoeologous group 4 ESTs could be classified into functional categories on the basis of blastX searches against all protein databases. (shrink)

I wish to thank Klaus Kühnle who streamlined in [8] several of my definitions and proofs concerning the subject matter of this paper. Some ideas and results arose from discussions with Klaus Leeb. Jan Johannsen discovered some mistakes in an earlier version.

My reason for bringing up the familiar matter of phenomenalism is both critical and historical. Almost to a man those who have been interested in arguing for or against phenomenalism have assumed that Berkeley was a phenomenalist. Now if Berkeley's doctrine is appropriately named “phenomenalism,” then it is a phenomenalism of a quite different stripe from the twentieth century variety, though many who have described his doctrine as phenomenalism have not sufficiently stressed the difference.

Although the theory of definability had many important antecedents—such as the descriptive set theory initiated by the French semi-intuitionists in the early 1900s—the main ideas were first laid out in precise mathematical terms by Alfred Tarski beginning in 1929. We review here the basic notions of languages, explicit definability, and grammatical complexity, and emphasize common themes in the theories of definability for four important languages underlying, respectively, descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic. We review (...) the history of previous studies of the similarities and differences in the theories of definability of the first three of these four languages. A seminal role leading toward unification of the theories has been played by the separation principles introduced by Nikolai Luzin in 1927. Emphasizing analogies and driving toward further unification embracing finite-universe logic we concentrate on a simple example—the first and second separation principles for existential-universal first-order sentences . Using this as a test case for the fundamental problem of how to “finitize” arguments in classical pure logic to the finite-universe case, we are led to the analogous negative solution by using the theory of certain special graphs: a graph is - special for any positive integers m , n , p , q iff it is bipartite with m red points and n blue points and for every p -tuple of red points there is a blue point to which they are all connected . As an aside we introduce for further study a natural “Ramseyesque” increasing sequence A of positive integers, where A is the least positive integer n for which an -special graph exists. (shrink)

Recently a growing number of biologists have begun to consider the causal role that processes of embryonic development may play in evolution. This constitutes a reunion of these phenomena which had been linked in the nineteenth century through Haeckel's biogenetic law. This reunion may result in a new subdiscipline of biology, if there is a set of unique concepts and methods which tie the various research approaches together. Such concepts as bauplan, canalization, and developmental constraint, may serve in such a (...) capacity. The methods employed must combine comparative and experimental analyses, with special attention paid to the range of variation in developmental events within each taxon. These concepts and methods are also applicable to the problem of how development evolved, thus the evolution of development may also be considered part of the reunion. The reunion is discussed in terms of the potential participation of various schools of thought found in the current literature. (shrink)

The purpose of this brief introduction is to describe the origin of the papers here presented and to acknowledge the help of some of the many individuals who were involved in the preparation of this volume. Of the eighteen papers, nine stem from the annual fall colloquium of the Depart ment of Philosophy at the University of Western Ontario held in London, Ontario from November 10 to November 12, 1967. The colloquium was entitled 'Philosophical Logic'. After some discussion, the editors (...) decided to retain that title for this volume. Von Wright's paper 'On the Logic and Ontology of Norms' is printed here after some revision. A. R. Anderson commented on the paper at the colloquium, but his comments here are based upon the revised version of the von Wright paper. The chairman of the session at which von Wright's paper was read and discussed was T. A. Goudge. Aqvist's paper 'Scattered Topics in Interrogative Logic', and Belnap's comments, 'Aqvist's Cor rections-Accumulating Question-Sequences', are printed as delivered. The chairman of the Aqvist-Belnap session was R. E. Butts. Wilfrid Sellars' paper 'Some Problems about Belief' is printed as delivered at the col loquium, but 'Quantifiers, Beliefs, and Sellars' by Ernest Sosa is a revision of his comments at the colloquium. That session was chaired by G. D. W. Berry. Ackermann's paper 'Some Problems oflnductive Logic', as well as Skyrms' comments, are printed as delivered. (shrink)

For each regular cardinal κ, we set up three systems of infinitary type logic, in which the length of the types and the length of the typed syntactical constructs are $\Sigma _{}$, the global system $\text{g}\Sigma _{}$ and the τ-system $\tau \Sigma _{}$. A full cut elimination theorem is proved for the local systems, and about the τ-systems we prove that they admit cut-free proofs for sequents in the τ-free language common to the local and global systems. These two results (...) follow from semantic completeness proofs. Thus every sequent provable in a global system has a cut-free proof in the corresponding τ-systems. It is, however, an open question whether the global systems in themselves admit cut elimination. (shrink)

We propose the beginnings of an intuitionistic propopsitional dynamic logic, and describe several serious open problems.