The now classical idea that programmed cell death contributes to a plethora of developmental processes still has lost nothing of its impact. It is, therefore, important to establish effective three-dimensional reconstruction as well as simulation techniques to decipher the exact patterns and functions of such apoptotic events. The present study focuses on the question whether and how apoptosis promotes neurulation-associated processes in the spinal cord of Tupaia belangeri. Our 3D reconstructions demonstrate that at least two craniocaudal waves of apoptosis consecutively (...) pass through the dorsal spinal cord. The first wave appears to be involved in neural fold fusion and/or in selection processes among premigratory neural crest cells. The second one seems to assist in establishing the dorsal signaling center known as the roof plate. In the hindbrain, in contrast, apoptosis among premigratory neural crest cells progresses craniocaudally but discontinuously, in a segment-specific manner. Unlike apoptosis in the spinal cord, these segment-specific apoptotic events, however, precede later ones that seemingly support neural fold fusion and/or postfusion remodeling. Arguing with Whitehead that biological patterns and rhythms differ in that biological rhythms depend “upon the differences involved in each exhibition of the pattern” we show that 3D reconstruction and simulation techniques can contribute to distinguish between patterns and rhythms of apoptosis. By deciphering novel patterns and rhythms of developmental apoptosis, our reconstructions help to reconcile seemingly inconsistent earlier findings in chick and mouse embryos, and to create rules for computer simulations. (shrink)

This book has grown out of eight years of close collaboration among its authors. From the very beginning we decided that its content should come out as the result of a truly common effort. That is, we did not "distribute" parts of the text planned to each one of us. On the contrary, we made a point that each single paragraph be the product of a common reflection. Genuine team-work is not as usual in philosophy as it is in other (...) academic disciplines. We think, however, that this is more due to the idiosyncrasy of philosophers than to the nature of their subject. Close collaboration with positive results is as rewarding as anything can be, but it may also prove to be quite difficult to implement. In our case, part of the difficulties came from purely geographic separation. This caused unsuspected delays in coordinating the work. But more than this, as time passed, the accumulation of particular results and ideas outran our ability to fit them into an organic unity. Different styles of exposition, different ways of formalization, different levels of complexity were simultaneously present in a voluminous manuscript that had become completely unmanageable. In particular, a portion of the text had been conceived in the language of category theory and employed ideas of a rather abstract nature, while another part was expounded in the more conventional set-theoretic style, stressing intui tivity and concreteness. (shrink)

The “official” history of connexive logic was written in 2012 by Storrs McCall who argued that connexive logic was founded by ancient logicians like Aristotle, Chrysippus, and Boethius; that it was further developed by medieval logicians like Abelard, Kilwardby, and Paul of Venice; and that it was rediscovered in the 19th and twentieth century by Lewis Carroll, Hugh MacColl, Frank P. Ramsey, and Everett J. Nelson. From 1960 onwards, connexive logic was finally transformed into non-classical calculi which partly concur with (...) systems of relevance logic and paraconsistent logic. In this paper it will be argued that McCall’s historical analysis is fundamentally mistaken since it doesn’t take into account two versions of connexivism. While “humble” connexivism maintains that connexive properties only apply to “normal” antecedents, “hardcore” connexivism insists that they also hold for “abnormal” propositions. It is shown that the overwhelming majority of the forerunners of connexive logic were only “humble” connexivists. Their ideas concerning connexive implication don’t give rise, however, to anything like a non-classical logic. (shrink)

The aim of the paper is to explicate the concept of causal independence between sets of factors and Reichenbach's screening-off-relation in probabilistic terms along the lines of Suppes' probabilistic theory of causality (1970). The probabilistic concept central to this task is that of conditional stochastic independence. The adequacy of the explication is supported by proving some theorems about the explicata which correspond to our intuitions about the explicanda.

Recently, Bengt Hansson presented a paper about dyadic deontic logic,2 criticizing some purely axiomatic systems of dyadic deontic logic and proposing three purely semantical systems of dyadic deontic logic which he confidently called dyadic standard systems of deontic logic (DSDL1–3). Here I shall discuss the third by far most interesting system DSDL3 which is operating with preference relations. First, I shall describe this semantical system (Sections 1.1–1.3). Then I shall give an axiomatic system (Section 1.4) which is proved to be (...) correct (Section 2) and complete (Section 3) with respect to Hansson's semantics. Finally, in face of these results Hansson's semantics will be discussed from a more intuitive standpoint. After emphasizing its intuitive attractiveness (Section 4.1) I will show that two objections often discussed in connection with preference relations do not apply to it (Section 4.2 and 4.3); more precisely, I will show that the connectedness condition for preference relations can be dropped and that, in a sense, it is not necessary to compare two possible worlds differing in infinitely many respects. (What exactly is meant by this, will become clear later on.) Yet there is a third objection to Hansson's semantics which points to a real intuitive inadequacy of DSDL3. A way of removing this inadequacy, which corresponds to Hansson's own intuitions as well as to familiar metaethical views, is suggested, but not technically realized (Section 4.4). In the last section (section 4.5) I shall briefly show that DSDL3 is decidable, as expected. (shrink)

I argue for the causal character of modeling in data-intensive science, contrary to widespread claims that big data is only concerned with the search for correlations. After discussing the concept of data-intensive science and introducing two examples as illustration, several algorithms are examined. It is shown how they are able to identify causal relevance on the basis of eliminative induction and a related difference-making account of causation. I then situate data-intensive modeling within a broader framework of an epistemology of scientific (...) knowledge. In particular, it is shown to lack a pronounced hierarchical, nested structure. The significance of the transition to such “horizontal” modeling is underlined by the concurrent emergence of novel inductive methodology in statistics such as non-parametric statistics. Data-intensive modeling is well equipped to deal with various aspects of causal complexity arising especially in the higher level and applied sciences. (shrink)

Recent claims, mainly from computer scientists, concerning a largely automated and model-free data-intensive science have been countered by critical reactions from a number of philosophers of science. The debate suffers from a lack of detail in two respects, regarding the actual methods used in data-intensive science and the specific ways in which these methods presuppose theoretical assumptions. I examine two widely-used algorithms, classificatory trees and non-parametric regression, and argue that these are theory-laden in an external sense, regarding the framing of (...) research questions, but not in an internal sense concerning the causal structure of the examined phenomenon. With respect to the novelty of data-intensive science, I draw an analogy to exploratory as opposed to theory-directed experimentation. (shrink)

We present a reconstruction of so-called classical, formal or Mendelian genetics using a notation which we believe is more legible than that of earlier accounts, and lends itself easily to computer implementation, for instance in PROLOG. By drawing from, and emending, earlier work of Balzer and Dawe (1986,1997), the present account presents the three most important lines of development of classical genetics: the so-called Mendel's laws, linkage genetics and gene mapping, in the form of a theory-net. This shows that the (...) set theoretic representation format used in the structuralist approach to the philosophy of science also applies to the domain of genetic theories. There construction is intended to lend more clarity to theme thodological, philosophical and didactical discussions of the foundations of genetics, and on the other hand to defend a formally, logically minded view of theories which seems to have become contested through the work of Feyerabend, Kuhn and Kitcher. (shrink)

We show that one can solve Post's Problem by constructing generic sets in the usual set theoretic framework applied to tiny universes. This method leads to a new class of recursively enumerable sets: r.e. generic sets. All r.e. generic sets are low and simple and therefore of Turing degree strictly between 0 and 0'. Further they supply the first example of a class of low recursively enumerable sets which are automorphic in the lattice E of recursively enumerable sets with inclusion. (...) We introduce the notion of a promptly simple set. This describes the essential feature of r.e. generic sets with respect to automorphism constructions. (shrink)

A comprehensive model for describing various forms of developments in science is defined in precise, set-theoretic terms, and in the spirit of the structuralist approach in the philosophy of science. The model emends previous accounts in centering on single systems in a homogenous way, eliminating notions which essentially refer to sets of systems. This is achieved by eliminating the distinction between theoretical and non-theoretical terms as a primitive, and by introducing the notion of intended links. The force of the model (...) is demonstrated by formally incorporating many of the important, precise meta-theoretic concepts occurring in the literature. (shrink)

Sections 1, 2 and 3 contain the main result, the strong finite axiomatizability of all 2-valued matrices. Since non-strongly finitely axiomatizable 3-element matrices are easily constructed the result reveals once again the gap between 2-valued and multiple-valued logic. Sec. 2 deals with the basic cases which include the important F i from Post's classification. The procedure in Sec. 3 reduces the general problem to these cases. Sec. 4 is a study of basic algebraic properties of 2-element algebras. In particular, we (...) show that equational completeness is equivalent to the Stone-property and that each 2-element algebra generates a minimal quasivariety. The results of Sec. 4 will be applied in Sec. 5 to maximality questions and to a matrix free characterization of 2-valued consequences in the lattice of structural consequences in any language. Sec. 6 takes a look at related axiomatization. problems for finite algebras and matrices. We study the notion of a propositional consequence with equality and, among other things, present explicit axiomatizations of 2-valued consequences with equality. (shrink)

One of the main controversies of the Logic Schools of the 12th century centered on the question: What follows from the impossible? In this paper arguments for two diametrically opposed positions are examined. The author of the ‘Avranches Text’ who probably belonged to the school of the Parvipontani defended the view that from an impossible proposition everything follows (‘Ex impossibili quodlibet’). In particular he developed a proof to show that by means of so-called ‘disjunctive syllogism’ any arbitrary proposition B can (...) be logically derived from a pair of contradictory propositions A and Not-A. The author of the Ars Meliduna instead argued that nothing follows from an impossible proposition (‘ex falso nihil sequitur’). This view is supported by various counterexamples which aimed to show that the admission of impossible premises would give rise to inconsistent conclusions. Upon closer analysis these inconsistencies do not, however, have the formal structure of a real contradiction like A and Not-A, but rather the structure of two rivalling conditionals like ‘If B then A’ and ‘If B then Not-A’. Hence these counterexamples rather have to be considered as refutations of the basic principles of ‘connexive logic’. (shrink)

We provide a finite axiomatization of the consequence , i.e. of the set of common sequential rules for and . Moreover, we show that has no proper non-trivial strengthenings other than and . A similar result is true for , but not, e.g., for +.

Analogical reasoning addresses the question how evidence from various phenomena can be combined and made relevant for theory development and prediction. In the first part of my contribution, I review some influential accounts of analogical reasoning, both historical and contemporary, focusing in particular on Keynes, Carnap, Hesse, and more recently Bartha. In the second part, I sketch a general framework. To this purpose, a distinction between a predictive and a conceptual type of analogical reasoning is introduced. I then take up (...) a common intuition according to which analogical inferences hold if the differences between source and target concern only irrelevant circumstances. I attempt to make this idea more precise by addressing possible objections and in particular by specifying a notion of causal irrelevance based on difference making in homogeneous contexts. (shrink)

It is shown that the class of Kolmogorov-Loveland stochastic sequences is not closed under selecting subsequences by monotonic computable selection rules. This result gives a strong negative answer to the question whether the Kolmogorov-Loveland stochastic sequences are closed under selecting sequences by Kolmogorov-Loveland selection rules, i.e., by not necessarily monotonic, partial computable selection rules. The following previously known results are obtained as corollaries. The Mises-Wald-Church stochastic sequences are not closed under computable permutations, hence in particular they form a strict superclass (...) of the class of Kolmogorov-Loveland stochastic sequences. The Kolmogorov-Loveland selection rules are not closed under composition. (shrink)

The key message of this book is that we come to know our own mental states, not by peering inward, but by focusing on the aspects of the external world to which we are intentionally related in virtue of having the mental states in question. Though many philosophers think that the idea of transparency, as it is called, may apply to self-knowledge of some mental states, it is often regarded as hopeless to widen its scope to self-knowledge of mental states (...) in general—for it seems that not all mental states make us aware of aspects of the external world. Barz rejects this view and take pains to show that the idea of transparency does apply across the board: not only to beliefs and visual experiences, but also to desires, intentions, bodily sensations and emotions. For this purpose, Barz carefully rethinks the nature of mind. He thereby develops, among other things, an original account of episodic mental states, challenges the orthodox view of propositional content and presents an account of emotions which integrates aspects of both cognitivist and non-cognitivist approaches. (shrink)

It is shown that the class of reduced matrices of a logic is a 1 st order -class provided the variety associated with has the finite replacement property in the sense of [7]. This applies in particular to all 2-valued logics. For 3-valued logics the class of reduced matrices need not be 1 st order.