Wolfgang Spohn's theory of ranking functions is an elegant and powerful theory of the structure and dynamics of doxastic states. In two recent papers, Spohn has applied it to the analysis of conditionals, claiming to have presented a unified account of indicative and subjunctive (counterfactual) conditionals. I argue that his analysis fails to account for counterfactuals that refer to indirect causes. The strategy of taking the transitive closure that Spohn employs in the theory of causation is not available for (...) counterfactuals. I have a close look at Spohn's treatment of the famous Oswald-Kennedy case in order to illustrate my points. I sketch an alternative view that seems to avoid the problems. (shrink)

Die Welt ist alles, was wir in unseren naturwissenschaftlichen Theorien beschreiben konnen so eine weit verbreitete Uberzeugung, die seit den Tagen des Positivismus unser Weltbild bestimmt. Aber reicht das tatsachlich schon aus? Wer sich am Ideal der wissenschaftlichen Erkenntnis orientiert, neigt dazu, viele nicht-begriffliche Erfahrungsformen zu unterschlagen, die uns aus dem Alltag vertraut sind: Symbolsysteme wie Musik, Literatur oder Bilder, Instanzen der unmittelbaren Erfahrung wie Anschauung, Wahrnehmung oder Gefuhl und den Bereich des praktischen Konnens. In der Regel sind wir nicht (...) in der Lage, den Gehalt dieser Phanomene vollstandig begrifflich wiederzugeben. Dennoch ist das weite Feld des Nichtbegrifflichen eine unverzichtbare Voraussetzung unserer Satze und Gedanken: Ohne Kunst, Wahrnehmung und Handeln gibt es kein Denken, keine Wissenschaft, keine Philosophie. Der Band geht der Vielfalt des Nicht-Begrifflichen in asthetischen, symboltheoretischen und semantischen Untersuchungen nach. Aus ihnen ergibt sich ein umfassender systematischer Uberblick uber eines der spannendsten und offensten Problemfelder der aktuellen philosophischen Debatte. Mit Beitragen von: Andreas Bartels, Uwe Baumann, Volker Beeh, Gottfried Boehm, Olaf Breidbach, Joachim Bromand, Gottfried Gabriel, Markus Gabriel, Ernest Wolf Gazo, Annemarie Gethmann-Siefert, Jurgen Goldstein, Jens Halfwassen, Thomas Soren Hoffmann, Wolfgang Harms, Jochen Horisch, Peter Janich, Guilherme F. R. Kisteumacher, Jakub Kloc-Konkolowicz, Imi Knoebel, Theo Kobusch, Klaus-M. Kodalle, Sibylle Kramer, Guido Kreis, Wolfgang Kubin, Sonke Lorenz, Antonio Cota Marcal, Aliasghar Mosleh, Theodoros Penolidis, Dominik Perler, Hans-Joachim Pieper, Andrzej Przylebski, Birgit Sandkaulen, Matthias Schmoeckel, Oswald Schwemmer, Josef Simon, Pirmin Stekeler-Weithofer, Dieter Teichert, Kai Vogeley, Gottfried Willems und Gereon Wolters". (shrink)

Die Welt ist alles, was wir in unseren naturwissenschaftlichen Theorien beschreiben können – so eine weit verbreitete Überzeugung, die seit den Tagen des Positivismus unser Weltbild bestimmt. Aber reicht das tatsächlich schon aus? Wer sich am Ideal der wissenschaftlichen Erkenntnis orientiert, neigt dazu, viele nicht-begriffliche Erfahrungsformen zu unterschlagen, die uns aus dem Alltag vertraut sind: Symbolsysteme wie Musik, Literatur oder Bilder, Instanzen der unmittelbaren Erfahrung wie Anschauung, Wahrnehmung oder Gefühl und den Bereich des praktischen Könnens. In der Regel sind wir (...) nicht in der Lage, den Gehalt dieser Phänomene vollständig begrifflich wiederzugeben. Dennoch ist das weite Feld des Nichtbegrifflichen eine unverzichtbare Voraussetzung unserer Sätze und Gedanken: Ohne Kunst, Wahrnehmung und Handeln gibt es kein Denken, keine Wissenschaft, keine Philosophie. Der Band geht der Vielfalt des Nicht-Begrifflichen in ästhetischen, symboltheoretischen und semantischen Untersuchungen nach. Aus ihnen ergibt sich ein umfassender systematischer Überblick über eines der spannendsten und offensten Problemfelder der aktuellen philosophischen Debatte. Mit Beiträgen von: Andreas Bartels, Uwe Baumann, Volker Beeh, Gottfried Boehm, Olaf Breidbach, Joachim Bromand, Gottfried Gabriel, Markus Gabriel, Ernest Wolf Gazo, Annemarie Gethmann-Siefert, Jürgen Goldstein, Jens Halfwassen, Thomas Sören Hoffmann, Wolfgang Harms, Jochen Hörisch, Peter Janich, Guilherme F. R. Kisteumacher, Jakub Kloc-Konkolowicz, Imi Knoebel, Theo Kobusch, Klaus-M. Kodalle, Sibylle Krämer, Guido Kreis, Wolfgang Kubin, Sönke Lorenz, Antonio Cota Marçal, Aliasghar Mosleh, Theodoros Penolidis, Dominik Perler, Hans-Joachim Pieper, Andrzej Przylebski, Birgit Sandkaulen, Matthias Schmoeckel, Oswald Schwemmer, Josef Simon, Pirmin Stekeler-Weithofer, Dieter Teichert, Kai Vogeley, Gottfried Willems und Gereon Wolters. (shrink)

Kolloquiumsbeiträge des XV. Deutschen Kongresses für Philosophie 1990 in Hamburg. Mit Beiträgen von Herbert Schnädelbach, Hilary Putnam, Karl-Otto Apel, Walter Ch. Zimmerli, Rudolf A. Makkreel, Wolfgang Bartuschat, Elke Hahn und Klaus Vieweg, Roland Simon-Schaefer, Ruedi Imbach, Georg Wieland, Jan Peter Beckmann, Pierre Aubenque, Annemarie Gethmann-Siefert, Gernot Böhme, Dietrich Böhler, Jürgen Habermas, Friedrich Kambartel, Oswald Schwemmer, Dieter Birnbacher, Karl-Friedrich Wessel, Friedrich Rapp, Otfried Höffe, Henning Ottmann und Terry Pinkard.

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)

According to the classical quantificational analysis of modals, an agent has the ability to perform an act iff relevant facts about the agent and her environment are compatible with her performing the act. The analysis faces a number of problems, many of which can be traced to the fact that it takes even accidental performance of an act as proof of the relevant ability. I argue that ability statements are systematically ambiguous: on one reading, accidental performance really is enough; on (...) another, more is required. The stronger notion of ability plays a central role in normative contexts. Both readings, I argue, can be captured within the classical quantificational framework, provided we allow conversational context to impose restrictions not just on the “accessible worlds”, but also on what counts as a performance of the relevant act among these worlds. (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)

Rational agents are supposed to maximize expected utility. But what are the options from which they choose? I outline some constraints on an adequate representation of an agent’s options. The options should, for example, contain no information of which the agent is unsure. But they should be sufficiently rich to distinguish all available acts from one another. These demands often come into conflict, so that there seems to be no adequate representation of the options at all. After reviewing existing proposals (...) for how to construe decision-theoretic options and finding them all wanting, I suggest that our model of rational agents should include a special domain of ‘virtual’ option propositions to serve as formal objects of deliberation and choice. (shrink)

There seem to be two ways of supposing a proposition: supposing “indicatively” that Shakespeare didn’t write Hamlet, it is likely that someone else did; supposing “subjunctively” that Shakespeare hadn’t written Hamlet, it is likely that nobody would have written the play. Let P be the probability of B on the subjunctive supposition that A. Is P equal to the probability of the corresponding counterfactual, A □→B? I review recent triviality arguments against this hypothesis and argue that they do not succeed. (...) On the other hand, I argue that even if we can equate P with P, we still need an account of how subjunctive conditional probabilities are related to unconditional probabilities. The triviality arguments reveal that the connection is not as straightforward as one might have hoped. (shrink)

It is widely held that if an object a is identical (or non-identical) to an object b, then it is necessary that a is identical (non-identical) to b. This view is supported an argument from Leibniz's Law and a popular conception of de re modality. On the other hand, there are good reasons to allow for contingent identity. Various alternative accounts of de re modality have been developed to achieve this kind of generality, and to explain what is wrong with (...) the argument from Leibniz's Law. (shrink)

Research Integrity (RI) is high on the agenda of both institutions and science policy. The European Union as well as national ministries of science have launched ambitious initiatives to combat misconduct and breaches of research integrity. Often, such initiatives entail attempts to regulate scientific behavior through guidelines that institutions and academic communities can use to more easily identify and deal with cases of misconduct. Rather than framing misconduct as a result of an information deficit, we instead conceptualize Questionable Research Practices (...) (QRPs) as attempts by researchers to reconcile epistemic and social forms of uncertainty in knowledge production. Drawing on previous literature, we define epistemic uncertainty as the inherent intellectual unpredictability of scientific inquiry, while social uncertainty arises from the human-made conditions for scientific work. Our core argument—developed on the basis of 30 focus group interviews with researchers across different fields and European countries—is that breaches of research integrity can be understood as attempts to loosen overly tight coupling between the two forms of uncertainty. Our analytical approach is not meant to relativize or excuse misconduct, but rather to offer a more fine-grained perspective on what exactly it is that researchers want to accomplish by engaging in it. Based on the analysis, we conclude by proposing some concrete ways in which institutions and academic communities could try to reconcile epistemic and social uncertainties on a more collective level, thereby reducing incentives for researchers to engage in misconduct. (shrink)

We define classes Φnof formulae of first-order arithmetic with the following properties:(i) Everyφϵ Φnis classically equivalent to a Πn-formula (n≠ 1, Φ1:= Σ1).(ii)(iii)IΠnandiΦn(i.e., Heyting arithmetic with induction schema restricted to Φn-formulae) prove the same Π2-formulae.We further generalize a result by Visser and Wehmeier. namely that prenex induction within intuitionistic arithmetic is rather weak: After closing Φnboth under existential and universal quantification (we call these classes Θn) the corresponding theoriesiΘnstill prove the same Π2-formulae. In a second part we consideriΔ0plus collection-principles. We (...) show that both the provably recursive functions and the provably total functions ofare polynomially bounded. Furthermore we show that the contrapositive of the collection-schema gives rise to instances of the law of excluded middle and hence. (shrink)

In this paper, we consider argumentation frameworks with sets of attacking arguments (SETAFs) due to Nielsen and Parsons, an extension of Dung’s abstract argumentation frameworks that allow for collective attacks. We first provide a comprehensive analysis of the expressiveness of SETAFs under conflict-free, naive, stable, complete, admissible, preferred, semi-stable, and stage semantics. Our analysis shows that SETAFs are strictly more expressive than Dung AFs. Towards a uniform characterization of SETAFs and Dung AFs we provide general results on expressiveness which take (...) the maximum degree of the collective attacks into account. Our results show that, for each [Formula: see text], SETAFs that allow for collective attacks of [Formula: see text] arguments are more expressive than SETAFs that only allow for collective attacks of at most k arguments. (shrink)

Diese Arbeit stellt Freges Denken in seiner Entwicklung von den Anfängen bis zum Auftreten des Widerspruch dar. Ausführlich behandelt sind die Begriffsschrift, die Erläuterungsschriften dazu, die Grundlagen der Arithmetik sowie die Texte im Übergang zu den Grundgesetzen der Arithmetik, ein- schließlich der klassischen Aufsätze Funktion und Begriff, Über Sinn und Bedeutung und Über Begriff und Gegenstand. Die Texte werden nach Chronologie und Stellung zueinander präzise aufgeschlüsselt; auch die zeitgenössischen Rezensionen und Freges wissenschaftliches Umfeld werden berücksichtigt. Freges Werk wird dadurch in (...) seiner beeindruckenden Zielstrebigkeit, Geschlossenheit und Tiefe sichtbar. Sein Zentrum ist die radikale Neufassung der Logik, ausgehend von der Grundunterscheidung von Begriff und Gegenstand, die zunächst eher unauffällig über die Zerfällung des Urteils in Funktion und Argument eingeführt und mit f(a) notiert wird. Zusammen mit der Einführung einer (Quantoren-)Notation, um die Allgemeinheit der Einsetzungen auf beiden Positionen einzuschränken, übertrifft Freges Logik die traditionelle, alle zeitgenössischen und etliche spätere an Präzision und Ausdruckskraft. Eben die grundsätzliche Trennung von Begriff und Gegenstand erweist sich aber für sein wissenschaftliches Hauptanliegen, die Ableitung der Arithmetik aus der Logik, als schwerwiegendes, letztlich nicht zu überwindendes Hindernis. Es gelingt ihm nicht, die Zahlen als „logische Gegenstände“ überzeugend einzuführen, und so zeigt er wider Willen die wesentliche Verschiedenheit von Logik und Arithmetik auf. (shrink)

This paper scrutinizes Everett Nelson's conception of consistency by comparing it with the “standard” account of C. I. Lewis. This conflict surprisingly resembles a related controversy between the ancient logicians Chrysippus and Diodorus. Nelson's intuitions behind his peculiar conception of consistency are analysed and certain features of his logical system are critically examined. In particular, his objections against the law of the transitivity of implication and against the laws of conjunction and disjunction have to be discussed. Although Nelson's considerations contain (...) interesting ideas in favour of a relevantist conception of logic, they fail to convincingly support the hardcore connexive thesis that even a selfcontradictory proposition doesn't entail its own negation. (shrink)

If an agent can't live up to the demands of ideal rationality, fallback norms come into play that take into account the agent's limitations. A familiar human limitation is our tendency to lose information. How should we compensate for this tendency? The Seeping Beauty problem allows us to isolate this question, without the confounding influence of other human limitations. If the coin lands tails, Beauty can't preserve whatever information she has received on Monday: she is bound to violate the norms (...) of ideal diachronic rationality. The considerations that support these norms, however, can still be used. I investigate how Beauty should update her beliefs so as to maximize the expected accuracy of her new beliefs. The investigation draws attention to important but neglected questions about the connection between rational belief and evidential support, about the status of ideal and non‐ideal norms, about the dependence of epistemic norms on descriptive facts, and about the precise formulation of expected accuracy measures. It also sheds light on the puzzle of higher‐order evidence. (shrink)

An infinite binary sequence X is Kolmogorov–Loveland random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounded gain in the limit while betting successively on bits of X. A sequence X is KL-stochastic if there is no computable non-monotonic selection rule that selects from X an infinite, biased sequence.One of the major open problems in the field of effective randomness is whether Martin-Löf randomness is the same as KL-randomness. Our first (...) main result states that KL-random sequences are close to Martin-Löf random sequences in so far as every KL-random sequence has arbitrarily dense subsequences that are Martin-Löf random. A key lemma in the proof of this result is that for every effective split of a KL-random sequence at least one of the halves is Martin-Löf random. However, this splitting property does not characterize KL-randomness; we construct a sequence that is not even computably random such that every effective split yields two subsequences that are 2-random. Furthermore, we show for any KL-random sequence A that is computable in the halting problem that, first, for any effective split of A both halves are Martin-Löf random and, second, for any computable, nondecreasing, and unbounded function g and almost all n, the prefix of A of length n has prefix-free Kolmogorov complexity at least n−g. Again, the latter property does not characterize KL-randomness, even when restricted to left-r.e. sequences; we construct a left-r.e. sequence that has this property but is not KL-stochastic and, in fact, is not even Mises–Wald–Church stochastic.Turning our attention to KL-stochasticity, we construct a non-empty class of KL-stochastic sequences that are not weakly 1-random; by the usual basis theorems we obtain such sequences that in addition are left-r.e., are low, or are of hyperimmune-free degree.Our second main result asserts that every KL-stochastic sequence has effective dimension 1, or equivalently, a sequence cannot be KL-stochastic if it has infinitely many prefixes that can be compressed by a factor of α<1. This improves on a result by Muchnik, who has shown that were they to exist, such compressible prefixes could not be found effectively. (shrink)

Collingridge’s dilemma is one of the most well-established paradigms presenting a challenge to Technology Assessment (TA). This paper aims to reconstruct the dilemma from an analytic perspective and explicates three assumptions underlying the dilemma: the temporal, knowledge and power/actor assumptions. In the light of the recent transformation of the science, technology and innovation system—in the age of technoscience —these underlying assumptions are called into question. The same result is obtained from a normative angle by Collingridge himself; he criticises the dilemma (...) and advances concepts on how to keep a technology controllable. This paper stresses the relevance of the dilemma and of Collingridge’s own ideas on how to deal with the dilemma. Today, a positive interpretation of technoscience for effective TA is possible. (shrink)

I argue that none of the usual interpretations of probability provide an adequate interpretation of probabilistic theories in science. Assuming that the aim of such theories is to capture noisy relationships in the world, I suggest that we do not have to give them classical truth-conditional content at all: their probabilities can remain uninterpreted. Indirectly, this account turns out to explain what is right about the frequency interpretation, the best-systems interpretation, and the epistemic interpretation.

This volume consists of essays from a colloquium about "philosophy of economics" held at the·University of l1unich in July, 1981. They are contributions to an enterprise which in some respects is long-standing and in other respects is new. The long-standing enterprise is to somehow establish decision theory and its kindred disciplines as the basis of economic theory from which its other parts might be shown to follow. The new enterprise is to apply (some of) the latest methods of phi. losophy (...) of science to economic theory. By "philosophy of science" we do not mean h:istory of science and the like; rather we mean a reconstructive proce dure which clarifies and deepens the understanding of the science under investigation. By "the latest methods" we refer to the structuralist view which has emerged in the last fifteen years, and which has been success fully applied most notably to physical theories. Economics being rather like a stepchild of a reconstructivist philo sophy of science, we think much of the interest of this volume to lie just in its attending to the newer enterprise_ We are happy to have brought together at the colloquium some of the few philosophers of scien ce working in. this field who share this common goal, and we hope that their essays will stimulate further work. -The contributions to the long-standing enterprise, though perhaps not as urgent, are no less valuable. (shrink)

The Dialectica-style functional interpretation of Kripke-Platek set theory with infinity ( $\hbox{\sf KP} \omega$ ) given in [1] uses a choice functional (which is not a definable set function of ( $hbox{\sf KP} \omega$ ). By means of a Diller-Nahm-style interpretation (cf. [4]) it is possible to eliminate the choice functional and give an interpretation by set functionals primitive recursive in $x\mapsto\omega$ . This yields the following characterization: The class of $\Sigma$ -definable set functions of $\hbox{\sf KP} \omega$ coincides with (...) the collection of set functionals of type 1 primitive recursive in $x\mapsto \omega$. (shrink)

Die Wissensvermittlung in Gesundheitsethik ermöglicht es Auszubildenden der Pflege, sich in ihrer zukünftigen Tätigkeit bei Entscheidungsprozessen des Behandlungsteams hinsichtlich pflegeethischer Fragestellungen einzubringen. Vor diesem Hintergrund wurde anhand der vorliegenden Studie die Entwicklung moralischer Positionen sowie pflegeethischer Kenntnisse von Pflegeauszubildenden sichtbar gemacht. An zwei Krankenpflegeschulen (Berlin und Fürth) wurden im Rahmen einer Panelstudie von August 2010 bis März 2011 Daten einer ersten Querschnittserhebung von Auszubildenden in der Pflege erhoben. Für die Studie wurde ein strukturierter Fragebogen verwendet. Die Studienteilnahme erfolgte freiwillig. Alle (...) Auszubildenden hatten vor der Befragung in unterschiedlichem Umfang Unterricht in Gesundheitsethik erhalten. An beiden Standorten zeigten die Teilnehmenden einen Zuwachs an pflegeethischen Kenntnissen. Auszubildende, die bislang keine praktische Erfahrung mit Sterbehilfe gemacht hatten, zeigten Schwierigkeiten in der theoretischen Handhabung dieser Maßnahmen. Für alle Auszubildenden zeigte sich ein allgemeiner Trend zu einer Befürwortung des partizipativen Interaktionsmodells und damit zu einer Förderung der Patientenselbstbestimmung. Zugleich schätzten die Studienteilnehmenden die Fähigkeiten von Patienten, medizinisch richtige Therapieentscheidungen zu treffen, als gering ein. Die Ausbildung in Gesundheitsethik besitzt ein großes Potential, Kenntnisse zu vermitteln und dadurch die ethische Kompetenzentwicklung zu befördern. Unsere Ergebnisse werfen die Frage auf, inwieweit es einer Integration praktischer Erfahrungen mit Fragestellungen der Gesundheitsethik bedarf, um eine praxisrelevante und wissenschaftlich fundierte Wissensvermittlung zu gewährleisten. (shrink)

Traditional logic as a part of philosophy is one of the oldest scientific disciplines. Mathematical logic, however, is a relatively young discipline and arose from the endeavors of Peano, Frege, Russell and others to create a logistic foundation for mathematics. It steadily developed during the 20th century into a broad discipline with several sub-areas and numerous applications in mathematics, informatics, linguistics and philosophy. While there are already several well-known textbooks on mathematical logic, this book is unique in that it is (...) much more concise than most others, and the material is treated in a streamlined fashion which allows the professor to cover many important topics in a one semester course. Although the book is intended for use as a graduate text, the first three chapters could be understood by undergraduates interested in mathematical logic. These initial chapters cover just the material for an introductory course on mathematical logic combined with the necessary material from set theory. This material is of a descriptive nature, providing a view towards decision problems, automated theorem proving, non-standard models and other subjects. The remaining chapters contain material on logic programming for computer scientists, model theory, recursion theory, Godel’s Incompleteness Theorems, and applications of mathematical logic. Philosophical and foundational problems of mathematics are discussed throughout the text. The author has provided exercises for each chapter, as well as hints to selected exercises. About the German edition: …The book can be useful to the student and lecturer who prepares a mathematical logic course at the university. What a pity that the book is not written in a universal scientific language which mankind has not yet created. - A.Nabebin, Zentralblatt. (shrink)

Modal accounts of knowledge, mind, and language, as prominently defended by Lewis, leave no room for enquiry into non-contingent matters. According to Lewis, there is only one necessarily true proposition, and it is vacuously known by everyone. What, then, are we doing when we do metaphysics, which often seems to deal with non-contingent questions? Lewis never gave a satisfactory answer, or even acknowledged the problem. I explore some options. Can we understand the relevant parts of metaphysics as dealing with contingent (...) questions about our concepts? Can we understand them in terms of a hyperintensional conception of “explicit” knowledge? Both options have some promise. Ultimately, however, I don’t think they succeed at squaring Lewis’s empiricist epistemology with his metaphysical realism. (shrink)

Big Data and methods for analyzing large data sets such as machine learning have in recent times deeply transformed scientific practice in many fields. However, an epistemological study of these novel tools is still largely lacking. After a conceptual analysis of the notion of data and a brief introduction into the methodological dichotomy between inductivism and hypothetico-deductivism, several controversial theses regarding big data approaches are discussed. These include, whether correlation replaces causation, whether the end of theory is in sight and (...) whether big data approaches constitute entirely novel scientific methodology. In this Element, I defend an inductivist view of big data research and argue that the type of induction employed by the most successful big data algorithms is variational induction in the tradition of Mill's methods. Based on this insight, the before-mentioned epistemological issues can be systematically addressed. (shrink)

The way Frege presented the Square of Opposition in a reduced form in 1879 and 1910 can be used to develop two distinct versions of the square: The traditional square that displays inferences and a “Table of Oppositions” displaying variations of negation. This Table of Oppositions can be further simplified and thus be made more symmetrical. A brief survey of versions of the square from Aristotle to the present shows how both aspects of the square have coexisted for a very (...) long time without ever being properly distinguished. (shrink)

The article discusses principles that form part of evolutionary systems thinking in social sciences and humanities. It is argued that introducing the concept of self-organization relates agency and structures in a way that makes it possible to take up certain features of Critical Theory by which it can meet the demands for a critical social science. These principles are applied to the question of whether there is convergence or divergence in and by means of the Internet. It will be clarified (...) that the Internet is basically a social system and that it is a subsystem of the larger and overarching system of the whole society. It will be shown how the Internet can be perceived as a possible trigger for societal developments bringing about fundamental change in the nature of society. Thus the article cuts across philosophical, system theoretical, social theoretical, sociology of technology, and information society theory considerations. Key Words: dynamic • "mechanism" • self-organizaton • revolution • evolution • Critical Theory • information society • Internet. (shrink)

Data-intensive techniques, now widely referred to as 'big data', allow for novel ways to address complexity in science. I assess their impact on the scientific method. First, big-data science is distinguished from other scientific uses of information technologies, in particular from computer simulations. Then, I sketch the complex and contextual nature of the laws established by data-intensive methods and relate them to a specific concept of causality, thereby dispelling the popular myth that big data is only concerned with correlations. The (...) modeling in data-intensive science is characterized as 'horizontal'—lacking the hierarchical, nested structure familiar from more conventional approaches. The significance of the transition from hierarchical to horizontal modeling is underlined by a concurrent paradigm shift in statistics from parametric to non-parametric methods. (shrink)