We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthem’s theorem, which says that a first-order formula is invariant under bisimulation if, and only if, it is equivalent to a formula of basic modal logic. The present investigation primarily concerns ramifications for specific classes of structures. We study in particular model classes defined through conditions on the underlying frames, with a focus on frame classes (...) that play a major role in modal correspondence theory and often correspond to typical application domains of modal logics. Classical model theoretic arguments do not apply to many of the most interesting classes–for instance, rooted frames, finite rooted frames, finite transitive frames, well-founded transitive frames, finite equivalence frames–as these are not elementary. Instead we develop and extend the game-based analysis over such classes and provide bisimulation preserving model constructions within these classes. Over most of the classes considered, we obtain finite model theory analogues of the classically expected characterisations, with new proofs also for the classical setting. The class of transitive frames is a notable exception, with a marked difference between the classical and the finite model theory of bisimulation invariant first-order properties. Over the class of all finite transitive frames in particular, we find that monadic second-order logic is no more expressive than first-order as far as bisimulation invariant properties are concerned — though both are more expressive here than basic modal logic. We obtain ramifications of the de Jongh–Sambin theorem and a new and specific analogue of the Janin–Walukiewicz characterisation of bisimulation invariant monadic second-order for finite transitive frames. (shrink)

We consider fixed point logics, i.e., extensions of first order predicate logic with operators defining fixed points. A number of such operators, generalizing inductive definitions, have been studied in the context of finite model theory, including nondeterministic and alternating operators. We review results established in finite model theory, and also consider the expressive power of the resulting logics on infinite structures. In particular, we establish the relationship between inflationary and nondeterministic fixed point logics and second order logic, and we consider (...) questions related to the determinacy of games associated with alternating fixed points. (shrink)

We consider Choiceless Polynomial Time , a language introduced by Blass, Gurevich and Shelah, and show that it can express a query originally constructed by Cai, Fürer and Immerman to separate fixed-point logic with counting from image. This settles a question posed by Blass et al. The program we present uses sets of unbounded finite rank: we demonstrate that this is necessary by showing that the query cannot be computed by any program that has a constant bound on the rank (...) of sets used, even in image, an extension of image with counting. (shrink)

We identify complete fragments of the simple theory of types with infinity and Quine’s new foundations set theory. We show that TSTI decides every sentence ϕ in the language of type theory that is in one of the following forms: ϕ=∀x1r1⋯∀xkrk∃y1s1⋯∃ylslθ where the superscripts denote the types of the variables, s1>⋯>sl, and θ is quantifier-free, ϕ=∀x1r1⋯∀xkrk∃y1s⋯∃ylsθ where the superscripts denote the types of the variables and θ is quantifier-free. This shows that NF decides every stratified sentence ϕ in the language (...) of set theory that is in one of the following forms: ϕ=∀x1⋯∀xk∃y1⋯∃ylθ where θ is quantifier-free and ϕ admits a stratification that assigns distinct values to all of the variables y1,…,yl, ϕ=∀x1⋯∀xk∃y1⋯∃ylθ where θ is quantifier-free and ϕ admits a stratification that assigns the same value to all of the variables y1,…,yl. (shrink)

This note investigates the class of finite initial segments of the cumulative hierarchy of pure sets. We show that this class is first-order definable over the class of finite directed graphs and that this class admits a first-order definable global linear order. We apply this last result to show that FO = FO.

We consider the problem of obtaining logical characterisations of oracle complexity classes. In particular, we consider the complexity classes LOGSPACENP and PTIMENP. For these classes, characterisations are known in terms of NP computable Lindström quantifiers which hold on ordered structures. We show that these characterisations are unlikely to extend to arbitrary structures, since this would imply the collapse of certain exponential complexity hierarchies. We also observe, however, that PTIMENP can be characterised in terms of Lindström quantifers , though it remains (...) open whether this can be done for LOGSPACENP. (shrink)

Anuj Dawar poses two questions which give finitary analogies to the Löwenheim–Skolem theorems. Grohe , has shown that the first of these, which corresponds to the downward Löwenheim–Skolem theorem, has a negative answer. In this paper we combine Grohe's technique with that of Robinson's famous paper ) to show that the second question, which corresponds to the upward Löwenheim–Skolem theorem, also has a negative answer.

In this paper we explore the connections between ethics and decision theory. In particular, we consider the question of whether decision theory carries with it a bias towards consequentialist ethical theories. We argue that there are plausible versions of the other ethical theories that can be accommodated by “standard” decision theory, but there are also variations of these ethical theories that are less easily accommodated. So while “standard” decision theory is not exclusively consequentialist, it is not necessarily ethically neutral. Moreover, (...) even if our decision-theoretic models get the right answers vis-`a-vis morally correct action, the question remains as to whether the motivation for the non-consequentialist theories and the psychological processes of the agents who subscribe to those ethical theories are lost or poorly represented in the resulting models. (shrink)

There is something genuinely puzzling about large-scale simplicity emerging in systems that are complex at the small scale. Consider, for example, a population of hares. Clearly, the number of hares at any given time depends on hare fertility rates, the weather, the number of predators, the health of the predators, availability of hare resources, motor vehicle traffic, individual hare locations, colour of individual hares, and so on. Indeed, given the incredibly complexity of the hares’ environment at the small-scale, it is (...) amazing that anything can be said about hare abundances. But not only can we say something about hare abundances, we can formulate equations for hare abundance as a function of time that are remarkably accurate. But most amazing of all is that such equations have very few parameters—in the simplest cases, just the growth rate and an initial population abundance. How can this be? How can we ignore all the small-scale factors when they clearly play major roles in determining abundance? Put somewhat more grandiosely: How is population ecology possible? Of course it’s not just population ecology that exhibits such small-scale complexity and large-scale simplicity. Other important systems include the weather and gases in equilibrium. The examples can easily be multiplied. The general problem is the same: How can seemingly unpredictable and complex microbehaviour of complex systems result in predictable and simple macrobehaviour? Providing an answer to this question is the central task of Michael Strevens’ excellent book Bigger than Chaos : Understanding Complexity through Probability. (shrink)

Two algebraic structures, the contrapositionally complemented Heyting algebra (ccHa) and the contrapositionally |$\vee $| complemented Heyting algebra (c|$\vee $|cHa), are studied. The salient feature of these algebras is that there are two negations, one intuitionistic and another minimal in nature, along with a condition connecting the two operators. Properties of these algebras are discussed, examples are given and comparisons are made with relevant algebras. Intuitionistic Logic with Minimal Negation (ILM) corresponding to ccHas and its extension |${\textrm {ILM}}$|-|${\vee }$| for c|$\vee (...) $|cHas are then investigated. Besides its relations with intuitionistic and minimal logics, ILM is observed to be related to Peirce’s logic and Vakarelov’s logic MIN. With a focus on properties of the two negations, relational semantics for ILM and |${\textrm {ILM}}$|-|${\vee }$| are obtained with respect to four classes of frames, and inter-translations between the classes preserving truth and validity are provided. ILM and |${\textrm {ILM}}$|-|${\vee }$| are shown to have the finite model property with respect to these classes of frames and proved to be decidable. Extracting features of the two negations in the algebras, a further investigation is made, following logical studies of negations that define the operators independently of the binary operator of implication. Using Dunn’s logical framework for the purpose, two logics |$K_{im}$| and |$K_{im-{\vee }}$| are discussed, where the language does not include implication. The |$K_{im}$|-algebras are reducts of ccHas and are different from relevant algebraic structures having two negations. The negations in the |$K_{im}$|-algebras and |$K_{im-{\vee }}$|-algebras are shown to occupy distinct positions in an enhanced form of Dunn’s kite of negations. Relational semantics for |$K_{im}$| and |$K_{im-{\vee }}$| is provided by a class of frames that are based on Dunn’s compatibility frames. It is observed that this class coincides with one of the four classes giving the relational semantics for ILM and |${\textrm {ILM}}$|-|${\vee }$|⁠. (shrink)

In this paper we argue that there is a kind of moral disagreement that survives the Rawlsian veil of ignorance. While a veil of ignorance eliminates sources of disagreement stemming from self-interest, it does not do anything to eliminate deeper sources of disagreement. These disagreements not only persist, but transform their structure once behind the veil of ignorance. We consider formal frameworks for exploring these differences in structure between interested and disinterested disagreement, and argue that consensus models offer us a (...) solution concept for disagreements behind the veil of ignorance. (shrink)

This book not only outlines the indispensability argument in considerable detail but also defends it against various challenges.

Hastings Center Report, Volume 51, Issue 5, Page 53-55, September‐October 2021.

Mathematics has a great variety ofapplications in the physical sciences.This simple, undeniable fact, however,gives rise to an interestingphilosophical problem:why should physical scientistsfind that they are unable to evenstate their theories without theresources of abstract mathematicaltheories? Moreover, theformulation of physical theories inthe language of mathematicsoften leads to new physical predictionswhich were quite unexpected onpurely physical grounds. It is thought by somethat the puzzles the applications of mathematicspresent are artefacts of out-dated philosophical theories about thenature of mathematics. In this paper I argue (...) that this is not so.I outline two contemporary philosophical accounts of mathematics thatpay a great deal of attention to the applicability of mathematics and showthat even these leave a large part of the puzzles in question unexplained. (shrink)

Journal of Political Philosophy, EarlyView.

The main focus of the book is the presentation of the 'inertial' view of population growth. This view provides a rather simple model for complex population dynamics, and is achieved at the level of the single species without invoking species interactions. An important part of this account is the maternal effect. Investment of mothers in the quality of their daughters makes the rate of reproduction of the current generation depend not only on the current environment, but also on the environment (...) experienced by the previous generation. (shrink)

Hartry Field has shown us a way to be nominalists: we must purge our scientific theories of quantification over abstracta and we must prove the appropriate conservativeness results. This is not a path for the faint hearted. Indeed, the substantial technical difficulties facing Field's project have led some to explore other, easier options. Recently, Jody Azzouni, Joseph Melia, and Stephen Yablo have argued that it is a mistake to read our ontological commitments simply from what the quantifiers of our best (...) scientific theories range over. In this paper, I argue that all three arguments fail and they fail for much the same reason; would-be nominalists are thus left facing Field's hard road. (shrink)

David Malament argued that Hartry Field's nominalisation program is unlikely to be able to deal with non-space-time theories such as phase-space theories. We give a specific example of such a phase-space theory and argue that this presentation of the theory delivers explanations that are not available in the classical presentation of the theory. This suggests that even if phase-space theories can be nominalised, the resulting theory will not have the explanatory power of the original. Phase-space theories thus raise problems for (...) nominalists that go beyond Malament's initial concerns. Thanks to Mark Steiner, Jens Christian Bjerring, Ben Fraser, John Mathewson, and two anonymous referees for helpful comments on an earlier draft of this paper. CiteULike Connotea Del.icio.us What's this? (shrink)

A Theory of Magnitude suggests that space, time, and quantities are processed through a generalized magnitude system. ATOM posits that task-irrelevant magnitudes interfere with the processing of task-relevant magnitudes as all the magnitudes are processed by a common system. Many behavioral and neuroimaging studies have found support in favor of a common magnitude processing system. However, it is largely unknown whether such cross-domain monotonic mapping arises from a change in the accuracy of the magnitude judgments or results from changes in (...) precision of the processing of magnitude. Therefore, in the present study, we examined whether large numerical magnitude affects temporal accuracy or temporal precision, or both. In other words, whether numerical magnitudes change our temporal experience or simply bias duration judgments. The temporal discrimination paradigm was used to present numerical magnitudes across varied durations. We estimated temporal accuracy and precision for each numerical magnitude. The results revealed that temporal accuracy for large numerical magnitude was significantly lower than that of small and identical magnitudes. This implies that the temporal duration was overestimated for large numerical magnitude compared to small and identical numerical magnitude, in line with ATOM’s prediction. However, no influence of numerical magnitude was observed on temporal precision. The findings of the present study suggest that task-irrelevant numerical magnitude selectively affects the accuracy of processing of duration but not duration discrimination itself. Further, we argue that numerical magnitude may not directly affect temporal processing but could influence via attentional mechanisms. (shrink)

This paper considers a generalisation of the sorites paradox, in which only topological notions are employed. We argue that by increasing the level of abstraction in this way, we see the sorites paradox in a new, more revealing light—a light that forces attention on cut-off points of vague predicates. The generalised sorites paradox presented here also gives rise to a new, more tractable definition of vagueness.

Science presents us with a variety of accounts of the world. While some of these accounts posit deep theoretical structure and fundamental entities, others do not. But which of these approaches is the right one? How should science conceptualize the world? And what is the relation between the various accounts? Opinions on these issues diverge wildly in philosophy of science. At one extreme are reductionists who argue that higher-level theories should, in principle, be incorporated in, or eliminated by, the basic-level (...) theory. According to this view, higher-level theories do not ultimately exhibit conceptual integrity or provide genuine explanations. At the other extreme are pluralists who take higher levels of description and explanation seriously and argue for their independence and indispensability. It was the aim of the first Sydney–Tilburg conference on “Reduction and the Special Sciences”, which took place at the Tilburg Center for Logic and Philosophy of Science (TiLPS) in Tilburg, The Netherlands, over the 10–12th April 2008, to bring researchers working on these questions together and provide a platform to discuss them in a focused way. The papers in this special issue were presented at this conference. We would like to thank the Royal Netherlands Academy of Art and Sciences (KNAW), the Sydney Centre for the Foundations of Science at the University of Sydney and TiLPS for financial and institutional support. We also thank the authors and referees of the papers for their work, and Hans Rott for his support of this project. (shrink)

Evidence-based policy has support in many areas of government and in public affairs more generally. In this paper we outline what evidence-based policy is, then we discuss its strengths and weaknesses. In particular, we argue that it faces a serious challenge to provide a plausible, over-arching account of evidence. We contrast evidence-based policy with evidence-based medicine, especially the role of evidence in assessing the effectiveness of medicines. The evidence required for policy decisions does not easily lend itself to randomized controlled (...) trials, nor, for that matter, being listed in a single all-purpose hierarchy. (shrink)

We sketch out two basic paradigms informing banking practice: the economistic paradigm focusing on profit maximization and the humanistic one, serving the common good. We then highlight paradigmatic cases to explore how each of these business models fared during the quasi-natural experiment of the financial crisis. We find that many humanistic banks outperformed traditional economistic banks. Despite the uneven playing field humanistic banks fared remarkably well with regard to traditional financial performance judgements, muting criticisms of competitiveness. We find that overall (...) both paradigms can provide a basis for successful banking as long as social and financial value generation are blended. We conclude by providing lessons learned for better banking. (shrink)

In this paper I reply to Jody Azzouni, Otávio Bueno, Mary Leng, David Liggins, and Stephen Yablo, who offer defences of so-called ‘ easy road ’ nominalist strategies in the philosophy of mathematics.

The Eleatic Principle or causal criterion is a causal test that entities must pass in order to gain admission to some philosophers’ ontology.1 This principle justifies belief in only those entities to which causal power can be attributed, that is, to those entities which can bring about changes in the world. The idea of such a test is rather important in modern ontology, since it is neither without intuitive appeal nor without influential supporters. Its supporters have included David Armstrong (1978, (...) Vol 2, 5), Brian Ellis (1990, 22) and Hartry Field2 (1989, 68) to name but a few. (shrink)

This introduction to the philosophy of mathematics focuses on contemporary debates in an important and central area of philosophy. The reader is taken on a fascinating and entertaining journey through some intriguing mathematical and philosophical territory, including such topics as the realism/anti-realism debate in mathematics, mathematical explanation, the limits of mathematics, the significance of mathematical notation, inconsistent mathematics and the applications of mathematics. Each chapter has a number of discussion questions and recommended further reading from both the contemporary literature and (...) older sources. Very little mathematical background is assumed and all of the mathematics encountered is clearly introduced and explained using a wide variety of examples. The book is suitable for an undergraduate course in philosophy of mathematics and, more widely, for anyone interested in philosophy and mathematics. (shrink)

Games such as the St. Petersburg game present serious problems for decision theory.1 The St. Petersburg game invokes an unbounded utility function to produce an infinite expectation for playing the game. The problem is usually presented as a clash between decision theory and intuition: most people are not prepared to pay a large finite sum to buy into this game, yet this is precisely what decision theory suggests we ought to do. But there is another problem associated with the St. (...) Petersburg game. The problem is that standard decision theory counsels us to be indifferent between any two actions that have infinite expected utility. So, for example, consider the decision problem of whether to play the St. Petersburg game or a game where every payoff is $1 higher. Let’s call this second game the Petrograd game (it’s the same as St. Petersburg but with a bit of twentieth century inflation). Standard decision theory is indifferent between these two options. Indeed, it might be argued that any intuition that the Petrograd game is better than the St. Petersburg game is a result of misguided and na¨ıve intuitions about infinity.2 But this argument against the intuition in question is misguided. The Petrograd game is clearly better than the St. Petersburg game. And what is more, there is no confusion about infinity involved in thinking this. When the series of coin tosses comes to an end (and it comes to an end with probability 1), no matter how many tails precede the first head, the payoff for the Petrograd game is one dollar higher than the St. Petersburg game. Whatever the outcome, you are better off playing the Petrograd game. Infinity has nothing to do with it. Indeed, a straightforward application of dominance reasoning backs up this line of reasoning.3 Standard decision theory. (shrink)

Standard approaches to counterfactuals in the philosophy of explanation are geared toward causal explanation. We show how to extend the counterfactual theory of explanation to non-causal cases, involving extra-mathematical explanation: the explanation of physical facts by mathematical facts. Using a structural equation framework, we model impossible perturbations to mathematics and the resulting differences made to physical explananda in two important cases of extra-mathematical explanation. We address some objections to our approach.

Various real and imagined criminal law cases rest on “naked statistical evidence”. That is, they rest more or less entirely on a probability for guilt/liability derived from a single statistical model. The intuition is that there is something missing in these cases, high as the probability for guilt/liability may be, such that the relevant standard for legal proof is not met. Here we contribute to the considerable debate about how this intuition is best explained and what it teaches us about (...) evidential reasoning in the legal setting. We part ways with the recent scholarship, however. Unlike most others, our diagnosis is not that there is an important qualitative property that some evidence or bodies of evidence have, and that naked statistical evidence, most strikingly, lacks. Rather, we see cases resting on naked statistical evidence as lying at the extreme of a continuum of cases that are vulnerable to challenge due to “meta-uncertainty” about the underlying model. (shrink)