We prove that there exists a nonzero recursively enumerable Turing degree possessing a strong minimal cover.

We prove that there exists a nonzero recursively enumerable Turing degree possessing a strong minimal cover.

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.

In order to reason in a non-trivializing way with contradictions, para- consistent logics reject some classically valid inferences. As a way of re- covering some of these inferences, Graham Priest ([Priest, 1991]) proposed to nonmonotonically strengthen the Logic of Paradox by allowing the se- lection of “less inconsistent” models via a comparison of their respective inconsistent parts. This move recaptures a good portion of classical logic in that it does not block, e.g., disjunctive syllogism, unless it is applied to contradictory (...) assumptions. In Priest’s approach the inconsistent parts of models are compared in an extensional way by considering their inconsis- tent objects. This distinguishes his system from the standard format of (inconsistency-)adaptive logics pioneered by Diderik Batens, according to which (atomic) contradictions validated in models form the basis of their comparison. A well-known problem for Priest’s extensional approach is its lack of the Strong Reassurance property, i.e., for specific settings there may be infinitely descending chains of less and less inconsistent models, thus never reaching a minimally inconsistent model. In this paper, we demonstrate that Strong Reassurance holds for the extensional approach under a cardinality-based comparison of the incon- sistent parts of models. Furthermore, we introduce and investigate the metatheory of the class of first-order nonmonotonic inconsistency-tolerant construct over the extensional or quantitative comparisons of their respec- tive models. Core model-theoretic properties for these logics, such as the Löwenheim-Skolem theorems, along with other nonmonotonic properties, are further studied. (shrink)

Combinatorial operations on sets are almost never well defined on Turing degrees, a fact so obvious that counterexamples are worth exhibiting. The case we focus on is the symmetric-difference operator; there are pairs of degrees for which the symmetric-difference operation is well defined. Some examples can be extracted from the literature, e.g. from the existence of nonzero degrees with strong minimal covers. We focus on the case of incomparable r.e. degrees for which the symmetric-difference operation is well defined.

We examine how degrees of computably enumerable equivalence relations under computable reduction break down into isomorphism classes. Two ceers are isomorphic if there is a computable permutation of ω which reduces one to the other. As a method of focusing on nontrivial differences in isomorphism classes, we give special attention to weakly precomplete ceers. For any degree, we consider the number of isomorphism types contained in the degree and the number of isomorphism types of weakly precomplete ceers contained in the (...) degree. We show that the number of isomorphism types must be 1 or ω, and it is 1 if and only if the ceer is self-full and has no computable classes. On the other hand, we show that the number of isomorphism types of weakly precomplete ceers contained in the degree can be any member of $[0,\omega ]$. In fact, for any $n \in [0,\omega ]$, there is a degree d and weakly precomplete ceers ${E_1}, \ldots,{E_n}$ in d so that any ceer R in d is isomorphic to ${E_i} \oplus D$ for some $i \le n$ and D a ceer with domain either finite or ω comprised of finitely many computable classes. Thus, up to a trivial equivalence, the degree d splits into exactly n classes.We conclude by answering some lingering open questions from the literature: Gao and Gerdes [11] define the collection of essentially FC ceers to be those which are reducible to a ceer all of whose classes are finite. They show that the index set of essentially FC ceers is ${\rm{\Pi }}_3^0$-hard, though the definition is ${\rm{\Sigma }}_4^0$. We close the gap by showing that the index set is ${\rm{\Sigma }}_4^0$-complete. They also use index sets to show that there is a ceer all of whose classes are computable, but which is not essentially FC, and they ask for an explicit construction, which we provide.Andrews and Sorbi [4] examined strong minimal covers of downwards-closed sets of degrees of ceers. We show that if $\left$ is a uniform c.e. sequence of non universal ceers, then $\left\{ {{ \oplus _{i \le j}}{E_i}|j \in \omega } \right\}$ has infinitely many incomparable strong minimal covers, which we use to answer some open questions from [4].Lastly, we show that there exists an infinite antichain of weakly precomplete ceers. (shrink)

We examine the degree structure $\operatorname {\mathrm {\mathbf {ER}}}$ of equivalence relations on $\omega $ under computable reducibility. We examine when pairs of degrees have a least upper bound. In particular, we show that sufficiently incomparable pairs of degrees do not have a least upper bound but that some incomparable degrees do, and we characterize the degrees which have a least upper bound with every finite equivalence relation. We show that the natural classes of finite, light, and dark degrees are (...) definable in $\operatorname {\mathrm {\mathbf {ER}}}$. We show that every equivalence relation has continuum many self-full strong minimal covers, and that $\mathbf {d}\oplus \mathbf {\operatorname {\mathrm {\mathbf {Id}}}_1}$ needn’t be a strong minimal cover of a self-full degree $\mathbf {d}$. Finally, we show that the theory of the degree structure $\operatorname {\mathrm {\mathbf {ER}}}$ as well as the theories of the substructures of light degrees and of dark degrees are each computably isomorphic with second-order arithmetic. (shrink)

In this paper we prove that a degree a is array nonrecursive (ANR) if and only if every degree b ≥ a is r.e. in and strictly above another degree (RRE). This result will answer some questions in [ASDWY]. We also deduce an interesting corollary that every n-REA degree has a strong minimal cover if and only if it is array recursive.

Cooper proved in [S.B. Cooper, Strong minimal covers for recursively enumerable degrees, Math. Logic Quart. 42 191–196] the existence of a c.e. degree with a strong minimal cover . So is the greastest c.e. degree below . Cooper and Yi pointed out in [S.B. Cooper, X. Yi, Isolated d.r.e. degrees, University of Leeds, Dept. of Pure Math., 1995. Preprint] that this strongly minimal cover cannot be d.c.e., and meanwhile, they proposed the notion of (...) isolated degrees: a d.c.e. degree is isolated by a c.e. degree if is the greatest c.e. degree below , and we also say that isolates . In [G. Wu, Bi-isolation in the d.c.e. degrees, J. Symbolic Logic 69 409–420], Wu extended Cooper–Yi’s notion and proved that there are intervals of d.c.e. degrees containing exactly one c.e. degree . Following Cooper and Yi’s notion, is called a bi-isolating degree. The bi-isolating degrees are dense in the high c.e. degrees. Arslanov asked whether the bi-isolating degrees occur in every jump class. In this paper, we prove that there are low bi-isolating degrees, providing a partial solution to Arslanov’s question. (shrink)

It is known that every non-universal self-full degree in the structure of the degrees of computably enumerable equivalence relations (ceers) under computable reducibility has exactly one strong minimal cover. This leaves little room for embedding wide partial orders as initial segments using self-full degrees. We show that considerably more can be done by staying entirely inside the collection of non-self-full degrees. We show that the poset can be embedded as an initial segment of the degrees of ceers (...) with infinitely many classes. A further refinement of the proof shows that one can also embed the free distributive lattice generated by the lower semilattice as an initial segment of the degrees of ceers with infinitely many classes. (shrink)

Let T be a strongly minimal theory with quantifier elimination. We show that the class of existentially closed models of T{“σ is an automorphism”} is an elementary class if and only if T has the definable multiplicity property, as long as T is a finite cover of a strongly minimal theory which does have the definable multiplicity property. We obtain cleaner results working with several automorphisms, and prove: the class of existentially closed models of T{“σi is an (...) automorphism”: i=1,2} is an elementary class if and only if T has the definable multiplicity property. (shrink)

Hybrid logics are extensions of standard modal logics, which significantly increase the expressive power of the latter. Since most of hybrid logics are known to be decidable, decision procedures for them is a widely investigated field of research. So far, several tableau calculi for hybrid logics have been presented in the literature. In this paper we introduce a sound, complete and terminating tableau calculus T H(@,E,D, ♦ −) for hybrid logics with the satisfaction operators, the universal modality, the difference modality (...) and the inverse modality as well as the corresponding sequent calculus S H(@,E,D, ♦ −) . They not only uniformly cover relatively wide range of various hybrid logics but they are also conceptually simple and enable effective search for a minimal model for a satisfiable formula. The main novelty is the exploitation of the unrestricted blocking mechanism introduced as an explicit, sound tableau rule. (shrink)

A set A is symmetric enumeration (se-) reducible to a set B (A ≤\sb se B) if A is enumeration reducible to B and \barA is enumeration reducible to \barB. This reducibility gives rise to a degree structure (D\sb se) whose least element is the class of computable sets. We give a classification of ≤\sb se in terms of other standard reducibilities and we show that the natural embedding of the Turing degrees (D\sb T) into the enumeration degrees (D\sb e) (...) translates to an embedding (ι\sb se) into D\sb se that preserves least element, suprema, and infima. We define a weak and a strong jump and we observe that ι\sb se preserves the jump operator relative to the latter definition. We prove various (global) results concerning branching, exact pairs, minimal covers, and diamond embeddings in D\sb se. We show that certain classes of se-degrees are first-order definable, in particular, the classes of semirecursive, Σ\sb n ⋃ Π\sb n, Δ\sb n (for any n \in ω), and embedded Turing degrees. This last result allows us to conclude that the theory of D\sb se has the same 1-degree as the theory of Second-Order Arithmetic. (shrink)

We prove that if a strongly minimal nonlocally modular reduct of an algebraically closed valued field of characteristic 0 contains +, then this reduct is bi-interpretable with the underlying field.

A linear space is a system of points and lines such that any two distinct points determine a unique line; a Steiner k-system is a linear space such that each line has size exactly k. Clearly, as a two-sorted structure, no linear space can be strongly minimal. We formulate linear spaces in a vocabulary $\tau $ with a single ternary relation R. We prove that for every integer k there exist $2^{\aleph _0}$ -many integer valued functions $\mu $ such (...) that each $\mu $ determines a distinct strongly minimal Steiner k-system $\mathcal {G}_\mu $, whose algebraic closure geometry has all the properties of the ab initio Hrushovski construction. Thus each is a counterexample to the Zilber Trichotomy Conjecture. (shrink)

We study automorphism groups of trivial strongly minimal structures. First we give a characterization of structures of bounded valency through their groups of automorphisms. Then we characterize the triplets of groups which can be realized as the automorphism group of a non algebraic component, the subgroup stabilizer of a point and the subgroup of strong automorphisms in a trivial strongly minimal structure, and also we give a reconstruction result. Finally, using HNN extensions we show that any profinite (...) group can be realized as the stabilizer of a point in a strongly minimal structure of bounded valency. (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)

We study the expansion of stable structures by adding predicates for arbitrary subsets. Generalizing work of Poizat-Bouscaren on the one hand and Baldwin-Benedikt-Casanovas-Ziegler on the other we provide a sufficient condition (Theorem 4.7) for such an expansion to be stable. This generalization weakens the original definitions in two ways: dealing with arbitrary subsets rather than just submodels and removing the 'small' or 'belles paires' hypothesis. We use this generalization to characterize in terms of pairs, the 'triviality' of the geometry on (...) a strongly minimal set (Theorem 2.5). Call a set A benign if any type over A in the expanded language is determined by its restriction to the base language. We characterize the notion of benign as a kind of local homogenity (Theorem 1.7). Answering a question of [8] we characterize the property that M has the finite cover property over A (Theorem 3.9). (shrink)

We provide a simple and transparent construction of Hrushovski's strongly minimal fusions in the case where the fused strongly minimal sets are vector spaces. We strengthen Hrushovski's result by showing that the strongly minimal fusions are model complete.

We characterise strongly minimal groups interpretable in elementary extensions of compact complex analytic spaces.

In set theory without the axiom of choice, we investigate the deductive strength of the principle “every topological space with the minimal cover property is compact”, and its relationship with certain notions of finite as well as with properties of linearly ordered sets and partially ordered sets.

We describe strongly minimal theories Tn with finite languages such that in the chain of countable models of Tn, only the first n models have recursive presentations. Also, we describe a strongly minimal theory with a finite language such that every non-saturated model has a recursive presentation.

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

How should the definition of “minimal risk” in the federal research regulations be interpreted in regard to pregnant women and fetuses? Surprisingly, there has been little discussion of this question. There is, after all, a substantial amount of published work addressing the question of how “minimal risk” should be interpreted. Similarly, there is a large body of literature on the ethics of research involving pregnant women and fetuses, particularly maternal-fetal surgery. However, in neither of these bodies of work (...) can one find an analysis of minimal risk in regard to fetuses or pregnant women.The concept of minimal risk is defined in the regulations as follows:Minimal risk means that the probability and magnitude of harm or discomfort anticipated in the research are not greater in and of themselves than those ordinarily encountered in daily life or during the performance of routine physical or psychological examinations or tests. (shrink)

We show that if G is a strongly minimal finitely axiomatizable group, the division ring of quasi-endomorphisms of G must be an infinite finitely presented ring.

We give several characterizations of weakly minimal abelian structures. In two special cases, dual in a sense to be made explicit below, we give precise structure theorems: 1. When the only finite 0-definable subgroup is {0}, or equivalently 0 is the only algebraic element (the co-strongly minimal case); 2. When the theory of the structure is strongly minimal. In the first case, we identify the abelian structure as a "near-subspace" A of a vector space V over a (...) division ring D with its induced structure, with possibly some collection of distinguished subgroups of A of finite index in A and (up to $acl(\emptyset)$ ) no further structure. In the second, the structure is that of V/A for a vector space and near-subspace as above, with the only further possible structure some collection of distinguished points. Here a near-subspace of V is a subgroup A such that for any nonzero d ∈ D, the index of $A\cap dA$ in A is finite. We also show that any weakly minimal abelian structure is a reduct of a weakly minimal module. (shrink)

Here we prove that if T and T′ are strongly minimal theories, where T′ satisfies a certain property related to triviality and T does not, and T′ is model complete, then there is no computable embedding of Mod(T) into Mod(T′). Using this, we answer a question from [4], showing that there is no computable embedding of VS into ZS, where VS is the class of infinite vector spaces over Q, and ZS is the class of models of Th(Z, S). (...) Similarly, we show that there is no computable embedding of ACF into ZS, where ACF is the class of algebraically closed fields of characteristic 0. (shrink)

An infinite structure is said to be minimal if each of its definable subset is finite or cofinite. Modifying Hrushovski's method we construct minimal, non strongly minimal structures with arbitrary finite dimensions. This answers negatively to a problem posed by B. I Zilber.

A large homogeneous model M is strongly minimal, if any definable subset is either bounded or has bounded complement. In this case is a pregeometry, where bcl denotes the bounded closure operation. In this paper, we show that if M is a large homogeneous strongly minimal structure and is non-trivial and locally modular, then M interprets a group. In addition, we give a description of such groups.

Many areas of genetic research, genetic forensics and genetic essentialism are treated in public sphere debate as suspicious and problematic or are subject to waves of moral panic. In cultural theory, likewise, strong critiques of the genetic essentialism emerge as part of a broader critical assessment of the discourses of the biological sciences and the assertion of a connection between genes and human behavior. However, the scientific and popular claim to the existence of a “gay gene” is not treated (...) in the same way, and has been widely celebrated both within lesbian/gay culture and more broadly in liberal-humanist speech. This essay suggests that it is not enough to presume that this is a result of the extension of essentialism into new popular understandings of human biology. Rather, this essay examines five reasons which have made the popular acceptance of a “gay gene” tenable: the dominance of “gay personage” arguments, the continued influence of early sexology, the suspicion of psychological and constructionist approaches to lesbian/gay sexualities, the effectiveness of genetic essentialism in“ethnic rights” political approaches and the continued centrality of “fixed subjecthood” in contemporary western culture. (shrink)

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.

Reviewed Works:B. I. Zil'ber, L. Pacholski, J. Wierzejewski, A. J. Wilkie, Totally Categorical Theories: Structural Properties and the Non-Finite Axiomatizability.B. I. Zil'ber, Strongly Minimal Countably Categorical Theories.B. I. Zil'ber, Strongly Minimal Countably Categorical Theories. II.B. I. Zil'ber, Strongly Minimal Countably Categorical Theories. III.B. I. Zil'ber, E. Mendelson, Totally Categorical Structures and Combinatorial Geometries.B. I. Zil'ber, The Structure of Models of Uncountably Categorical Theories.

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.

We show that there is a strong minimal pair in the computably enumerable Turing degrees, i.e. a pair of nonzero c.e. degrees a and b such that a∩b = 0 and for any nonzero c.e. degree x ≤ a, b ∪ x ≥ a.

We build a new spectrum of recursive models (SRM(T)) of a strongly minimal theory. This theory is non-disintegrated, flat, model complete, and in a language with a finite structure.

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)

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)