This is a comprehensive study of the dynamics that underlie information processing in foreign policy decision-making, the resultant biases and errors, and the implications for the quality of decisions. The World in Their Minds is a compendium of the manifold ways that misperception and, hence, miscalculation can enter into seemingly rational policy choice. The cases of Vietnam for the Americans and the Yom Kippur War for the Israelis constitute the primary database for the number of illustrations cited.

We prove that for every simple theory T there is a compact abstract theory T.

Accumulating data suggest that the eukaryotic cell originated from a merger of two prokaryotes, an archaeal host and a bacterial endosymbiont. However, since prokaryotes are unable to perform phagocytosis, the means by which the endosymbiont entered its host is an enigma. We suggest that a predatory or parasitic interaction between prokaryotes provides a reasonable explanation for this conundrum. According to the model presented here, the host in this interaction was an anaerobic archaeon with a periplasm‐like space. The predator was a (...) small (facultative) aerobic α‐proteobacterium, which penetrated and replicated within the host periplasm, and later became the mitochondria. Plausible conditions under which this interaction took place and circumstances that may have led to the contemporary complex eukaryotic cell are discussed. (shrink)

This article starts with a critical reflection on John Westlake’s reading of the history of empire and the English/British East India Company – for him, essentially, the proper concern of ‘constitutional history’ rather than international law. For Westlake, approaching this history through the prism of nineteenth-century positivist doctrine, the Company’s exercise of war powers could only result from state delegation. Against his warnings to international lawyers not to stray from the proper boundaries of international legal inquiry, the article proceeds to (...) recover Hugo Grotius’s theory of corporate belligerency in his early treatise De iure praedae. For Grotius, corporations could wage public war on behalf of the state yet, at the same time, were in law capable of waging private war in their own right. The article proceeds to reflect on the practice of corporate belligerency in the centuries separating Westlake and Grotius; it concludes with observations on the implications of Grotius’s theory of corporate belligerency today. (shrink)

We develop positive model theory, which is a non first order analogue of classical model theory where compactness is kept at the expense of negation. The analogue of a first order theory in this framework is a compact abstract theory: several equivalent yet conceptually different presentations of this notion are given. We prove in particular that Banach and Hilbert spaces are compact abstract theories, and in fact very well-behaved as such.

We continue [2], developing simplicity in the framework of compact abstract theories. Due to the generality of the context we need to introduce definitions which differ somewhat from the ones use in first order theories. With these modified tools we obtain more or less classical behaviour: simplicity is characterized by the existence of a certain notion of independence, stability is characterized by simplicity and bounded multiplicity, and hyperimaginary canonical bases exist.

We introduce the notion of a lovely pair of models of a simple theory T, generalizing Poizat's “belles paires” of models of a stable theory and the third author's “generic pairs” of models of an SU-rank 1 theory. We characterize when a saturated model of the theory TP of lovely pairs is a lovely pair , finding an analog of the nonfinite cover property for simple theories. We show that, under these hypotheses, TP is also simple, and we study forking (...) and canonical bases in TP. We also prove that assuming only that T is low, the existentially universal models of the universal part of a natural expansion TP+ of TP, are lovely pairs, and “simple Robinson universal domains”. (shrink)

We prove that under reasonable assumptions, every cat (compact abstract theory) is metric, and develop some of the theory of metric cats. We generalise Morley's theorem: if a countable Hausdorff cat T has a unique complete model of density character Λ ≥ ω₁, then it has a unique complete model of density character Λ for every Λ ≥ ω₁.

We give a general framework for the treatment of perturbations of types and structures in continuous logic, allowing to specify which parts of the logic may be perturbed. We prove that separable, elementarily equivalent structures which are approximately $aleph_0$-saturated up to arbitrarily small perturbations are isomorphic up to arbitrarily small perturbations. As a corollary, we obtain a Ryll-Nardzewski style characterisation of complete theories all of whose separable models are isomorphic up to arbitrarily small perturbations.

We develop the general theory of topometric spaces, i.e., topological spaces equipped with a well-behaved lower semi-continuous metric. Spaces of global and local types in continuous logic are the motivating examples for the study of such spaces. In particular, we develop Cantor-Bendixson analysis of topometric spaces, which can serve as a basis for the study of local stability (extending the ad hoc development in Ben Yaacov I and Usvyatsov A, Continuous first order logic and local stability. Trans Am Math (...) Soc, in press), as well as of global ${\aleph_0}$ -stability. We conclude with a study of perturbation systems (see Ben Yaacov I, On perturbations of continuous structures, submitted) in the formalism of topometric spaces. In particular, we show how the abstract development applies to ${\aleph_0}$ -stability up to perturbation. (shrink)

We revisit the foundations of positive model theory, introducing h-inductive sentences. These allow a considerably simplified presentation of positive model theory, as well as a characterisation of Hausdorff cats by an amalgamation property of their h-inductive theory.

We present an adaptation of continuous first order logic to unbounded metric structures. This has the advantage of being closer in spirit to C. Ward Henson's logic for Banach space structures than the unit ball approach, as well as of applying in situations where the unit ball approach does not apply. We also introduce the process of single point emph{emboundment}, allowing to bring unbounded structures back into the setting of bounded continuous first order logic. Together with results from cite{BenYaacov:Perturbations} regarding (...) perturbations of bounded metric structures, we prove a Ryll-Nardzewski style characterisation of theories of Banach spaces which are separably categorical up to small perturbation of the norm. This last result is motivated by an unpublished result of Henson. (shrink)

We present a framework for model theoretic forcing in a non first order context, and present some applications of this framework to Banach space theory.

In this book, Shlomo Biderman examines the views, outlooks, and attitudes of two distinct cultures: the West and classical India. He turns to a rich and varied collection of primary sources: the _Rg Veda_, the Upanishads, and texts by the Buddhist philosophers Någårjuna and Vasubandhu, among others. In studying the West, Biderman considers the Bible and its commentaries, the writings of such philosophers as Plato, Descartes, Berkeley, Kant, and Derrida, and the literature of Kafka, Melville, and Orwell. Additional sources are (...) Mozart's _Don Giovanni_ and seminal films like Ingmar Bergman's _Persona_. Biderman uses concrete examples from religion and literature to illustrate the formal aspects of the philosophical problems of transcendence, language, selfhood, and the external world and then demonstrates their plausibility in actual situations. Though his method of analysis is comparative, Biderman does not adopt the disinterested stance of an "ideal" spectator. Rather, Biderman approaches ancient Indian thought and culture from a Western philosophical standpoint to uncover cultural presuppositions that can be difficult to expose from within the culture in question. The result is a fascinating landmark in the study of Indian and Western thought. Through his comparative prism, Biderman explores the most basic ideas underlying human culture, and his investigation not only sheds light on India's philosophical traditions but also facilitates a deeper understanding of our own. (shrink)

In Israel, whistleblowing in the nursing profession has been largely ignored. This topic is neither part of the professional—ethical discourse nor a subject for research. Focusing on the divide between internal and external whistleblowing, this article presents a study that explores nurses’ willingness to disclose an act that could jeopardize the rights or safety of patients. Internal disclosure entails reporting wrongdoing to an authority within the organization. External disclosure involves reporting the offense to an outside agency, such as a professional (...) organization or the press. The study’s findings indicate that the nurse respondents viewed both the harmful misconduct of a colleague and that of a manager as being very serious. In such dilemmas the nurses reported a desire to correct the wrongdoing and a concomitant willingness to act. They were, however, much more likely to whistleblow internally rather than externally. This study revealed a pattern of nurses’ progressive retraction as the circle of disclosure widened. (shrink)

We prove that in a continuous ℵ₀-stable theory every type-definable group is definable. The two main ingredients in the proof are: 1. Results concerning Morley ranks (i.e., Cantor-Bendixson ranks) from [Ben08], allowing us to prove the theorem in case the metric is invariant under the group action; and 2. Results concerning the existence of translation-invariant definable metrics on type-definable groups and the extension of partial definable metrics to total ones.

This paper completes the proof of the group configuration theorem for simple theories started in [1]. We introduce the notion of an almost hyperdefinable structure, and show that it has a reasonable model theory. We then construct an almost hyperdefinable group from a polygroup chunk.

We study in detail the blow-up procedure described in [BTW01]. We obtain a structure theorem for coreless polygroups as a double quotient space G//H, and a polygroup chunk theorem. Seeking to remove the arbitrary parameter needed for the blow-up, we find canonical Ø-invariant groupoids.

-/- Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) to various natural classes of complete metric structures (such as probability algebras, Hilbert spaces, and Banach spaces). With research in continuous first-order logic preoccupied with studying the model theory of this framework, we find a natural question calls for attention. Is there an interesting set of axioms yielding a completeness result? -/- The primary purpose (...) of this article is to show that a certain, interesting set of axioms does indeed yield a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely) satisfiable if (and only if) it is consistent. From this result it follows that continuous first-order logic also satisfies an approximated form of strong completeness, whereby Σ⊧φ (if and) only if Σ⊢φ ∸2−n for all n < ω. This approximated form of strong completeness asserts that if Σ⊧φ, then proofs from Σ, being finite, can provide arbitrarily better approximations of the truth of φ. -/- Additionally, we consider a different kind of question traditionally arising in model theory—that of decidability. When is the set of all consequences of a theory (in a countable, recursive language) recursive? Say that a complete theory T is decidable if for every sentence φ, the value φ T is a recursive real, and moreover, uniformly computable from φ. If T is incomplete, we say it is decidable if for every sentence φ the real number φ T o is uniformly recursive from φ, where φ T o is the maximal value of φ consistent with T. As in classical first-order logic, it follows from the completeness theorem of continuous first-order logic that if a complete theory admits a recursive (or even recursively enumerable) axiomatization then it is decidable. (shrink)

Background:Cardio-pulmonary resuscitation is the default procedure during cardio-pulmonary arrest. If a patient does not want cardio-pulmonary resuscitation, then a do not attempt resuscitation order must be documented. Often, this order is not given; even if thought to be appropriate. This situation can lead to a slow code, defined as an ineffective resuscitation, where all resuscitation procedures are not performed or done slowly.Research objectives:To describe the perceptions of nurses working on internal medicine wards of slow codes, including the factors associated with (...) its implementation.Research design:This was a cross-sectional, descriptive study. Participants completed a personal characteristics questionnaire and the Perceptions and Factors of Slow Codes questionnaire designed for this study.Participants and research context:The sample was a convenience sample of nurses working on internal medicine wards in two Israeli hospitals.Ethical considerations:The study received ethical approval from both institutions, where data were collected and stored according to institutional policy.Findings:Most reported that resuscitations were conducted according to protocol. Some took their time calling the code, or waited by the bedside and did not perform cardio-pulmonary resuscitation. Factors most associated with slow codes were poor patient prognosis and a low chance of patient survival. Two-thirds reported that slow codes were done on their unit and the majority perceived slow codes as ethical.Discussion:This study confirms that slow codes are part of medical care on internal medicine wards, where most nurses perceive them as an ethical alternative. These perceptions are in contrast to most legal and ethical opinions expressed in the literature.Conclusion:Nurses should be educated about the legal and ethical implications of slow codes, and qualitative and quantitative studies should be conducted that further investigate its implementation. (shrink)

We develop several aspects of local and global stability in continuous first order logic. In particular, we study type-definable groups and genericity.

1. We show that if p is a real type which is internal in a set $\sigma$ of partial types in a simple theory, then there is a type p' interbounded with p, which is finitely generated over $\sigma$ , and possesses a fundamental system of solutions relative to $\sigma$ . 2. If p is a possibly hyperimaginary Lascar strong type, almost \sigma-internal$ , but almost orthogonal to $\sigma^{\omega}$ , then there is a canonical non-trivial almost hyperdefinable polygroup which multi-acts (...) on p while fixing $\sigma$ generically. In case p is $\sigma-internal$ and T is stable, this is the binding group of p over \sigma$. (shrink)

Abstract According to idealism the world, as we perceive it, is in effect a creation of the mind. There are many different forms of idealism and this paper investigates one form of idealism that was advocated by the 4th century Buddhist Yog?c?rin Vasubandhu and one not unfamiliar in the west, especially in the works of George Berkeley. This paper suggests that when idealism, as a metaphysical theory, is set within a soteriological framework, as is the case with Vasubandhu, it serves (...) to bridge the philosophical endeavour with the religious quest as outlined in Buddhist thought. Idealism is a theory about the borders between mind and matter, and specifically about the demolition of matter. This demolition, in the hands of Vasubandhu, manages to redefine the framework of speculation by incorporating the soteriological within it and thus constructing a viable bridge between philosophy and religion. (shrink)

In recent years, scientists have increasingly taken to investigate the predictive nature of cognition. We argue that prediction relies on abstraction, and thus theories of predictive cognition need an explicit theory of abstract representation. We propose such a theory of the abstract representational capacities that allow humans to transcend the “here-and-now.” Consistent with the predictive cognition literature, we suggest that the representational substrates of the mind are built as ahierarchy, ranging from the concrete to the abstract; however, we argue that (...) there are qualitative differences between elements along this hierarchy, generating meaningful, often unacknowledged,diversity.Echoing views from philosophy, we suggest that the representational hierarchy can be parsed into:modality-specificrepresentations, instantiated on perceptual similarity;multimodalrepresentations, instantiated primarily on the discovery of spatiotemporal contiguity; andcategoricalrepresentations, instantiated primarily on social interaction. These elements serve as the building blocks ofcomplex structures discussed in cognitive psychology (e.g., episodes, scripts) and are the inputs for mental representations that behave like functions, typically discussed in linguistics (i.e.,predicators). We support our argument for representational diversity by explaining how the elements in our ontology are all required to account for humans’ predictive cognition (e.g., in subserving logic-based prediction; in optimizing the trade-off between accurate and detailed predictions) and by examining how the neuroscientific evidence coheres with our account. In doing so, we provide a testable model of the neural bases of conceptual cognition and highlight several important implications to research on self-projection, reinforcement learning, and predictive-processing models of psychopathology. (shrink)

Letterforms are an inseparable part of a civilized literary landscape. At some distant point in history, letters started as representations of things in the world. Then, gradually, through a complex evolutionary process, they came to be defined as the closed shapes of a writing system. This photo-typographic essay is a meditation on this remarkable transition. Exploring the relationship between typography and the visual world around us, the essay looks at the twenty-six letters of the English version of the Roman alphabet (...) in four manners: as the world presenting itself in the shape of a letter, as an intended letter in space, as a flat letter on paper, and finally as a pure geometric form embodied in a typeface. Familiar letterforms are presented in fresh, surprising ways, forming an homage to the beauty of type and a reflection on its ubiquity in our visual understanding of the world around us. Alongside the fascinating images, Ornan Rotem's text offers an overview and a detailed discussion of each letter. In this unusual book, text and image coalesce to create a modern day primer on letters: a typographic abecedarium. (shrink)

We point out how the "Fundamental Theorem of Stability Theory", namely the equivalence between the "non order property" and definability of types, proved by Shelah in the 1970s, is in fact an immediate consequence of Grothendieck's "Criteres de compacite" from 1952. The familiar forms for the defining formulae then follow using Mazur's Lemma regarding weak convergence in Banach spaces.

Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures to various natural classes of complete metric structures. With research in continuous first-order logic preoccupied with studying the model theory of this framework, we find a natural question calls for attention. Is there an interesting set of axioms yielding a completeness result?The primary purpose of this article is to show that a certain, interesting set of axioms does indeed yield a completeness (...) result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is satisfiable if it is consistent. From this result it follows that continuous first-order logic also satisfies an approximated form of strong completeness, whereby Σ⊨φ only if Σ⊢φ∸ 2-n for all n < ω. This approximated form of strong completeness asserts that if Σ⊨φ, then proofs from Σ, being finite, can provide arbitrarily better approximations of the truth of φ.Additionally, we consider a different kind of question traditionally arising in model theory—that of decidability. When is the set of all consequences of a theory recursive? Say that a complete theory T is decidable if for every sentence φ, the value φT is a recursive real, and moreover, uniformly computable from φ. If T is incomplete, we say it is decidable if for every sentence φ the real number φT∘ is uniformly recursive from φ, where φT∘is the maximal value of φ consistent with T. As in classical first-order logic, it follows from the completeness theorem of continuous first-order logic that if a complete theory admits a recursive axiomatization then it is decidable. (shrink)