In Improvisation, Samuel Wells defines improvisation in the theater as "a practice through which actors seek to develop trust in themselves and one another in order that they may conduct unscripted dramas without fear." Sounds a lot like life, doesn't it? Building trust, overcoming fear, conducting relationships, and making choices--all without a script. Wells establishes theatrical improvisation as a model for Christian ethics, a matter of "faithfully improvising on the Christian tradition." He views the Bible not as a "script" (...) but as a "training school" that shapes the habits and practices of the Christian community. Drawing on scriptural narratives and church history, Wells explains six practices that characterize both improvisation and Christian ethics. His model of improvisation reinforces the goal of Christian ethics--to teach Christians to "embody their faith in the practices of discipleship all the time."--Publisher description. (shrink)

The story of God -- The story of the church -- The story of ethics -- The story of Christian ethics -- Universal ethics -- Subversive ethics -- Ecclesial ethics -- Good order -- Good life -- Good relationships -- Good beginnings and endings -- Good earth.

Relative essentialism, the view that multiple objects about which there are distinct de re modal truths can occupy the same space at the same time, is a metaphysical view that dissolves a number of metaphysical issues. The present essay constructs and defends relative essentialism and argues that it is implicit in some of the ideas of W. V. Quine and Donald Davidson. Davidson’s published views about individuation and sameness can accommodate the common-sense insights about change and persistence of Aristotle and (...) Kripke. Aristotle and Kripke have to give up unmediated direct reference resting on a unique correct articulation of reality into entities. Davidson has to acknowledge a distinction between descriptions giving accidental and those giving essential features of an object. Quine and Davidson were in a position to be a relative essentialist, but were over-impressed by supervenience. The relative essentialist view of beings developed from Quine and Davidson strongly suggests the Heideggerian distinction between beings and Being, and is the perspective from which analytic philosophy can engage that topic. Relative essentialism also connects analytic philosophy to Derrida’s thinking about differance. (shrink)

I am writing on moral knowledge in Locke's Essay Concerning Human Understanding. There are two basic parts. In the first part, I articulate and attack a predominant interpretation of the Essay . This interpretation attributes to Locke the view that he did not write in the Essay anything that would be inconsistent with his early views in the Questions Concerning the Laws of Nature that there exists a single, ultimate, moral standard, i.e., the Law of Nature. For example, John Colman, (...) in his book John Locke's Moral Philosophy , argues that even though Locke explains in the Essay that we arbitrarily create our moral notions, they are still objective since they are bound together with the Law of Nature. Colman explains that the features of human nature relevant to the derivation of the Law of Nature are universally shared needs and concerns . I argue that this presupposes a view of Locke which assumes that there are essences of species independent of our beliefs about them. However, I attempt to show from the text of the Essay that this view cannot be supported. ;In the second part, I argue that the text of the Essay supports two alternative theses. The first is that given the kind of metaphysical world-view presupposed by the corpuscular method of science employed within the Essay, coupled with Locke's commitment to the possibility of moral knowledge, he was left with only one option with reference to ethics, viz., to make moral goodness or evil a mind-dependent relation between a rule and an action, instead of a property of an action or person which exists independently of our moral beliefs. This view is logically inconsistent with the existence of the Law of Nature. The second is that Locke has a semantical view of moral claims which is consistent with his relational view of moral goodness, viz., the primary function of moral judgments is to recommend behavior for ourselves and others. I described. However, Locke explains in the Essay that the opposite takes place with respect to our moral notions: events and persons must conform to the moral notion. ;On the account that I offer, Locke's views on moral epistemology are much closer to David Hume's than many have supposed, and correspondingly, anticipate the more skeptical views of moral epistemology in the twentieth century. (shrink)

We prove that the generalized cancellation axiom for incomplete comparative probability relations introduced by Rios Insua and Alon and Lehrer is stronger than the standard cancellation axiom for complete comparative probability relations introduced by Scott, relative to their other axioms for comparative probability in both the finite and infinite cases. This result has been suggested but not proved in the previous literature.

Much attention has been paid to moral understanding as an individual achievement, when a single agent gains insight into distinctly moral matters. Crucially overlooked, I argue, is the phenomenon of shared moral understanding, when you and I understand moral matters together, in a way that can’t be reduced to each of us having moral understanding on our own. My argument pays close attention to two central moral practices: justifying our actions to others, and apologizing for wrongdoing. I argue that, whenever (...) I owe you a justification or an apology, I thereby owe it to you to aim at our coming to a shared moral understanding. My argument has two upshots. The first is a novel explanation of the importance of moral understanding in our lives, one that emphasizes the importance of understanding moral reasons together. The second is a better understanding of the very obligations involved in two of our most central interpersonal moral practices. (shrink)

This paper investigates the principles that one must add to Boolean algebra to capture reasoning not only about intersection, union, and complementation of sets, but also about the relative size of sets. We completely axiomatize such reasoning under the Cantorian definition of relative size in terms of injections.

We investigate the complexity of isomorphisms of computable structures on cones in the Turing degrees. We show that, on a cone, every structure has a strong degree of categoricity, and that degree of categoricity is${\rm{\Delta }}_\alpha ^0 $-complete for someα. To prove this, we extend Montalbán’sη-system framework to deal with limit ordinals in a more general way. We also show that, for any fixed computable structure, there is an ordinalαand a cone in the Turing degrees such that the exact complexity (...) of computing an isomorphism between the given structure and another copy${\cal B}$in the cone is a c.e. degree in${\rm{\Delta }}_\alpha ^0\left$. In each of our theorems the cone in question is clearly described in the beginning of the proof, so it is easy to see how the theorems can be viewed as general theorems with certain effectiveness conditions. (shrink)

We study computable Polish spaces and Polish groups up to homeomorphism. We prove a natural effective analogy of Stone duality, and we also develop an effective definability technique which works up to homeomorphism. As an application, we show that there is a $\Delta ^0_2$ Polish space not homeomorphic to a computable one. We apply our techniques to build, for any computable ordinal $\alpha $, an effectively closed set not homeomorphic to any $0^{}$-computable Polish space; this answers a question of Nies. (...) We also prove analogous results for compact Polish groups and locally path-connected spaces. (shrink)

Every countable structure has a sentence of the infinitary logic $\mathcal {L}_{\omega _1 \omega }$ which characterizes that structure up to isomorphism among countable structures. Such a sentence is called a Scott sentence, and can be thought of as a description of the structure. The least complexity of a Scott sentence for a structure can be thought of as a measurement of the complexity of describing the structure. We begin with an introduction to the area, with short and simple proofs (...) where possible, followed by a survey of recent advances. (shrink)

A structure is automatic if its domain, functions, and relations are all regular languages. Using the fact that every automatic structure is decidable, in the literature many decision problems have been solved by giving an automatic presentation of a particular structure. Khoussainov and Nerode asked whether there is some way to tell whether a structure has, or does not have, an automatic presentation. We answer this question by showing that the set of Turing machines that represent automata-presentable structures is ${\rm{\Sigma (...) }}_1^1 $-complete. We also use similar methods to show that there is no reasonable characterisation of the structures with a polynomial-time presentation in the sense of Nerode and Remmel. (shrink)

ABSTRACT This essay advances several interrelated arguments concerning the proper role of the state with regard to marriage and divorce but my main contention is that ‘pure’no‐fault divorce laws are unjust—or, at least, they are unjust if marriage involves a genuinely contractual element, and there seems to be very little doubt that it does. Locke, Kant and Hegel are three eminent thinkers who are alike in viewing marriage as a contract and in the first two sections of the essay I (...) consider their views on the role of contract in marriage. Whilst holding that marriage is more than a contract, I also hold that it is not less than a contract. In section three I consider the implications of this ‘not less than’, the most important one being that ‘pure’no‐fault divorce laws are unjust. I shall contend that whilst the irretrievable breakdown of marriage may be regarded as a suitable ground for divorce, it simply cannot, and certainly ought not to, be regarded as a justificatory basis for the laying aside of rights acquired by individuals as a result of their having entered into a marital contract. However minimal one might wish the role of the state to be, or however averse one might be from allowing the state any role at all in purely personal and confidential relationships, yet to allow the expression ‘the irretrievable breakdown of marriage’to be employed as a olanket to cover over the infringement of personal, contractually engendered and civilly recognised rights, is not to exercise commendable restraint but is, rather, to condone what is simply an abnegation by the state of its basic responsibility to ensure that justice prevails. (shrink)

In this article I argue against the view, recently espoused by several authors, that the `incommensurability of values' and `political pespectivism' offer us decisive reasons as to why we should break the link between representation and (the quest for) unity. I hold that it is of paramount importance to retain this essential link. Since Sir Isaiah Berlin has played a major (and in my view unfortunate) role in linking `politics as the quest for unity and the common good' with the (...) `totalitarian temptation', I proceed to show how it is possible to have an understanding of politics as precisely such a quest, but without succumbing to the temptation to totalitarianism that Berlin alerts us to. I then take issue with Chantal Mouffe's view that the tendency to antagonism, rather than the quest for unity and rational consensus, is `the essence of the political'. (shrink)

Universality has been an important concept in computable structure theory. A class C of structures is universal if, informally, for any structure of any kind there is a structure in C with the same computability-theoretic properties as the given structure. Many classes such as graphs, groups, and fields are known to be universal. This paper is about the class of finitely generated groups. Because finitely generated structures are relatively simple, the class of finitely generated groups has no hope of being (...) universal. We show that finitely generated groups are as universal as possible, given that they are finitely generated: for every finitely generated structure, there is a finitely generated group which has the same computability-theoretic properties. The same is not true for finitely generated fields. We apply the results of this investigation to quasi Scott sentences, and also answer a question of Alvir, Knight, and McCoy. (shrink)

This article builds on Humberstone’s idea of defining models of propositional modal logic where total possible worlds are replaced by partial possibilities. We follow a suggestion of Humberstone by introducing possibility models for quantified modal logic. We show that a simple quantified modal logic is sound and complete for our semantics. Although Holliday showed that for many propositional modal logics, it is possible to give a completeness proof using a canonical model construction where every possibility consists of finitely many formulas, (...) we show that this is impossible to do in the first-order case. However, one can still construct a canonical model where every possibility consists of a computable set of formulas and thus still of finitely much information. (shrink)

Richard Faber, the author of learned studies of Novalis, Vergil, Brecht, and Carl Schmitt, is aware that this is not the first book he has published with the same title. ad Jacob Taubes, the title...

The problem of inferring probability comparisons between events from an initial set of comparisons arises in several contexts, ranging from decision theory to artificial intelligence to formal semantics. In this paper, we treat the problem as follows: beginning with a binary relation ≥ on events that does not preclude a probabilistic interpretation, in the sense that ≥ has extensions that are probabilistically representable, we characterize the extension ≥+ of ≥ that is exactly the intersection of all probabilistically representable extensions of (...) ≥. This extension ≥+ gives us all the additional comparisons that we are entitled to infer from ≥, based on the assumption that there is some probability measure of which ≥ gives us partial qualitative information. We pay special attention to the problem of extending an order on states to an order on events. In addition to the probabilistic interpretation, this problem has a more general interpretation involving measurement of any additive quantity: e.g., given comparisons between the weights of individual objects, what comparisons between the weights of groups of objects can we infer? (shrink)

A computable structure [Formula: see text] is decidable if, given a formula [Formula: see text] of elementary first-order logic, and a tuple [Formula: see text], we have a decision procedure to decide whether [Formula: see text] holds of [Formula: see text]. We show that there is no reasonable classification of the decidably presentable structures. Formally, we show that the index set of the computable structures with decidable presentations is [Formula: see text]-complete. We also show that for each [Formula: see text] (...) the index set of the computable structures with [Formula: see text]-decidable presentations is [Formula: see text]-complete. (shrink)

The concept of innateness has historically exerted an influence in many regions of biology and it continues to play a significant role in cognitive science especially, developmental psychology and linguistics. This chapter provides an overview of some recent efforts to empirically study the innateness concept, both as deployed in folk contexts and among scientists. It considers whether this research really bolsters the standard criticism. The chapter describes research by Paul Griffiths and his collaborators, which seeks to assess whether the folk (...) concept of innateness is a manifestation of the folk biology. It reviews further research, largely due to Josh Knobe and Richard Samuels, on folk innateness judgments. The chapter describes how this research was extended in order to explore the issue of whether scientists’ innateness judgments rely on a distinctly scientific innateness concept, or whether they merely redeploy the folk concept. (shrink)

We investigate the computability-theoretic properties of valued fields, and in particular algebraically closed valued fields and p-adically closed valued fields. We give an effectiveness condition, related to Hensel’s lemma, on a valued field which is necessary and sufficient to extend the valuation to any algebraic extension. We show that there is a computable formally p-adic field which does not embed into any computable p-adic closure, but we give an effectiveness condition on the divisibility relation in the value group which is (...) sufficient to find such an embedding. By checking that algebraically closed valued fields and p-adically closed valued fields of infinite transcendence degree have the Mal’cev property, we show that they have computable dimension \. (shrink)

We can measure the complexity of a logical formula by counting the number of alternations between existential and universal quantifiers. Suppose that an elementary first-order formula $\varphi $ (in $\mathcal {L}_{\omega,\omega }$ ) is equivalent to a formula of the infinitary language $\mathcal {L}_{\infty,\omega }$ with n alternations of quantifiers. We prove that $\varphi $ is equivalent to a finitary formula with n alternations of quantifiers. Thus using infinitary logic does not allow us to express a finitary formula in a (...) simpler way. (shrink)

Our main result is that there exist structures which cannot be computably recovered from their tree of tuples. This implies that there are structures with no computable copies which nevertheless cannot code any information in a natural/functorial way.

The processes underwriting the acquisition of culture remain unclear. How are shared habits, norms, and expectations learned and maintained with precision and reliability across large-scale sociocultural ensembles? Is there a unifying account of the mechanisms involved in the acquisition of culture? Notions such as “shared expectations,” the “selective patterning of attention and behaviour,” “cultural evolution,” “cultural inheritance,” and “implicit learning” are the main candidates to underpin a unifying account of cognition and the acquisition of culture; however, their interactions require greater (...) specification and clarification. In this article, we integrate these candidates using the variational (free-energy) approach to human cognition and culture in theoretical neuroscience. We describe the construction by humans of social niches that afford epistemic resources called cultural affordances. We argue that human agents learn the shared habits, norms, and expectations of their culture through immersive participation in patterned cultural practices that selectively pattern attention and behaviour. We call this process “thinking through other minds” (TTOM) – in effect, the process of inferring other agents’ expectations about the world and how to behave in social context. We argue that for humans, information from and about other people's expectations constitutes the primary domain of statistical regularities that humans leverage to predict and organize behaviour. The integrative model we offer has implications that can advance theories of cognition, enculturation, adaptation, and psychopathology. Crucially, this formal (variational) treatment seeks to resolve key debates in current cognitive science, such as the distinction between internalist and externalist accounts of theory of mind abilities and the more fundamental distinction between dynamical and representational accounts of enactivism. (shrink)

I provide a theory of the metaphysical foundations of identity: an account what grounds facts of the form a=b. In particular, I defend the claim that indiscernibility grounds identity. This is typically rejected because it is viciously circular; plausible assumptions about the logic of ground entail that the fact that a=b partially grounds itself. The theory I defend is immune to this circularity.

Delves into the complexity of Paine's character as well as his efforts on behalf of popular causes in America, France, and England.

An oracle A is low-for-speed if it is unable to speed up the computation of a set which is already computable: if a decidable language can be decided in time $t(n)$ using A as an oracle, then it can be decided without an oracle in time $p(t(n))$ for some polynomial p. The existence of a set which is low-for-speed was first shown by Bayer and Slaman who constructed a non-computable computably enumerable set which is low-for-speed. In this paper we answer (...) a question previously raised by Bienvenu and Downey, who asked whether there is a minimal degree which is low-for-speed. The standard method of constructing a set of minimal degree via forcing is incompatible with making the set low-for-speed; but we are able to use an interesting new combination of forcing and full approximation to construct a set which is both of minimal degree and low-for-speed. (shrink)