In honour of Detlef Dürr, we report on a mathematical rigorous computation of the electric vacuum polarisation current and extract the well-known expression for the second order perturbation. Intermediate steps in the presented calculation demonstrate, to the knowledge of the authors for the first time, mathematical rigorous versions of the combined dimensional and Pauli-Villars regularisation schemes. These are employed as computational tools to infer convenient integral representations during the computation. The said second order expression is determined up to a remaining (...) degree of freedom of a real number–without ill-defined terms from start to end. (shrink)

I present a formal theory of the logic and aboutness of imagination. Aboutness is understood as the relation between meaningful items and what they concern, as per Yablo and Fine’s works on the notion. Imagination is understood as per Chalmers’ positive conceivability: the intentional state of a subject who conceives that p by imagining a situation—a configuration of objects and properties—verifying p. So far aboutness theory has been developed mainly for linguistic representation, but it is natural to extend it to (...) intentional states. The proposed framework combines a modal semantics with a mereology of contents: imagination operators are understood as variably strict quantifiers over worlds with a content-preservation constraint. (shrink)

A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually defined with respect to the uniform measure on the set of all sequences, but extend canonically to other computable probability measures. This way each notion of randomness induces an equivalence relation on the computable probability measures where two measures are equivalent if they have the same set of random sequences. In what follows, (...) we study the equivalence relations induced by Martin-Löf randomness, computable randomness, Schnorr randomness and Kurtz randomness, together with the relations of equivalence and consistency from probability theory. We show that all these relations coincide when restricted to the class of computable strongly positive generalized Bernoulli measures. For the case of arbitrary computable measures, we obtain a complete and somewhat surprising picture of the implications between these relations that hold in general. (shrink)

Unification was originally introduced in automated deduction and term rewriting, but has recently also found applications in other fields. In this article, we give a survey of the results on unification obtained in two closely related, yet different, application areas of unification: description logics and modal logics.

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)

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)

Unlike the first English translation in 1974, this edition contains the text corresponding to Brentano's original 1874 edition.

We propose a new account of indicative conditionals, giving acceptability and logical closure conditions for them. We start from Adams’ Thesis: the claim that the acceptability of a simple indicative equals the corresponding conditional probability. The Thesis is widely endorsed, but arguably false and refuted by empirical research. To fix it, we submit, we need a relevance constraint: we accept a simple conditional 'If φ, then ψ' to the extent that (i) the conditional probability p(ψ|φ) is high, provided that (ii) (...) φ is relevant for ψ. How (i) should work is well-understood. It is (ii) that holds the key to improve our understanding of conditionals. Our account has (i) a probabilistic component, using Popper functions; (ii) a relevance component, given via an algebraic structure of topics or subject matters. We present a probabilistic logic for simple indicatives, and argue that its (in)validities are both theoretically desirable and in line with empirical results on how people reason with conditionals. (shrink)

First published in 1969. Routledge is an imprint of Taylor & Francis, an informa company.

Die Idee zu der in diesem Band dokumentierten Tagung ist im Rahmen des disziplinübergreifenden Nachwuchswissenschaftsnetzwerkes THESIS entstanden. Der Dialog über die fachlichen und disziplinären Grenzen hinweg hat bei THESIS seit dessen Gründung im Jahre 1990 stets einen großen Raum eingenommen. Anderen Fächern Respekt und Interesse entgegenzubringen und sich nicht von stereotypen Vorurteilen leiten zu lassen, ist konstitutiver Bestandteil im Selbstverständnis des Netzwerkes. Selbstverständlich gibt es in einem solchen Verbund eine Reihe von Gelegenheiten (darunter auch den einen oder anderen entwicklungsfördernden Konflikt), (...) das eigene Bild vom Anderen und das andere Bild vom Eigenen zur Sprache zu bringen und zu hinterfragen. Auf der Basis dieser bestehenden Kommunikationsstrukturen trafen sich am 11. Oktober 2003 in Göttingen 12 junge Wissenschaftlerinnen und Wissenschaftler zwischen, über und auch auf den Grenzen ihrer eigenen Herkunftsdisziplinen, um den Trendbegriff [alpha]Transdisziplinarität" auf seine Substanz zu prüfen. (shrink)

The Description Logic Handbook covers all aspects of the research in the field of knowledge representation. Written by some of the most prominent researchers in the field, and covering the basic technical material and implementational aspects, it is both a unique reference and a self-study guide.

Tractatus 4.024 inspired the dominant semantics of our time: truth-conditional semantics. Such semantics is focused on possible worlds: the content of p is the set of worlds where p is true. It has become increasingly clear that such an account is, at best, defective: we need an ‘independent factor in meaning, constrained but not determined by truth-conditions’ (Yablo 2014, p. 2), because sentences can be differently true at the same possible worlds. I suggest a missing comment which, had it been (...) included in the Tractatus, would have helped semantics get this right from the start. This is my 4.0241: ‘Knowing what is the case if a sentence is true is knowing its ways of being true’: knowing a sentence’s truth possibilities and what we now call its topic, or subject matter. I show that the famous ‘fundamental thought’ that ‘the “logical constants” do not represent’ (4.0312) can be understood in terms of ways-based views of meaning. Such views also help with puzzling claims like 5.122: ‘If p follows from q, the sense of “p” is contained in the that of “q”’, which are compatible with a conception of entailment combining truth-preservation with the preservation of topicality, or of ways of being true. (shrink)

Im Zentrum der 1874 erschienenen bewußtseinspsychologischen Abhandlungen Brentanos steht die Beschreibung und Analyse des Psychischen. Damit bahnte sich jene Abwendung von der sensualistischen Tradition der philosophischen Bewußtseinslehre an, die in der Phänomenologie Edmund Husserls vollendet wurde.

Various theories try to give accounts of how measures of this confidence do or ought to behave, both as far as the internal mental consistency of the agent as ...

We present a comparatively simple way to construct Martin-Löf random and rec-random sets with certain additional properties, which works by diagonalizing against appropriate martingales. Reviewing the result of Gács and Kučera, for any given set X we construct a Martin-Löf random set from which X can be decoded effectively. By a variant of the basic construction we obtain a rec-random set that is weak truth-table autoreducible and we observe that there are Martin-Löf random sets that are computably enumerable self-reducible. The (...) two latter results complement the known facts that no rec-random set is truth-table autoreducible and that no Martin-Löf random set is Turing-autoreducible [8, 24]. (shrink)

When one thinks—knows, believes, imagines—that something is the case, one’s thought has a topic: it is about something, towards which one’s mind is directed. What is the logic of thought, so understood? This book begins to explore the idea that, to answer the question, we should take topics seriously. It proposes a hyperintensional account of the propositional contents of thought, arguing that these are individuated not only by the set of possible worlds at which they are true, but also by (...) their topic: what they are about. The book then builds epistemic, doxastic, probabilistic, and conditional logics based on this view. It applies them to issues ranging from dogmatism, scepticism, and epistemic fallibilism, to imagination and suppositional reasoning, belief revision, framing effects, and the acceptability of indicative conditionals. (shrink)

Let an oracle be called low for prefix-free complexity on a set in case access to the oracle improves the prefix-free complexities of the members of the set at most by an additive constant. Let an oracle be called weakly low for prefix-free complexity on a set in case the oracle is low for prefix-free complexity on an infinite subset of the given set. Furthermore, let an oracle be called low and weakly for prefix-free complexity along a sequence in case (...) the oracle is low and weakly low, respectively, for prefix-free complexity on the set of initial segments of the sequence. Our two main results are the following characterizations. An oracle is low for prefix-free complexity if and only if it is low for prefix-free complexity along some sequences if and only if it is low for prefix-free complexity along all sequences. An oracle is weakly low for prefix-free complexity if and only if it is weakly low for prefix-free complexity along some sequence if and only if it is weakly low for prefix-free complexity along almost all sequences. As a tool for proving these results, we show that prefix-free complexity differs from its expected value with respect to an oracle chosen uniformly at random at most by an additive constant, and that similar results hold for related notions such as a priori probability. Furthermore, we demonstrate that on every infinite set almost all oracles are weakly low but are not low for prefix-free complexity, while by Shoenfield absoluteness there is an infinite set on which uncountably many oracles are low for prefix-free complexity. Finally, we obtain no-gap results, introduce weakly low reducibility, or WLK-reducibility for short, and show that all its degrees except the greatest one are countable. (shrink)

Exploratory analysis is an area of increasing interest in the computational linguistics arena. Pragmatically speaking, exploratory analysis may be paraphrased as natural language processing by means of analyzing large corpora of text. Concerning the analysis, appropriate means are statistics, on the one hand, and artificial neural networks, on the other hand. As a challenging application area for exploratory analysis of text corpora we may certainly identify text databases, be it information retrieval or information filtering systems. With this paper we present (...) recent findings of exploratory analysis based on both statistical and neural models applied to legal text corpora. Concerning the artificial neural networks, we rely on a model adhering to the unsupervised learning paradigm. This choice appears naturally when taking into account the specific properties of large text corpora where one is faced with the fact that input-output-mappings as required by supervised learning models cannot be provided beforehand to a satisfying extent. This is due to the fact of the highly changing contents of text archives. In a nutshell, artificial neural networks count for their highly robust behavior regarding the parameters for model optimization. In particular, we found statistical classification techniques much more susceptible to minor parameter variations than unsupervised artificial neural networks. In this paper we describe two different lines of research in exploratory analysis. First, we use the classification methods for concept analysis. The general goal is to uncover different meanings of one and the same natural language concept. A task that, obviously, is of specific importance during the creation of thesauri. As a convenient environment to present the results we selected the legal term of neutrality, which is a perfect representative of a concept having a number of highly divergent meanings. Second, we describe the classification methods in the setting of document classification. The ultimate goal in such an application is to uncover semantic similarities of various text documents in order to increase the efficiency of an information retrieval system. In this sense, document classification has its fixed position in information retrieval research from the very beginning. Nowadays renewed massive interest in document classification may be witnessed due to the appearance of large-scale digital libraries. (shrink)

In an attempt to give a unified account of common properties of various resource bounded reducibilities, we introduce conditions on a binary relation ≤r between subsets of the natural numbers, where ≤r is meant as a resource bounded reducibility. The conditions are a formalization of basic features shared by most resource bounded reducibilities which can be found in the literature. As our main technical result, we show that these conditions imply a result about exact pairs which has been previously shown (...) by Ambos-Spies [2] in a setting of polynomial time bounds: given some recursively presentable ≤r-ideal I and some recursive ≤r-hard set B for I which is not contained in I, there is some recursive set C, where B and C are an exact pair for I, that is, I is equal to the intersection of the lower ≤r-cones of B and C, where C is not in I. In particular, if the relation ≤r is in addition transitive and there are least sets, then every recursive set which is not in the least degree is half of a minimal pair of recursive sets. (shrink)

Timothy Williamson has defended the claim that the semantics of the indicative ‘if’ is given by the material conditional. Putative counterexamples can be handled by better understanding the role played in our assessment of indicatives by a fallible cognitive heuristic, called the Suppositional Procedure. Williamson’s Suppositional Conjecture has it that the Suppositional Procedure is humans’ primary way of prospectively assessing conditionals. This paper raises some doubts on the Suppositional Procedure and Conjecture.

Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system Kl-one. During the last decade, it has been shown that the important reasoning problems (like subsumption and satisfiability) in a great variety of description logics can be decided using tableau-like algorithms. This is not very surprising since description logics have turned out to be closely related to propositional modal logics and logics of programs (such as propositional dynamic logic), for which (...) tableau procedures have been quite successful.Nevertheless, due to different underlying institutions and applications, most description logics differ significantly from run-of-the-mill modal and program logics. Consequently, the research on tableau algorithms in description logics led to new techniques and results, which are, however, also of interest for modal logicians. In this article, we will focus on three features that play an important rôle in description logics (number restrictions, terminological axioms, and role constructors), and show how they can be taken into account by tableau algorithms. (shrink)

We focus on two aspects: First, we argue that it is necessary to include implicit forgiveness as an additional adaptive behavioral option to the perception of interpersonal transgressions. Second, we present one possible way to investigate the cognitive-affective underpinnings of revenge and forgiveness: a functional MRI (fMRI) approach aiming at integrating forgiveness and revenge mechanisms into a single paradigm.

Let ≤r and ≤sbe two binary relations on 2ℕ which are meant as reducibilities. Let both relations be closed under finite variation and consider the uniform distribution on 2ℕ, which is obtained by choosing elements of 2ℕ by independent tosses of a fair coin.Then we might ask for the probability that the lower ≤r-cone of a randomly chosen set X, that is, the class of all sets A with A ≤rX, differs from the lower ≤s-cone of X. By c osure (...) under finite variation, the Kolmogorov 0-1 aw yields immediately that this probability is either 0 or 1; in case it is 1, the relations are said to be separable by random oracles.Again by closure under finite variation, for every given set A, the probability that a randomly chosen set X is in the upper ≤r-cone of A is either 0 or 1; let Almostr be the class of sets for which the upper ≤r-cone has measure 1. In the following, results about separations by random oracles and about Almost classes are obtained in the context of generalized reducibilities, that is, for binary relations on 2ℕ which can be defined by a countable set of total continuous functionals on 2ℕ in the same way as the usual resource-bounded reducibilities are defined by an enumeration of appropriate oracle Turing machines. The concept of generalized reducibility comprises a natura resource-bounded reducibilities, but is more general; in particular, it does not involve any kind of specific machine model or even effectivity. The results on generalized reducibilities yield corollaries about specific resource-bounded reducibilities, including several results which have been shown previously in the setting of time or space bounded Turing machine computations. (shrink)

We need to understand the impossible. Francesco Berto and Mark Jago start by considering what the concepts of meaning, information, knowledge, belief, fiction, conditionality, and counterfactual supposition have in common. They are all concepts which divide the world up more finely than logic does. Logically equivalent sentences may carry different meanings and information and may differ in how they're believed. Fictions can be inconsistent yet meaningful. We can suppose impossible things without collapsing into total incoherence. Yet for the leading philosophical (...) theories of meaning, these phenomena are an unfathomable mystery. To understand these concepts, we need a metaphysical, logical, and conceptual grasp of situations that could not possibly exist: Impossible Worlds. This book discusses the metaphysics of impossible worlds and applies the concept to a range of central topics and open issues in logic, semantics, and philosophy. It considers problems in the logic of knowledge, the meaning of alternative logics, models of imagination and mental simulation, the theory of information, truth in fiction, the meaning of conditional statements, and reasoning about the impossible. In all these cases, impossible worlds have an essential role to play. (shrink)

Behaviourism is the view that preferences, beliefs, and other mental states in social-scientific theories are nothing but constructs re-describing people's behaviour. Mentalism is the view that they capture real phenomena, on a par with the unobservables in science, such as electrons and electromagnetic fields. While behaviourism has gone out of fashion in psychology, it remains influential in economics, especially in ‘revealed preference’ theory. We defend mentalism in economics, construed as a positive science, and show that it fits best scientific practice. (...) We distinguish mentalism from, and reject, the radical neuroeconomic view that behaviour should be explained in terms of brain processes, as distinct from mental states. (shrink)

We analyse managerial discourse in corporate communication (‘CEO-speak’) during a 6-month period following a legitimacy-threatening event in the form of an incident in a German nuclear power plant. As discourses express specific stances expressed by a group of people who share particular beliefs and values, they constitute an important means of restoring organisational legitimacy when social rules and norms have been violated. Using an analytical framework based on legitimacy as a process of reciprocal sense-making and consisting of three levels of (...) analysis which capture the relationship between text and context, we investigate the discourse used by CEOs in their initial and subsequent accounts of the incident. We find that CEOs aim to negotiate a resolution between their initial account and organisational audiences’ incongruent interpretations of the event by adopting an ad hoc normative attitude to stakeholders. This manifests itself in the strategic use of the discourse of stakeholder engagement as a means of signalling change, yet maintaining the status quo. It suggests that CEOs strategically use discourse to manufacture organisational audiences’ consent regarding the continued operation of the nuclear power plant affected by the incident. Our findings contribute to the critical corporate communication literature which regards corporate narrative reporting as a means of consolidating the private interests of corporations, rather than increasing transparency and accountability. (shrink)

Pets are truly great companions. Some individuals feel that owning a pet can help them prepare for a growing family by giving them a taste of what it would be like to have children. This study also looks into the psychological well-being and life experiences of LGBT fur parents. Employing the Interpretative Phenomenological Analysis, the findings of this study were: (1) With the presence of fur babies, participants had the ease to overcome stressful events, especially the ones that affect their (...) mental health. With these, they have the desire to take care of their fur babies under all circumstances because they see their fur babies as family members. Fur babies are excellent sources of motivation, confidence, and happiness for fur parents. They are treated as family members because they contribute to the mental and emotional aspects of fur parents. Moreover, the majority of respondents valued their pets far more than their actual family members, however, some didn't spend as much time with their relatives and friends. This study comes to the conclusion that a stronger bond with one's dog was also linked to higher anxiety about being unloved and rejected by family members and people surrounding us, which was linked to a heavier impact on one's psychological well-being. In reality, fur parents, especially LGBT parents, offer their fur babies a lot of love and attention compared to other things. (shrink)

Franz Clemens Brentano. -ZZW fo daß fich vielmehr der Gedanke einer Verwandtfchaft des Verfahrens hier und dort mit einer kaum abzuwehrenden Macht uns aufdrängt, Pafcal. der geniale Mathematiker und Phhfiker. thut in feinen *Penfees ...

Feature logics are the logical basis for so-called unification grammars studied in computational linguistics. We investigate the expressivity of feature terms with negation and the functional uncertainty construct needed for the description of long-distance dependencies and obtain the following results: satisfiability of feature terms is undecidable, sort equations can be internalized, consistency of sort equations is decidable if there is at least one atom, and consistency of sort equations is undecidable if there is no atom.

We introduce a “reason-based” framework for explaining and predicting individual choices. It captures the idea that a decision-maker focuses on some but not all properties of the options and chooses an option whose motivationally salient properties he/she most prefers. Reason-based explanations allow us to distinguish between two kinds of context-dependent choice: the motivationally salient properties may (i) vary across choice contexts, and (ii) include not only “intrinsic” properties of the options, but also “context-related” properties. Our framework can accommodate boundedly rational (...) and sophisticatedly rational choice. Since properties can be recombined in new ways, it also offers resources for predicting choices in unobserved contexts. (shrink)

The first introductory textbook on description logics, relevant to computer science, knowledge representation and the semantic web.

We conceptualise CSR communication as a process of reciprocal influence between organisations and their audiences. We use an illustrative case study in the form of a conflict between firms and a powerful stakeholder which is played out in a series of 20 press releases over a 2-month period to develop a framework of analysis based on insights from linguistics. It focuses on three aspects of dialogism, namely (i) turn-taking (co-operating in a conversation by responding to the other party), (ii) inter-party (...) moves (the nature and type of interaction characterising a turn, i.e. denial, apology or excuse) and (iii) intertextuality (the intensity and quality of verbal interaction between the parties). We address the question: What is the nature and type of verbal interactions between the parties? First we examine (a) whether the parties verbally interact and then (b) whether the parties listen to each other. We find evidence of dialogism suggesting that CSR communication is an interactive process which has to be understood as a function of the power relations between a firm and a specific stakeholder. Also, we find evidence of intertextuality in press releases by six firms which engage in verbal interaction with the stakeholder. We interpret this as linguistic evidence of isomorphic processes relating to CSR practices resulting from the pressure exerted by a powerful stakeholder. The lack of response by ten firms that fail to issue press releases suggests a strategy of ‘watch-and-wait’ with respect to the outcome of the conflict. (shrink)

Franz Brentano (1838-1917) is a key figure in the development of Twentieth Century thought. It was his work that set Husserl on to the road of phenomenology and intentionality, that inspired Meinong's theory of the object which influenced Bertrand Russell, and the entire Polish school of philosophy. ^Descriptive Psychology presents a series of lectures given by Brentano in 1887; they were the culmination of his work, and the clearest statement of his mature thought. It was this later period which (...) proved to be so important in the work of his student, Husserl. This is the first English translation of his work. Benito Muller has added a concise introduction which places Brentano within the history of philosophy and psychology, and locates his influence in contemporary thought. (shrink)

Which rules for aggregating judgments on logically connected propositions are manipulable and which not? In this paper, we introduce a preference-free concept of non-manipulability and contrast it with a preference-theoretic concept of strategy-proofness. We characterize all non-manipulable and all strategy-proof judgment aggregation rules and prove an impossibility theorem similar to the Gibbard--Satterthwaite theorem. We also discuss weaker forms of non-manipulability and strategy-proofness. Comparing two frequently discussed aggregation rules, we show that “conclusion-based voting” is less vulnerable to manipulation than “premise-based voting”, (...) which is strategy-proof only for “reason-oriented” individuals. Surprisingly, for “outcome-oriented” individuals, the two rules are strategically equivalent, generating identical judgments in equilibrium. Our results introduce game-theoretic considerations into judgment aggregation and have implications for debates on deliberative democracy. (shrink)

Expanding on the theory of ethics first posited by Brentano in The Origin of our Knowledge of Right and Wrong this re-issued work, first published posthumously in 1952, is based on series of lectures on practical philosophy, given at the university of Vienna from 1876 to 1894. The English-speaking reader will find it interesting to examine the step-by-step development of Brentano’s ethical theory, his extensive critique of British moral philosophers, and his unusually detailed section on casuistry.

First published in English in1966, _The True and The Evident_ is a translation of Franz Brentano’s posthumous _Wahrheit und Evidenz_, edited by Oscsar Kraus. The book includes Brentano’s influential lecture "On the Concept of Truth", read before the Vienna Philosophical Society, a variety of essays, drawn from the immense wealth of Brentano’s unpublished material, and letters written by him to Marty, Kraus Hillebrand, and Husserl. Brentano rejects the familiar versions of the "correspondence theory of truth" and proposes to define (...) the true in terms of the evident. In criticising the metaphysical assumptions presupposed by the correspondence theory, he sets forth a conception of language and reality that has subsequently become known as "reism". (shrink)