Culture in Mind is an ethnographic portrait of the human mind. Using case studies from both western and nonwestern societies. Shore argues that "cultural models" are necessary to the functioning of the human mind. Drawing on recent developments in cognitive science as well as anthropology, Culture in Mind explores the cognitive world of culture in the ongoing production of meaning in everyday thinking and feeling.

"Clearly argued and captivatingly developed through subtle analyses of ethnographic materials...[this book] will revitalize cultural anthropology."--Fredrik Barth.

In this paper we discuss several generalization of theorems from stability theory to simple theories. Cherlin and Hrushovski, in [2] develop a substitute for canonical bases in finite rank, ω-categorical supersimple theories. Motivated by methods there, we prove the existence of canonical bases (in a suitable sense) for types in any simple theory. This is done in Section 2. In general these canonical bases will (as far as we know) exist only as “hyperimaginaries”, namely objects of the forma/Ewhereais a possibly (...) infinite tuple andEa type-definable equivalence relation. (In the supersimple, ω-categorical case, these reduce to ordinary imaginaries.) So in Section 1 we develop the general theory of hyperimaginaries and show how first order model theory (including the theory of forking) generalises to hyperimaginaries. We go on, in Section 3 to show the existence and ubiquity of regular types in supersimple theories, ω-categorical simple structures and modularity is discussed in Section 4. It is also shown here how the general machinery of simplicity simplifies some of the general theory of smoothly approximable (or Lie-coordinatizable) structures from [2].Throughout this paper we will work in a large, saturated modelMof a complete theoryT. All types, sets and sequences will have size smaller than the size ofM. We will assume that the reader is familiar with the basics of forking in simple theories as laid out in [4] and [6]. For basic stability-theoretic results concerning regular types, orthogonality etc., see [1] or [9]. (shrink)

Let T be simple, work in Ceq over a boundedly closed set. Let p ∈ S(θ) be internal in a quasi-stably-embedded type-definable set Q (e.g., Q is definable or stably-embedded) and suppose (p, Q) is ACL-embedded in Q (see definitions below). Then Aut(p/Q) with its action on pC is type-definable in Ceq over θ. In particular, if p ∈ S(θ) is internal in a stably-embedded type-definable set Q, and pC υ Q is stably-embedded, then Aut(p/Q) is type-definable with its action (...) on pC. (shrink)

We show that there are Π5 formulas in the language of the Turing degrees, [Formula: see text], with ≤, ∨ and ∧, that define the relations x″ ≤ y″, x″ = y″ and so {x ∈ L2 = x ≥ y|x″ = y″} in any jump ideal containing 0. There are also Σ6&Π6 and Π8 formulas that define the relations w = x″ and w = x', respectively, in any such ideal [Formula: see text]. In the language with just ≤ (...) the quantifier complexity of each of these definitions increases by one. For a lower bound on definability, we show that no Π2 or Σ2 formula in the language with just ≤ defines L2 or L2. Our arguments and constructions are purely degree theoretic without any appeals to absoluteness considerations, set theoretic methods or coding of models of arithmetic. As a corollary, we see that every automorphism of [Formula: see text] is fixed on every degree above 0″ and every relation on [Formula: see text] which is invariant under the double jump or under join with 0″ is definable over [Formula: see text] if and only if it is definable in second order arithmetic with set quantification ranging over sets whose degrees are in [Formula: see text]. (shrink)

Part of the ingenious quality of LEGO is that it is a system of play, fundamentally based on interconnecting sets of parts and open‐endedness. Nowadays, themed and specialized LEGO playsets far outnumber the more free‐form building oriented sets we might see on store shelves. Everything from the themed LEGO Space and LEGO City to extensions of the imaginary franchise universes of Star Wars, Harry Potter, and The Simpsons suggest a kind of play experience where purely imagination‐driven building becomes secondary to (...) the kinds of storytelling and narrative play that LEGO playsets encourage. The different kinds of play—LEGO playset building compared to LEGO video game playing—can be thought of as ludus (more structured, goal‐oriented play) and paidia (exuberant, spontaneous free play). LEGO in many ways serves as a helpful analogy for how philosophical thinking can lead people toward new connections between their thoughts and ideas. LEGO and philosophy invite them to question the nature of play. (shrink)

As the last of the Jedi, Luke must now pass on what he has learned of the Force, presumably to restart the Jedi Order. In the imaginations of many, Luke simply must have continued his rise, becoming one of the most powerful living beings in the universe. Deleuze draws his notion of the forces of becoming partly from German philosopher Friedrich Nietzsche, who says that the world is “a monster of energy, without beginning, without end” that “only transforms itself” as (...) “a play of forces and waves of forces, a sea of forces flowing and rushing together, eternally changing, with an ebb and a flood of its forms.” Deleuze's interpretation is that all bodies, all physical things, are “nothing but forces” defined solely by their activities of affecting – and being affected by – other things with which they interact. (shrink)

It is commonly assumed that teasing is restricted to encounters among intimates or close acquaintances. As a result of examining initial interactions among speakers of English, however, this article shows that teasing also occurs between persons who are becoming acquainted. Analysis reveals that tease sequences unfold across three actions that constitute the tease as an invitation to intimacy: a teasable action on the part of the target, the tease proper and a moment of interactionally generated affiliation. Given teasing is one (...) way of criticising another, it constitutes a potential breach of tact or interactional propriety. In initial interactions, however, participants can construe this potential impropriety as an invitation to intimacy, as it involves the proposal of a shared ironic stance that may be either accepted or declined by the target of the tease. (shrink)

A countable unidimensional theory without the omitting types order property (OTOP) has prime models over pairs and is hence classifiable. We show that this is not true for uncountable unidimensional theories.

The Connes Embedding Problem asks whether every separable II1 factor embeds into an ultrapower of the hyperfinite II1 factor. We show that the CEP is equivalent to the statement that every type II1 tracial von Neumann algebra has a computable universal theory.

We answer a question of Cassidy and Kolchin about the universality of the constrained closure of a differential field by working in a larger category of models.

We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus in particular on the principles ADS (Ascending or Descending Sequence), which states that every infinite linear order has either an infinite descending sequence or an infinite ascending sequence, and CAC (Chain-AntiChain), which states that every infinite partial order has either an infinite chain or an infinite antichain. It is well-known that Ramsey's Theorem for pairs (...) (RT₂²) splits into a stable version (SRT₂²) and a cohesive principle (COH). We show that the same is true of ADS and CAC, and that in their cases the stable versions are strictly weaker than the full ones (which is not known to be the case for RT₂² and SRT₂²). We also analyze the relationships between these principles and other systems and principles previously studied by reverse mathematics, such as WKL₀, DNR, and BΣ₂. We show, for instance, that WKL₀ is incomparable with all of the systems we study. We also prove computability-theoretic and conservation results for them. Among these results are a strengthening of the fact, proved by Cholak, Jockusch, and Slaman, that COH is Π₁¹-conservative over the base system RCA₀. We also prove that CAC does not imply DNR which, combined with a recent result of Hirschfeldt, Jockusch, Kjos-Hanssen, Lempp, and Slaman, shows that CAC does not imply SRT₂² (and so does not imply RT₂²). This answers a question of Cholak, Jockusch, and Slaman. Our proofs suggest that the essential distinction between ADS and CAC on the one hand and RT₂² on the other is that the colorings needed for our analysis are in some way transitive. We formalize this intuition as the notions of transitive and semitransitive colorings and show that the existence of homogeneous sets for such colorings is equivalent to ADS and CAC, respectively. We finish with several open questions. (shrink)

This paper is essentially the author's Gödel Lecture at the ASL Logic Colloquium '09 in Sofia extended and supplemented by material from some other papers. After a brief description of traditional reverse mathematics, a computational approach to is presented. There are then discussions of some interactions between reverse mathematics and the major branches of mathematical logic in terms of the techniques they supply as well as theorems for analysis. The emphasis here is on ones that lie outside the usual main (...) systems of reverse mathematics. While retaining the usual base theory and working still within second order arithmetic, theorems are described that range from those far below the usual systems to ones far above. (shrink)

Jean-Pierre Dupuy argues that our failure to prevent the looming climate catastrophe results from a faulty metaphysics of time: because we believe the present can proceed down one of the many branches that extend into the future, some of which bypass the catastrophe, we do not think it is absolutely urgent to take drastic action now. His solution to this problem of demotivation is “enlightened doomsaying” in “projected time”, which means that we affirm the coming catastrophe as something real in (...) the future rather than being a mere possibility; thus, we regard it seriously enough that we are motivated to take the needed actions to prevent it. One potential obstacle to this proposal is that it requires the forming of consensus and coordination with the powerful players who benefit from our current path and whose apparently near-total grip on this catastrophic future may itself discourage action. We then consider an alternative model based on Gilles Deleuze’s philosophy of the present–future relation. Although it has the branching structure that Dupuy is wary of, it may not suffer from the same problem of demotivation on account of the way it conceives the complex structure of the present event. For this reason, the Deleuzian model may be more suited to motivating action in a world where the future must be fought for rather than unanimously agreed upon. (shrink)

To compare Merleau-Ponty’s and Deleuze’s phenomenal bodies, I first examine how for Merleau-Ponty phenomena appear on the basis of three levels of integration: 1) between the parts of the world, 2) between the parts of the body, and 3) between the body and its world. I contest that Deleuze’s attacks on phenomenology can be seen as constructive critiques rather than as being expressions of an anti-phenomenological position. By building from Deleuze’s definition of the phenomenon and from his more phenomenologically relevant (...) writings, we find that phenomena for him are given to the body under exactly the opposite conditions as for Merleau-Ponty, namely that 1) the world’s differences 2) appear to a disordered body that 3) comes into shocking affective contact with its surroundings. I argue that a Deleuzian theory of bodily-given phenomena is better suited than Merleau-Ponty’s model in the task of accounting for the intensity of phenomenal appearings. (shrink)

Ambos-Spies, K. and R.A. Shore, Undecidability and 1-types in the recursively enumerable degrees, Annals of Pure and Applied Logic 63 3–37. We show that the theory of the partial ordering of recursively enumerable Turing degrees is undecidable and has uncountably many 1-types. In contrast to the original proof of the former which used a very complicated O''' argument our proof proceeds by a much simpler infinite injury argument. Moreover, it combines with the permitting technique to get similar results for (...) any ideal of the r.e. degrees. (shrink)

In this paper we investigate computable models of -categorical theories and Ehrenfeucht theories. For instance, we give an example of an -categorical but not -categorical theory such that all the countable models of except its prime model have computable presentations. We also show that there exists an -categorical but not -categorical theory such that all the countable models of except the saturated model, have computable presentations.

French philosopher Gilles Deleuze wrote two 'logic' books: Francis Bacon: The Logic of Sensation and The Logic of Sense. However, in neither of these books nor in any other works does Deleuze articulate in a formal way the features of the logic he employs. He certainly does not use classical logic. And the best options for the non-classical logic that he may be implementing are: fuzzy, intuitionist, and many-valued. These are applicable to his concepts of heterogeneous composition and becoming, affirmative (...) synthetic disjunction, and powers of the false. In The Logic of Gilles Deleuze. Volume 1: Basic Principles, Corry Shores examines the applicability of three non-classical logics to Deleuze's philosophy, by building from the philosophical and logical writings of Graham Priest, the world's leading proponent of dialetheism. Through so doing, Shores demonstrates how Deleuze's logic is best understood as a dialetheic, paraconsistent, many-valued logic. (shrink)