The paper is motivated by the need of accounting for the practical syllogism as a piece of defeasible reasoning. To meet the need, the paper first refers to ranking theory as an account of defeasible descriptive reasoning. It then argues that two kinds of ought need to be distinguished, purely normative and fact-regarding obligations. It continues arguing that both kinds of ought can be iteratively revised and should hence be represented by ranking functions, too, just as iteratively revisable beliefs. Its (...) central proposal will then be that the fact-regarding normative ranking function must be conceived as the sum of a purely normative ranking function and an epistemic ranking function. The distinctions defends this proposal with a comparative discussion of some critical examples and some other distinctions made in the literature. It gives a more rigorous justification of this proposal. Finally, it starts developing the logic of purely normative and of fact-regarding normative defeasible reasoning, points to the difficulties of completing the logic of the fact-regarding side, but reaches the initial aim of accounting for the defeasible nature of the practical syllogism. (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)

This addresses the transformations of metaphysics as a discipline, the emergence of analytical mechanics, the diverging avenues of 18th-century Newtonianism, the body-mind problem, and philosophical principles of classification in the life sciences. An appendix contains a critical edition and first translation into English of Newton's scholia from David Gregory's Estate on the Propositions IV through IX Book III of his Principia.

In this paper two theories of defeasible reasoning, Pollock's account and my theory of ranking functions, are compared, on a strategic level, since a strictly formal comparison would have been unfeasible. A brief summary of the accounts shows their basic difference: Pollock's is a strictly computational one, whereas ranking functions provide a regulative theory. Consequently, I argue that Pollock's theory is normatively defective, unable to provide a theoretical justification for its basic inference rules and thus an independent notion of admissible (...) rules. Conversely, I explain how quite a number of achievements of Pollock's account can be adequately duplicated within ranking theory. The main purpose of the paper, though, is not to settle a dispute with formal epistemology, but rather to emphasize the importance of formal methods to the whole of epistemology. (shrink)

The paper argues that Gareth Evans’ argument for transparent self-knowledge is based on a conflation of doxastic transparency with ascriptive transparency. Doxastic transparency means that belief about one’s own doxastic state, e.g., the belief that one thinks that it will rain, can be warranted by ordinary empirical observation, e.g., of the weather. In contrast, ascriptive transparency says that self-ascriptions of belief, e.g., “I believe it will rain”, can be warranted by such observation. We first show that the thesis of doxastic (...) transparency is ill-motivated and then offer a non-epistemic interpretation of ascriptive transparency by reference to the theory of explicit expressive acts: “I think it will rain” requires attendance to the weather because the utterance expresses a belief about the weather, not about ourselves. This will allow us to avoid what is often called “the puzzle of transparent self-knowledge” while remaining faithful to Evans’ linguistic observations. (shrink)

The numerous modal systems between S4 and S5 are investigated from an epistemological point of view by interpreting necessity either as knowledge or as (strong) belief. It is shown that-granted some assumptions about epistemic logic for which the author has argued elsewhere-the system S4.4 may be interpreted as the logic of true belief, while S4.3.2 and S4.2 may be taken to represent epistemic logic systems for individuals who accept the scheme knowledge = true belief only for certain special instances. There (...) is strong evidence in favor of the assumption that S4.2 is the logic of knowledge. (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)

We examine the performance of some standard causal discovery algorithms, both constraint-based and score-based, from the perspective of how robust they are against failures of the Causal Faithfulness Assumption. For this purpose, we make only the so-called Triangle-Faithfulness assumption, which is a fairly weak consequence of the Faithfulness assumption, and otherwise allows unfaithful distributions. In particular, we allow violations of Adjacency-Faithfulness and Orientation-Faithfulness. We show that the PC algorithm, a representative constraint-based method, can be made more robust against unfaithfulness by (...) incorporating elements of the GES algorithm, a representative score-based method; similarly, the GES algorithm can be made less error-prone by incorporating elements of the conservative PC algorithm. As our simulations demonstrate, the increased robustness seems to matter even when faithfulness is not exactly violated, for with only finite sample, distributions that are not exactly unfaithful may be sufficiently close to being unfaithful to make trouble. (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)

This paper investigates whether managerial rhetoric in the Management Discussion and Analysis section of 10-K filings can help gauge the level of managerial opportunism in a firm. We find that the use of trust-related words is connected to inefficient investment decisions and poor operating performance. Furthermore, firms making more frequent use of trust-related words are subject to less monitoring by institutional investors or analysts. Their accounting also relies more heavily on discretionary accruals. These results are consistent with the notion that (...) managerial rhetoric to advertise trustworthiness points towards agency problems plaguing the firm. (shrink)

An abridged and translated edition of two of Wolfgang Ernst’s major works, representing the ambitious claim of a comprehensive knowledge-oriented analysis of media temporalities.

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)

The subject of this paper is a characterization of the $\Sigma_1$ -definable set functions of Kripke-Platek set theory with infinity and a uniform version of axiom of choice: $KP\omega+(uniform\;AC)$ . This class of functions is shown to coincide with the collection of set functionals of type 1 primitive recursive in a given choice functional and $x\mapsto\omega$ . This goal is achieved by a Gödel Dialectica-style functional interpretation of $KP\omega+(uniform\;AC)$ and a computability proof for the involved functionals.

Frege famously endorsed a principle of Thought-Sentence Correspondence that can be spelt out as follows: (Corr1) For all sentences s, for all thoughts t, if r expresses t, then:if a sense is expressed by a part of s then it is part of t, &(Corr2) For all sentences s, for all thoughts t, if s expresses t, then:if a sense is part of t then it is expressed by at least one part of s. He clearly embraces Corr1 when he (...) writes in § 32 of Grundgesetze, vol. I: ‘If a name is part of the name of a trut... (shrink)

After giving a short summary of the traditional theory of the syllogism, it is shown how the square of opposition reappears in the much more powerful concept logic of Leibniz. Within Leibniz’s algebra of concepts, the categorical forms are formalized straightforwardly by means of the relation of concept-containment plus the operator of concept-negation as ‘S contains P’ and ‘S contains Not-P’, ‘S doesn’t contain P’ and ‘S doesn’t contain Not-P’, respectively. Next we consider Leibniz’s version of the so-called Quantification of (...) the Predicate which consists in the introduction of four additional forms ‘Every S is every P’, ‘Some S is every P’, ‘Every S isn’t some P’, and ‘Some S isn’t some P’. Given the logical interpretation suggested by Leibniz, these unorthodox propositions also form a Square of Opposition which, when added to the traditional Square, yields a “Cube of Opposition”. Finally it is shown that besides the categorical forms, also the non-categorical forms can be formalized within an extension of Leibniz’s logic where “indefinite concepts” X, Y, Z\ function as quantifiers and where individual concepts are introduced as maximally consistent concepts. (shrink)

In this article I focus on the question question of why we actually do read literary texts and what the merits of engaging with literary works are. The central argument is that (among the many other functions literature is abile to perform) literature is cognitively valuable by focusing not on what is said, but on how it is said. Reading literary texts adds to our expressive capacities, enriches our conceptual schemes and can so allow us to get a better grasp (...) of (relevant aspects of) the world. In short, Literature is cognitively valuable not in virtue of the content it expresses, but by means of formal or stylistic elements to which it draws our attention. (shrink)

The puzzle of the absentminded driver combines an unstable decision problem with a version of the Sleeping Beauty problem. Its analysis depends on the choice between “halfing” and “thirding” as well as that between “evidential” and “causal” decision theory. I show that all four combinations lead to interestingly different solutions, and draw some general lessons about the formulation of causal decision theory, the interpretation of mixed strategies and the connection between rational credence and objective chance.

The Dialectica-style functional interpretation of Kripke-Platek set theory with infinity (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\hbox{\sf KP} \omega$\end{document}) given in [1] uses a choice functional (which is not a definable set function of (\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $hbox{\sf KP} \omega$\end{document}). 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 \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} (...) \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $x\mapsto\omega$\end{document}. This yields the following characterization: The class of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\Sigma$\end{document}-definable set functions of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\hbox{\sf KP} \omega$\end{document} coincides with the collection of set functionals of type 1 primitive recursive in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $x\mapsto \omega$\end{document}. (shrink)

Name der Zeitschrift: Klio Jahrgang: 99 Heft: 2 Seiten: 753-757.

Laws are true lawlike sentences. But what is lawlikeness? Much effort went into investigating the issue, but the richer the concert of opinions became, the more apparent their deficiencies became too, and with it the profound importance of the issue for epistemology and philosophy of science.

The article put forwards an argument against the deployment of American middle range missiles in 1983 within the Federal Republic of Germany. It stresses the threat to safety particularly for European countries, because of the technological superiority of American missiles over Russian missiles.