We work in the context of ω-stable theories. We obtain a natural, algebraic equivalent of ENI-NDOP and discuss recent joint proofs with Shelah that if an ω-stable theory has either ENI-DOP or is ENI-NDOP and is ENI-deep, then the set of models of T with universe ω is Borel complete.

If T has only countably many complete types, yet has a type of infinite multiplicity then there is a c.c.c. forcing notion Q such that, in any Q-generic extension of the universe, there are non-isomorphic models M 1 and M 2 of T that can be forced isomorphic by a c.c.c. forcing. We give examples showing that the hypothesis on the number of complete types is necessary and what happens if `c.c.c.' is replaced by other cardinal-preserving adjectives. We also give (...) an example showing that membership in a pseudo-elementary class can be altered by very simple cardinal-preserving forcings. (shrink)

A countable, atomically stable structure U in a finite, relational language has fewer than 2 ω non-isomorphic substructures if and only if U is cellular. An example shows that the finiteness of the language is necessary.

We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure M. We prove that if T is a complete L-theory, then T is mutually algebraic if and only if there is some model M of T for which every atomic formula has uniformly bounded arrays. Moreover, an incomplete theory T is mutually algebraic if and only if every atomic formula has uniformly bounded arrays in every model M of T.

We describe the Ax-Kochen definable subsets of the value group of a Hensel field and apply our results to a problem on identifying invariant factors in Hecke algebras.

We prove that if M is any model of a trivial, weakly minimal theory, then the elementary diagram T(M) eliminates quantifiers down to Boolean combinations of certain existential formulas.

We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion $(M,A)$ by a unary predicate with the finite cover property. We show that every structure has a maximal mutually algebraic reduct, and give a strong structure theorem for the class of elementary extensions of a fixed mutually algebraic (...) structure. (shrink)

We give an example of a countable theory $T$ such that for every cardinal $\lambda \geq \aleph_2$ there is a fully indiscernible set $A$ of power $\lambda$ such that the principal types are dense over $A$, yet there is no atomic model of $T$ over $A$. In particular, $T$ is a theory of size $\lambda$ where the principal types are dense, yet $T$ has no atomic model.

A class K of structures is controlled if for all cardinals λ, the relation of L∞,λ-equivalence partitions K into a set of equivalence classes . We prove that no pseudo-elementary class with the independence property is controlled. By contrast, there is a pseudo-elementary class with the strict order property that is controlled 69–88).

We sharpen Hájek’s Completeness Theorem for theories extending predicate product logic, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Pi\forall}$$\end{document}. By relating provability in this system to embedding properties of ordered abelian groups we construct a universal BL-chain L in the sense that a sentence is provable from \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Pi\forall}$$\end{document} if and only if it is an L-tautology. As well we characterize the class of lexicographic sums that have this universality property.

A class K of structures is controlled if, for all cardinals λ, the relation of L ∞,λ-equivalence partitions K into a set of equivalence classes (as opposed to a proper class). We prove that the class of doubly transitive linear orders is controlled, while any pseudo-elementary class with the ω-independence property is not controlled.

Fix a weakly minimal (i.e. superstable U-rank 1) structure M. Let M∗ be an expansion by constants for an elementary substructure, and let A be an arbitrary subset of the universe M. We show that all formulas in the expansion (M∗,A) are equivalent to bounded formulas, and so (M,A) is stable (or NIP) if and only if the M-induced structure AM on A is stable (or NIP). We then restrict to the case that M is a pure abelian group with (...) a weakly minimal theory, and AM is mutually algebraic (equivalently, weakly minimal with trivial forking). This setting encompasses most of the recent research on stable expansions of (Z,+). Using various characterizations of mutual algebraicity, we give new examples of stable structures of the form (M,A). Most notably, we show that if (G,+) is a weakly minimal additive subgroup of the algebraic numbers, A⊆G is enumerated by a homogeneous linear recurrence relation with algebraic coefficients, and no repeated root of the characteristic polynomial of A is a root of unity, then (G,+,B) is superstable for any B⊆A. (shrink)

We study o-minimal expansions of Archimedean totally ordered groups. We first prove that any such expansion must be elementarily embeddable via a unique (provided some nonzero element is 0-definable) elementary embedding into a unique o-minimal expansion of the additive ordered group of real numbers R. We then show that a definable function in an o-minimal expansion of R enjoys good differentiability properties and use this to prove that an Archimedean real closed field is definable in any nonsemilinear expansion of R. (...) Combining these results, we obtain several restrictions on possible o-minimal expansions of arbitrary Archimedean ordered groups and in particular of the rational ordered group. (shrink)

We study classes of atomic models \ of a countable, complete first-order theory T. We prove that if \ is not \-small, i.e., there is an atomic model N that realizes uncountably many types over \\) for some finite \ from N, then there are \ non-isomorphic atomic models of T, each of size \.

We explore the existence and the size of infinite models of categorical theories having cardinality less than the size of the associated Tarski-Lindenbaum algebra. Restricting to totally transcendental, categorical theories we show that “Every tiny model is countable” is independent of ZFC. IfT is trivial there is at most one tiny model, which must be the algebraic closure of the empty set. We give a new proof that there are no tiny models ifT is not totally transcendental and is non-trivial.

We show that if T is a trivial uncountably categorical theory of Morley Rank 1 then T is model complete after naming constants for a model.

We prove two results intended to streamline proofs about cellularity that pass through mutual algebraicity. First, we show that a countable structure M is cellular if and only if M is \-categorical and mutually algebraic. Second, if a countable structure M in a finite relational language is mutually algebraic non-cellular, we show it admits an elementary extension adding infinitely many infinite MA-connected components. Towards these results, we introduce MA-presentations of a mutually algebraic structure, in which every atomic formula is mutually (...) algebraic. This allows for an improved quantifier elimination and a decomposition of the structure into independent pieces. We also show this decomposition is largely independent of the MA-presentation chosen. (shrink)

We show that if a countable structure M in a finite relational language is not cellular, then there is an age-preserving $N \supseteq M$ such that $2^{\aleph _0}$ many structures are bi-embeddable with N. The proof proceeds by a case division based on mutual algebraicity.

We characterize when the elementary diagram of a mutually algebraic structure has a model complete theory, and give an explicit description of a set of existential formulas to which every formula is equivalent. This characterization yields a new, more constructive proof that the elementary diagram of any model of a strongly minimal, trivial theory is model complete.

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete one-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has a Borel complete reduct, and if a theory T is not $\omega $ -stable, then the elementary diagram of some countable model of T has a Borel complete reduct.

In this paper, we study VC-minimal theories and explore related concepts. We first define the notion of convex orderablity and show that this lies strictly between VC-minimality and dp-minimality. To do this we prove a general result about set systems with independence dimension ≤ 1. Next, we define the notion of weak VC-minimality, show it lies strictly between VC-minimality and dependence, and show that all unstable weakly VC-minimal theories interpret an infinite linear order. Finally, we define the notion full VC-minimality, (...) show that this lies strictly between weak o-minimality and VC-minimality, and show that theories that are fully VC-minimal have low VC-density. (shrink)

Given a sequence {a n } in (0,1) converging to a rational, we examine the model theoretic properties of structures obtained as limits of Shelah-Spencer graphs G(m, m -αn ). We show that in most cases the model theory is either extremely well-behaved or extremely wild, and characterize when each occurs.

We describe techniques for constructing models of size continuum inωsteps by simultaneously building a perfect set of enmeshed countable Henkin sets. Such models have perfect, asymptotically similar subsets. We survey applications involving Borel models, atomic models, two-cardinal transfers and models respecting various closure relations.

We consider the question of when, given a subset A of M, the setwise stabilizer of the group of automorphisms induces a closed subgroup on Sym(A). We define s-homogeneity to be the analogue of homogeneity relative to strong embeddings and show that any subset of a countable, s-homogeneous, ω-stable structure induces a closed subgroup and contrast this with a number of negative results. We also show that for ω-stable structures s-homogeneity is preserved under naming countably many constants, but under slightly (...) weaker conditions it can be lost by naming a single point. (shrink)

We define a new topology on the space of strong types of a given theory and use it to state an omitting types theorem for countably saturated models of the theory. As an application we show that if T is a small, stable theory of finite weight such that every elementary extension of the countably saturated model is ω-saturated then every weakly saturated model is ω-saturated.

In this paper we prove strong completeness of axiomatic extensions of first-order strict core fuzzy logics with the so-called quasi-witnessed axioms with respect to quasi-witnessed models. As a consequence we obtain strong completeness of Product Predicate Logic with respect to quasi-witnessed models, already proven by M.C. Laskowski and S. Malekpour in [19]. Finally we study similar problems for expansions with Δ, define Δ-quasi-witnessed axioms and prove that any axiomatic extension of a first-order strict core fuzzy logic, expanded with Δ, (...) and Δ-quasi-witnessed axioms are complete with respect to Δ-quasi-witnessed models. (shrink)

The philosophical theory of scientific explanation proposed here involves a radically new treatment of causality that accords with the pervasively statistical character of contemporary science. Wesley C. Salmon describes three fundamental conceptions of scientific explanation--the epistemic, modal, and ontic. He argues that the prevailing view is untenable and that the modal conception is scientifically out-dated. Significantly revising aspects of his earlier work, he defends a causal/mechanical theory that is a version of the ontic conception. Professor Salmon's theory furnishes a robust (...) argument for scientific realism akin to the argument that convinced twentieth-century physical scientists of the existence of atoms and molecules. To do justice to such notions as irreducibly statistical laws and statistical explanation, he offers a novel account of physical randomness. The transition from the "reviewed view" of scientific explanation to the causal/mechanical model requires fundamental rethinking of basic explanatory concepts. (shrink)

This classic and controversial book examines the roots of the idea of virtue, diagnoses the reasons for its absence in modern life, and proposes a path for its recovery.

_Rhetoric_ is the sixth volume in The New Hackett Aristotle series, a series featuring translations, with Introductions and Notes, by C. D. C. Reeve, Delta Kappa Epsilon Distinguished Professor of Philosophy at The University of North Carolina at Chapel Hill. The series will eventually include all of Aristotle's works.

Investigates the resolution of contradictions and ambiguous derogations in a code, by means of the imposition of partial orderings. Although formulated as a study in the logic of norms, it provided the initial ideas for work on the logic of theory (or belief) change, developed by the authors in a series of papers by the authors and Peter Gardenfors beginning in 1985.

Aristotle's treatise De Interpretatione is one of his central works; it continues to be the focus of much attention and debate. C. W. A. Whitaker presents the first systematic study of this work, and offers a radical new view of its aims, its structure, and its place in Aristotle's system, basing this view upon a detailed chapter-by-chapter analysis.By treating the work systematically, rather than concentrating on certain selected passages, Whitaker is able to show that, contrary to traditional opinion, it forms (...) an organized and coherent whole. He argues that the De Interpretatione is intended to provide the underpinning for dialectic, the system of argument by question and answer set out in Aristotle's Topics; and he rejects the traditional view that the De Interpretatione concerns the assertion and is oriented towards the formal logic of the Prior Analytics. In doing so, he sheds valuable new light on some of Aristotle's most famous texts. (shrink)

"This edition, which replaces the original Loeb edition..., offers text, translation, and annotation that are fully current with modern scholarship"--Front flap of dust jacket, volume 1.

C. Stephen Evans explains and defends Kierkegaard's account of moral obligations as rooted in God's commands, the fundamental command being `You shall love your neighbour as yourself'. The work will be of interest not only to those interested in Kierkegaard, but also to those interested in the relation between ethics and religion, especially questions about whether morality can or must have a religious foundation. As well as providing a comprehensive reading of Kierkegaard as an ethical thinker, Evans puts him into (...) conversation with contemporary moral theorists. Kierkegaard's divine command theory is shown to be an account that safeguards human flourishing, as well as protecting the proper relations between religion and state in a pluralistic society. (shrink)

Is there such a thing as natural knowledge of God? C. Stephen Evans presents the case for understanding theistic arguments as expressions of natural signs in order to gain a new perspective both on their strengths and weaknesses. Three classical, much-discussed theistic arguments - cosmological, teleological, and moral - are examined for the natural signs they embody. At the heart of this book lie several relatively simple ideas. One is that if there is a God of the kind accepted by (...) Christians, Jews, and Muslims, then it is likely that a 'natural' knowledge of God is possible. Another is that this knowledge will have two characteristics: it will be both widely available to humans and yet easy to resist. If these principles are right, a new perspective on many of the classical arguments for God's existence becomes possible. We understand why these arguments have for many people a continued appeal but also why they do not constitute conclusive 'proofs' that settle the debate once and for all. Touching on the interplay between these ideas and contemporary scientific theories about the origins of religious belief, particularly the role of natural selection in predisposing humans to form beliefs in God or gods, Evans concludes that these scientific accounts of religious belief are fully consistent, even supportive, of the truth of religious convictions. (shrink)

_Verificationism_ is the first comprehensive history of a concept that dominated philosophy and scientific methodology between the 1930s and the 1960s. The verificationist principle - the concept that a belief with no connection to experience is spurious - is the most sophisticated version of empiricism. More flexible ideas of verification are now being rehabilitated by a number of philosophers. C.J. Misak surveys the precursors, the main proponents and the rehabilitators. Unlike traditional studies, she follows verificationist theory beyond the demise of (...) positivism to examine its reappearance in the work of modern philosophers. Most interestingly, she argues that despite feminism's strenuous opposition to positivism, verificationist thought is at the heart of much of contemporary feminist philosophy. _Verificationism_ is an excellent assessment of a major and influential system of thought. (shrink)