We investigate the isomorphism types of combinatorial geometries arising from Hrushovski's flat strongly minimal structures and answer some questions from Hrushovski's original paper.

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)

This paper began as a generalization of a part of the author's PhD thesis about ACFA and ended up with a characterization of groups definable in T A . The thesis concerns minimal formulae of the form x ∈ A ∧ σ(x) = f(x) for an algebraic curve A and a dominant rational function f: A → σ(A). These are shown to be uniform in the Zilber trichotomy, and the pairs (A, f) that fall into each of the three (...) cases are characterized. These characterizations are definable in families. This paper covers approximately half of the thesis, namely those parts of it which can be made purely model-theoretic by moving from ACFA, the model companion of the class of algebraically closed fields with an endomorphism, to T A , the model companion of the class of models of an arbitrary totally-transcendental theory T with an injective endomorphism, if this model-companion exists. A T A analog of the characterization of groups definable in ACFA is obtained in the process. The full characterization of the cases of the Zilber trichotomy in the thesis is obtained from these intermediate results with heavy use of algebraic geometry. (shrink)

Let D be a strongly minimal set in the language L, and $D' \supset D$ an elementary extension with infinite dimension over D. Add to L a unary predicate symbol D and let T' be the theory of the structure (D', D), where D interprets the predicate D. It is known that T' is ω-stable. We prove Theorem A. If D is not locally modular, then T' has Morley rank ω. We say that a strongly minimal set D (...) is pseudoprojective if it is nontrivial and there is a $k < \omega$ such that, for all a, b ∈ D and closed $X \subset D, a \in \mathrm{cl}(Xb) \Rightarrow$ there is a $Y \subset X$ with a ∈ cl(Yb) and |Y| ≤ k. Using Theorem A, we prove Theorem B. If a strongly minimal set D is pseudoprojective, then D is locally projective. The following result of Hrushovski's (proved in $\S4$ ) plays a part in the proof of Theorem B. Theorem C. Suppose that D is strongly minimal, and there is some proper elementary extension D1 of D such that the theory of the pair (D1, D) is ω1-categorical. Then D is locally modular. (shrink)

It is well known that infinite minimal sets for continuous functions on the interval are Cantor sets; that is, compact zero dimensional metrizable sets without isolated points. On the other hand, it was proved in Alcaraz and Sanchis (Bifurcat Chaos 13:1665–1671, 2003) that infinite minimal sets for continuous functions on connected linearly ordered spaces enjoy the same properties as Cantor sets except that they can fail to be metrizable. However, no examples of such subsets have been known. In (...) this note we construct, in ZFC, ${2^{\mathfrak{c}}}$ non-metrizable infinite pairwise non-homeomorphic minimal sets on compact connected linearly ordered spaces. (shrink)

We construct a new class of 1 categorical structures, disproving Zilber's conjecture, and study some of their properties.

We construct a strongly minimal set which is not a finite cover of one with DMP. We also show that for a strongly minimal theory T, generic automorphisms exist iff T has DMP, thus proving a conjecture of Kikyo and Pillay.

We give an exposition of Hrushovskiʼs New Strongly Minimal Set : A strongly minimal theory which is not locally modular but does not interpret an infinite field. We give an exposition of his construction.

Suppose $D \subset M$ is a strongly minimal set definable in M with parameters from C. We say D is locally modular if for all $X, Y \subset D$ , with $X = \operatorname{acl}(X \cup C) \cap D, Y = \operatorname{acl}(Y \cup C) \cap D$ and $X \cap Y \neq \varnothing$ , dim(X ∪ Y) + dim(X ∩ Y) = dim(X) + dim(Y). We prove the following theorems. Theorem 1. Suppose M is stable and $D \subset M$ is strongly (...) minimal. If D is not locally modular then in M eq there is a definable pseudoplane. (For a discussion of M eq see [M, § A].) This is the main part of Theorem 1 of [Z2] and the trichotomy theorem of [Z3]. Theorem 2. Suppose M is stable and $D, D' \subset M$ are strongly minimal and nonorthogonal. Then D is locally modular if and only if D' is locally modular. (shrink)

The main result is Vaught's conjecture for weakly minimal, locally modular and non-ω-stable theories. The more general results yielding this are the following. THEOREM A. Suppose that T is a small unidimensional theory and D is a weakly minimal set, definable over the finite set B. Then for all finite $A \subset D$ there are only finitely many nonalgebraic strong types over B realized in $\operatorname{acl}(A) \cap D$ . THEOREM B. Suppose that T is a small, unidimensional, non-ω-stable (...) theory such that the universe is weakly minimal and locally modular. Then for all finite A there is a finite $B \subset \mathrm{cl}(A)$ such that a ∈ cl(A) iff a ∈ cl(b) for some b ∈ B. Recall the property (S) defined in the abstract of [B1]. THEOREM C. Let T be as in Theorem B. Then, if T does not satisfy (S), T has 2 ℵ 0 many countable models. Combining Theorem C and the results in [B1] we obtain Vaught's conjecture for such theories. (shrink)

We show that any structure of finite Morley Rank having the definable multiplicity property has a rank and multiplicity preserving interpretation in a strongly minimal set. In particular, every totally categorical theory admits such an interpretation. We also show that a slightly weaker version of the DMP is necessary for a structure of finite rank to have a strongly minimal expansion. We conclude by constructing an almost strongly minimal set which does not have the DMP in any (...) rank preserving expansion, and ask whether this structure is interpretable in a strongly minimal set. (shrink)

Theorem A. Let T be a small superstable theory, A a finite set, and ψ a weakly minimal formula over A which is contained in some nontrivial type which does not have Morley rank. Then ψ is contained in some nonalgebraic isolated type over A. As an application we prove Theorem B. Suppose that T is small and superstable, A is finite, and there is a nontrivial weakly minimal type p ∈ S(A) which does not have Morley rank. (...) Then the prime model over A is not minimal over A. (shrink)

A characterization of groups definable in o-minimal structures having maximal definable definably compact subgroups is given. This follows from a definable decomposition in analogy with Lie groups, where the role of maximal tori is played by maximal 0-subgroups. Along the way we give structural theorems for solvable groups, linear groups, and extensions of definably compact by torsion-free definable groups.

Theorem A. Let M be a left R-module such that Th(M) is small and weakly minimal, but does not have Morley rank 1. Let $A = \mathrm{acl}(\varnothing) \cap M$ and $I = \{r \in R: rM \subset A\}$ . Notice that I is an ideal. (i) F = R/I is a finite field. (ii) Suppose that a, b 0 ,...,b n ∈ M and a b̄. Then there are s, r i ∈ R, i ≤ n, such that sa (...) + ∑ i ≤ n r ib i ∈ A and $s \not\in I$ . It follows from Theorem A that algebraic closure in M is modular. Using this and results in [B1] and [B2], we obtain Theorem B. Let M be as in Theorem A. Then Vaught's conjecture holds for Th(M). (shrink)

One of the fundamental ethical concerns about biomedical research is that it frequently exposes participants to risks for the benefit of others. To protect participants’ rights and interests in this context, research regulations and guidelines set out a mix of substantive and procedural requirements for research involving humans. Risk thresholds play an important role in formulating both types of requirements. First, risk thresholds serve to set upper risk limits in certain types of research. Second, risk thresholds serve to demarcate risk (...) categories that streamline risk-adapted systems of ethical oversight. But although risk thresholds play such an important role in research governance, there is a need both to better define the existing risk thresholds and to delineate new thresholds in order to develop more risk-adapted systems of research oversight. The present paper examines the existing minimal risk threshold and the surrounding debates with the goal of deriving a systematic approach to setting thresholds of research risk. (shrink)

We prove a cell decomposition theorem for Presburger sets and introduce a dimension theory for Z-groups with the Presburger structure. Using the cell decomposition theorem we obtain a full classification of Presburger sets up to definable bijection. We also exhibit a tight connection between the definable sets in an arbitrary p-minimal field and Presburger sets in its value group. We give a negative result about expansions of Presburger structures and prove uniform elimination of imaginaries for Presburger structures within the (...) Presburger language. (shrink)

Let (M, ≤,...) denote a Boolean ordered o-minimal structure. We prove that a Boolean subalgebra of M determined by an algebraically closed subset contains no dense atoms. We show that Boolean algebras with finitely many atoms do not admit proper expansions with o-minimal theory. The proof involves decomposition of any definable set into finitely many pairwise disjoint cells, i.e., definable sets of an especially simple nature. This leads to the conclusion that Boolean ordered structures with o-minimal theories (...) are essentially bidefinable with Boolean algebras with finitely many atoms, expanded by naming constants. We also discuss the problem of existence of proper o-minimal expansions of Boolean algebras. (shrink)

We prove weak elimination of imaginary elements for Boolean orderings with finitely many atoms. As a consequence we obtain equivalence of the two notions of o-minimality for Boolean ordered structures, introduced by C. Toffalori. We investigate atoms in Boolean algebras induced by algebraically closed subsets of Boolean ordered structures. We prove uniqueness of prime models in strongly o-minimal theories of Boolean ordered structures.

TheoremEvery model of ZFChas a conservative elementary extension which possesses a cofinal minimal elementary extension.An application of Boolean ultrapowers to models of full arithmetic is also presented.

We study the Hardy field associated with an o-minimal expansion of the real numbers. If the set of analytic germs is dense in the Hardy field, then we can definably analytically separate sets in , and we can definably analytically approximate definable continuous unary functions. A similar statement holds for definable smooth functions.

There are at least two plausible generalisations of subjective expected utility (SEU) theory: cumulative prospect theory (which relaxes the independence axiom) and Levi’s decision theory (which relaxes at least ordering). These theories call for a re-assessment of the minimal requirements of rational choice. Here, I consider how an analysis of sequential decision making contributes to this assessment. I criticise Hammond’s (Economica 44(176):337–350, 1977; Econ Philos 4:292–297, 1988a; Risk, decision and rationality, 1988b; Theory Decis 25:25–78, 1988c) ‘consequentialist’ argument for the (...) SEU preference axioms, but go on to formulate a related diachronic-Dutch-book-style’ argument that better achieves Hammond’s aims. Some deny the importance of Dutch-book sure losses, however, in which case, Seidenfeld’s (Econ Philos 4:267–290, 1988a) argument that distinguishes between theories that relax independence and those that relax ordering is relevant. I unravel Seidenfeld’s argument in light of the various criticisms of it and show that the crux of the argument is somewhat different and much more persuasive than what others have taken it to be; the critical issue is the modelling of future choices between ‘indifferent’ decision-tree branches in the sequential setting. Finally, I consider how Seidenfeld’s conclusions might nonetheless be resisted. (shrink)

Let M=\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}=}$$\end{document} be a weakly o-minimal expansion of a dense linear order without endpoints. Some tame properties of sets and functions definable in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} which hold in o-minimal structures, are examined. One of them is the intermediate value property, say IVP. It is shown that strongly continuous definable functions in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} (...) \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} satisfy an extended version of IVP. After introducing a weak version of definable connectedness in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document}, we prove that strong cells in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} are weakly definably connected, so every set definable in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} is a finite union of its weakly definably connected components, provided that M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} has the strong cell decomposition property. Then, we consider a local continuity property for definable functions in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} and conclude some results on cell decomposition regarding that property. Finally, we extend the notion of having no dense graph which was examined for definable functions in and related to uniform finiteness, definable completeness, and others. We show that every weakly o-minimal structure M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} having cell decomposition, satisfies NDG, i.e. every definable function in M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal{M}}}$$\end{document} has no dense graph. (shrink)

We extend Meyer's 1972 investigation of sets of minimal indices. Blum showed that minimal index sets are immune, and we show that they are also immune against high levels of the arithmetic hierarchy. We give optimal immunity results for sets of minimal indices with respect to the arithmetic hierarchy, and we illustrate with an intuitive example that immunity is not simply a refinement of arithmetic complexity. Of particular note here are the fact that there are three (...) class='Hi'>minimal index sets located in Π3 − Σ3 with distinct levels of immunity and that certain immunity properties depend on the choice of underlying acceptable numbering. We show that minimal index sets are never hyperimmune; however, they can be immune against the arithmetic sets. Lastly, we investigate Turing degrees for sets of random strings defined with respect to Bagchi's size-function s. (shrink)

The paper is aimed at studying the topological dimension for sets definable in weakly o-minimal structures in order to prepare background for further investigation of groups, group actions and fields definable in the weakly o-minimal context. We prove that the topological dimension of a set definable in a weakly o-minimal structure is invariant under definable injective maps, strengthening an analogous result from [2] for sets and functions definable in models of weakly o-minimal theories. We pay special (...) attention to large subsets of Cartesian products of definable sets, showing that if X, Y and S are non-empty definable sets and S is a large subset of X × Y, then for a large set of tuples $\langle \overline{a}_{1},\ldots,\overline{a}_{2^{k}}\rangle \in X^{2^{k}}$ , where k = dim(Y), the union of fibers $S_{\overline{a}_{1}}\cup \cdots \cup S_{\overline{a}_{2^{k}}}$ is large in Y. Finally, given a weakly o-minimal structure ������, we find various conditions equivalent to the fact that the topological dimension in ������ enjoys the addition property. (shrink)

We investigate under what conditions a given set of collective judgments can arise from a specific voting procedure. In order to answer this question, we introduce a language similar to modal logic for reasoning about judgment aggregation procedures. In this language, the formula expresses that is collectively accepted, or that is a group judgment based on voting. Different judgment aggregation procedures may be underlying the group decision making. Here we investigate majority voting, where holds if a majority of individuals accepts, (...) consensus voting, where holds if all individuals accept, and dictatorship. We provide complete axiomatizations for judgment sets arising from all three aggregation procedures. (shrink)

The field of clinical ethics consultation has matured into a multidisciplinary profession, with clinical ethics consultants (CECs) being trained in bioethics, philosophy, theology, law, medicine, n...

We give an example of two ordered structures $\mathcal {M},\mathcal {N}$ in the same language $\mathcal {L}$ with the same universe, the same order and admitting the same one-variable definable subsets such that $\mathcal {M}$ is a model of the common theory of o-minimal $\mathcal {L}$ -structures and $\mathcal {N}$ admits a definable, closed, bounded, and discrete subset and a definable injective self-mapping of that subset which is not surjective. This answers negatively two question by Schoutens; the first being (...) whether there is an axiomatization of the common theory of o-minimal structures in a given language by conditions on one-variable definable sets alone. The second being whether definable completeness and type completeness imply the pigeonhole principle. It also partially answers a question by Fornasiero asking whether definable completeness of an expansion of a real closed field implies the pigeonhole principle. (shrink)