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.

Kant’s theory of cognition centrally builds on his conception of self-consciousness and the transcendental use of the phrase “I think”: the ability to add the phrase “I think” to a representation is a necessary condition of the ability to cognize objects. The paper argues that “I think”, rather than denoting the content of a predicative judgement, is typically an expression of the subject’s thinking. It expresses a kind of self-consciousness that, without assertively representing the subject itself, indicates that representational contents (...) are unified in a single consciousness of a single subject. Our aim is thus to develop and defend an expressivist interpretation of Kant’s “I think”. (shrink)

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)

Kant's theory of cognition centrally builds on his conception of self‐consciousness and the transcendental use of the phrase “I think”: the ability to add the phrase “I think” to a representation is a necessary condition of the ability to cognize objects. The paper argues that “I think”, rather than denoting the content of a predicative judgement, is typically an expression of the subject's thinking. It expresses a kind of self‐consciousness that, without assertively representing the subject itself, indicates that representational contents (...) are unified in a single consciousness of a single subject. Our aim is thus to develop and defend an expressivist interpretation of Kant's “I think”. (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)

The paper analyzes the nature and scope of Moore’s paradox, articulates the desiderata of a successful solution and claims that psychological expressivism best meets these desiderata. After a brief discussion of prominent responses to Moore’s paradox, the paper offers a solution based on a theory of expressive acts: a Moorean utterance is absurd because the speaker expresses mental states with conflicting contents in commissive versions of the paradox and conflicting states of mind in omissive versions. The paper presents a theory (...) of expressivism for self-ascriptions of mental states. In addition, it introduces the idea of expressive denegation—the speaker’s expressing the absence of a mental state—as an analysis of negative self-ascriptions of mental states. Some of the consequences of expressivism for avowals are explored. (shrink)

It has recently been argued that some cases of naked statistical evidence license a high credence, but not an outright belief. If this is correct, there cannot be an unconditional bridge principle from credence to outright belief. We show that at least one prominent putative counterexample to such a bridge principle is based on a mistake, by demonstrating that the statistical evidence falls short not only of licensing rational belief, but also of justifying a high credence.

Prominent instances of anti-luck epistemology, in particular sensitivity and safety accounts of knowledge, introduce a modal condition on the pertinent belief in terms of closeness or similarity of possible worlds. Very roughly speaking, a belief must continue to be true in close possibilities in order to qualify as knowledge. Such closeness-accounts derive much support from their (alleged) ability to eliminate standard instances of epistemic luck as they appear in prominent Gettier-type examples. The article argues that there are new Gettier-type examples (...) which are grounded in “distant” epistemic luck. It is demonstrated that sensitivity and safety theories cannot handle such examples. (shrink)

Contents: Foreword. Wolfgang BALZER and C. ULISES MOULINES: Introduction. José A. DÍEZ CALZADA: Structuralist Analysis of Theories of Fundamental Measurement. Adolfo GARCÍA DE LA SIENRA and Pedro REYES: The Theory of Finite Games in Extensive Form. Hans Joachim BURSCHEID und Horst STRUVE: The Theory of Stochastic Fairness - its Historical Development, Formulation and Justification. Wolfgang BALZER and Richard MATTESSICH: Formalizing the Basis of Accounting. Werner DIEDERICH: A Reconstruction of Marxian Economics. Bert HAMMINGA and Wolfgang BALZER: The Basic (...) Structure of Neoclassical General Equilibrium Theory. Klaus MANHART: Balance Theories: Two Reconstructions and the Problem of Intended Applications. Rainer WESTERMANN: Festinger's Theory of Cognitive Dissonance: A Structuralist Theory-Net. Rainer REISENZEIN: Wundt's Three-Dimensional Theory of Emotion. Pablo LORENZANO: Classical Genetics and the Theory-Net of Genetics. Hinne HETTEMA and Theo A.F. KUIPERS: The Formalisation of the Periodic Table. C. ULISES MOULINES: The Basic Core of Simple Equilibrium Thermodynamics. Thomas BARTELBORTH: An Axiomatization of Classical Electrodynamics. Author's Index. Subject Index. (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 +.

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)

Quantum B-algebras, the partially ordered implicational algebras arising as subreducts of quantales, are introduced axiomatically. It is shown that they provide a unified semantic for non-commutative algebraic logic. Specifically, they cover the vast majority of implicational algebras like BCK-algebras, residuated lattices, partially ordered groups, BL- and MV-algebras, effect algebras, and their non-commutative extensions. The opposite of the category of quantum B-algebras is shown to be equivalent to the category of logical quantales, in the way that every quantum B-algebra admits a (...) natural embedding into a logical quantale, the enveloping quantale. Partially defined products of algebras related to effect algebras are handled efficiently in this way. The unit group of the enveloping quantale of a quantum B-algebra X is shown to be always contained in X, which gives a functorial subgroup X× of X. Similar subfunctors are obtained for the non-commutative extensions of BCK-algebras and effect algebras. The results of Galatos, Jónsson, and Tsinakis on the splitting of generalized BL-algebras into a semidirect product of a partially ordered group operating on an integral residuated poset are extended to a characterization of twisted semidirect products of a po-group by a quantum B-algebra. (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.