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.

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)

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.

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)

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 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)

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.

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 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 construct a new class of 1 categorical structures, disproving Zilber's conjecture, and study some of their properties.

Continuous extension cell decomposition in o-minimal structures was introduced by Simon Andrews to establish the open cell property in those structures. Here, we define strong $\mathrm{CE}$-cells in weakly o-minimal structures, and prove that every weakly o-minimal structure with strong cell decomposition has $\mathrm{SCE}$-cell decomposition if and only if its canonical o-minimal extension has $\mathrm{CE}$-cell decomposition. Then, we show that every weakly o-minimal structure with $\mathrm{SCE}$-cell decomposition satisfies $\mathrm{OCP}$. Our last result implies that (...) every o-minimal structure in which every definable open set is a union of finitely many open $\mathrm{CE}$-cells, has $\mathrm{CE}$-cell decomposition. (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)

Let be a weakly o‐minimal structure with the strong cell decomposition property. In this note, we show that the canonical o‐minimal extension of is the unique prime model of the full first order theory of over any set. We also show that if two weakly o‐minimal structures with the strong cell decomposition property are isomorphic then, their canonical o‐minimal extensions are isomorphic too. Finally, we show the uniqueness of the prime models in a complete weakly (...) o‐minimal theory with prime models. (shrink)

We find the complete Euler characteristics for the categories of definable sets and functions in strongly minimal groups. Their images, which represent the Grothendieck semirings of those categories, are all isomorphic to the semiring of polynomials over the integers with nonnegative leading coefficient. As a consequence, injective definable endofunctions in those groups are surjective. For infinite vector spaces over arbitrary division rings, the same results hold, and more: We also establish the Fubini property for all Euler characteristics, and (...) extend the complete one to the eq-expansion of those spaces while preserving the Fubini property but not completeness. Then, surjective interpretable endofunctions in those spaces are injective, and conversely. Our presentation is made in the general setting of multi-sorted structures. (shrink)

Strong cell decomposition property has been proved in non-valuational weakly o-minimal expansions of ordered groups. In this note, we show that all o-minimal traces have strong cell decomposition property. Also after introducing the notion of irrational nonvaluational cut in arbitrary o-minimal structures, we show that every expansion of o-minimal structures by irrational nonvaluational cuts is an o-minimal trace.

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 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.

A weakly o-minimal structure image expanding an ordered group is called nonvaluational iff for every cut left angle bracketC,Dright-pointing angle bracket of definable in image, we have that inf{y−x:xset membership, variantC,yset membership, variantD}=0. The study of nonvaluational weakly o-minimal expansions of real closed fields carried out in [D. Macpherson, D. Marker, C. Steinhorn,Weakly o-minimal structures and real closed fields, Trans. Amer. Math. Soc. 352 5435–5483. MR1781273 (2001i:03079] suggests that this class is very close to the class (...) of o-minimal expansions of real closed fields. Here we further develop this analogy. We establish an o-minimal style cell decomposition for weakly o-minimal non-valuational expansions of ordered groups. For structures enjoying such a strong cell decomposition we construct a canonical o-minimal extension. Finally, we make attempts towards generalizing the o-minimal Euler characteristic to the class of sets definable in weakly o-minimal structures with the strong cell decomposition property. (shrink)

Generalizedn-gons are certain geometric structures (incidence geometries) that generalize the concept of projective planes (the nontrivial generalized 3-gons are exactly the projective planes).In a simplified world, every generalizedn-gon of finite Morley rank would be an algebraic one, i.e., one of the three families described in [9] for example. To our horror, John Baldwin [2], using methods discovered by Hrushovski [7], constructed ℵ1-categorical projective planes which are not algebraic. The projective planes that Baldwin constructed fail to be algebraic in a (...) dramatic way.Indeed, every algebraic projective plane over an algebraically closed field is Desarguesian [12]. In particular, an algebraically closed field (isomorphic to the base field) can be interpreted in every one of them. However, in the projective planes that Baldwin constructed, one cannot even interpret an infinite group.In this article we show that the same phenomenon occurs for the generalizedn-gons ifn≥ 3 is an odd integer. For each suchnwe constructmany nonisomorphic generalizedn-gons of finite Morley rank that do not interpret an infinite group. As one may expect, our method is inspired by Hrushovski and Baldwin, and we follow Baldwin's line of approach. Quite often our proofs are a verification of the fact that the proofs of Baldwin [2] forn= 3 carry over to an arbitrary positive odd integern(which is sometimes far from being obvious). As in [2], we begin by defining a certain collection of finite graphsK* and a binary relation ≤ on these graphs. We show that (K*, ≤) satisfies the amalgamation property. (shrink)

O-minimal structures have long been thought to occupy the base of a hierarchy of ordered structures, in analogy with the role that strongly minimal structures play with respect to stable theories. This is the first in an anticipated series of papers whose aim is the development of model theory for ordered structures of rank greater than one. A class of ordered structures to which a notion of finite rank can be assigned, the (...) decomposable structures, is introduced here. These include all ordered structures definable in o-minimal structures. The principal result in this paper, Theorem 5.1, asserts roughly that a decomposable structure [Formula: see text] can be partitioned into finitely many definable subsets such that on each set the restriction of < is a "twisted lexicographic" order. As a consequence, for all n and linear orders ≺ definable on a subset X ⊆ Mn in an o-minimal structure [Formula: see text], there is a definable partition of X such that the restriction of ≺ to each set in the partition is "lexicographic". (shrink)

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 study the partial orderings of the form ⟨P,⊂⟩\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\langle \mathbb{P}, \subset\rangle}$$\end{document}, where X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}$$\end{document} is a binary relational structure with the connectivity components isomorphic to a strongly connected structure Y\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{Y}}$$\end{document} and P\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{P} }$$\end{document} is the set of substructures of X\documentclass[12pt]{minimal} (...) \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb {X}}$$\end{document} isomorphic to X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}$$\end{document}. We show that, for example, for a countable X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}$$\end{document}, the poset ⟨P,⊂⟩\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\langle \mathbb {P}, \subset\rangle}$$\end{document} is either isomorphic to a finite power of P\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{P} }$$\end{document} or forcing equivalent to a separative atomless σ-closed poset and, consistently, to P/fin. In particular, this holds for each ultrahomogeneous structure X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}$$\end{document} such that X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}}$$\end{document} or Xc\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{X}^{c}}$$\end{document} is a disconnected structure and in this case Y\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{Y}}$$\end{document} can be replaced by an ultrahomogeneous connected digraph. (shrink)

The minimally conscious sta te (MCS) is usually ascribed when a patientwith brain damage exhibits obser vable volitional behaviors that predict recovery ofcognitive funct ions. Nevertheless, a patient with brain damage who lacks motorcapacit y might nonetheless be in MCS. For this reason, some clinicians use neuralsignals as a communicative means for MCS ascription. For instance, a vegetativestate patient is diagnosed with MCS if activity in the motor area is observed whenthe instruction to imagine wiggling toes is given. The validi (...) ty of using neuralsignals in ascribing MCS requires a special sort of inference. That is, no-reportparadigmatic assessments must have inductively strong ways of inferring a pur-ported informationa l content from the observed neural signal that grounds the factthat the patient has top-down cognitive control (or residual volition). Shannon’smathemat ical theory of communication and Bayes’ theorem reveals the formalstructure of neural communication. On the basis of relevant data from the neuro-science literature, I conclude that the formal structure combined with the data showsthat neural signals can be used as a communicative means for operational diagnosticcriteria for MCS ascription. (shrink)

We propose a definition of weak o-minimality for structures expanding a Boolean algebra. We study this notion, in particular we show that there exist weakly o-minimal non o-minimal examples in this setting.

Let M be a countable saturated structure, and assume that D(ν) is a strongly minimal formula (without parameter) such that M is the algebraic closure of D(M). We will prove the two following theorems: Theorem 1. If G is a subgroup of $\operatorname{Aut}(\mathfrak{M})$ of countable index, there exists a finite set A in M such that every A-strong automorphism is in G. Theorem 2. Assume that G is a normal subgroup of $\operatorname{Aut}(\mathfrak{M})$ containing an element g such that (...) for all n there exists $X \subseteq D(\mathfrak{M})$ such that $\operatorname{Dim}(g(X)/X) > n$. Then every strong automorphism is in G. (shrink)

This note concerns the model theoretic properties of logics extending the first-order logic with monadic second-order variables equipped with the stationarity quantifier. The eight variations of the strong downward Löwenheim–Skolem Theorem down to <ℵ2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$<\aleph _2$$\end{document} for this logic with the interpretation of second-order variables as countable subsets of the structures are classified into four principles. The strongest of these four is shown to be equivalent to the conjunction of CH (...) and the Diagonal Reflection Principle for internally clubness of S. Cox. We show that a further strengthening of this SDLS and its variations follow from the Game Reflection Principle of B. König and its generalizations. (shrink)

We consider semi-isolation on the locus of a strongly non-isolated, RK-minimal type in a small theory, and we prove that its asymmetry (as a binary relation) is caused by a specific form of the strict order property: the partial definability of semi-isolation.

Hrushovski originated the study of “flat” stable structures in constructing a new strongly minimal set and a stable 0-categorical pseudoplane. We exhibit a set of axioms which for collections of finite structure with dimension function δ give rise to stable generic models. In addition to the Hrushovski examples, this formalization includes Baldwin's almost strongly minimal non-Desarguesian projective plane and several others. We develop the new case where finite sets may have infinite closures with respect to (...) the dimension function δ. In particular, the generic structure need not be ω-saturated and so the argument for stability is significantly more complicated. We further show that these structures are “flat” and do not interpret a group. (shrink)

The thesis pseudofinite structures and counting dimensions is about the model theory of pseudofinite structures with the focus on groups and fields. The aim is to deepen our understanding of how pseudofinite counting dimensions can interact with the algebraic properties of underlying structures and how we could classify certain classes of structures according to their counting dimensions. Our approach is by studying examples. We treat three classes of structures: The first one is the class of (...) H-structures, which are generic expansions of existing structures. We give an explicit construction of pseudofinite H-structures as ultraproducts of finite structures. The second one is the class of finite difference fields. We study properties of coarse pseudofinite dimension in this class, show that it is definable and integer-valued and build a partial connection between this dimension and transformal transcendence degree. The third example is the class of pseudofinite primitive permutation groups. We generalise Hrushovski’s classical classification theorem for stable permutation groups acting on a strongly minimal set to the case where there exists an abstract notion of dimension, which includes both the classical model theoretic ranks and pseudofinite counting dimensions. In this thesis, we also generalise Schlichting’s theorem for groups to the case of approximate subgroups with a notion of commensurability.prepared by Tingxiang Zou.E-mail: [email protected]: https://tel.archives-ouvertes.fr/tel-02283810/document. (shrink)

For a supersimple SU-rank 1 theory T we introduce the notion of a generic elementary pair of models of T . We show that the theory T* of all generic T-pairs is complete and supersimple. In the strongly minimal case, T* coincides with the theory of infinite dimensional pairs, which was used in 1184–1194) to study the geometric properties of T. In our SU-rank 1 setting, we use T* for the same purpose. In particular, we obtain a characterization (...) of linearity for SU-rank 1 structures by giving several equivalent conditions on T*, find a “weak” version of local modularity which is equivalent to linearity, show that linearity coincides with 1-basedness, and use the generic pairs to “recover” projective geometries over division rings from non-trivial linear SU-rank 1 structures. (shrink)

As the literature on Critical Realism in the social sciences is growing, it is about time to analyse whether a new, acceptable standard for social scientific explanations is being introduced. In order to do so, I will discuss the work of Christopher Lloyd, who analysed contributions of social scientists that rely on (what he called) a structurist ontology and a structurist methodology, and advocated a third option in the methodological debate between individualism and holism. I will suggest modifications to three (...) points of Lloyd's analysis, without abandoning Lloyd's intuitions completely. Firstly, the intuitions of the structurist ontology can be made explicit in a different way, without loosing the individual-society dualism. Secondly, opting for a structurist ontology does not necessarily imply opting for a structurist methodology. Ontology and methodology are related, but not as strongly as Lloyd supposes. Thirdly, the idea of a complete explanation, present in the structurist methodology, confuses causation and explanation while denying the pragmatics of explanation. A broader spectrum of explanatory forms can be defended. Criticizing Lloyd on these three points will lead me to the defence of an explanatory pluralism, which I relate to a minimal ontology. The intention of this reconceptualisation of structurism (and related Critical Realist applications) is to broaden possible perspectives on the explanatory praxis of the social scientist, and to question the reunification of the social sciences. It will also stipulate which form of interdisciplinarity is preferable for the social sciences. (shrink)

We show that every definable subset of an uncountably categorical pseudofinite structure has pseudofinite cardinality which is polynomial (over the rationals) in the size of any strongly minimal subset, with the degree of the polynomial equal to the Morley rank of the subset. From this fact, we show that classes of finite structures whose ultraproducts all satisfy the same uncountably categorical theory are polynomial R-mecs as well as N-dimensional asymptotic classes, where N is the Morley rank of (...) the theory. (shrink)

We show that if M is a strongly minimal large homogeneous structure in a countable similarity type and the pregeometry of M is locally modular but not modular, then the pregeometry is affine over a division ring.

Suppose T is a weakly minimal theory and p a strong 1-type having locally finite but nontrivial geometry. That is, for any M [boxvR] T and finite Fp, there is a finite Gp such that acl∩p = gεGacl∩pM; however, we cannot always choose G = F. Then there are formulas θ and E so that θεp and for any M[boxvR]T, E defines an equivalence relation with finite classes on θ/E definably inherits the structure of either a projective or affine (...) space over some finite field. We then specify what other structure θ/E may inherit: there is some collection of definable subspaces of finite codimension and some set of algebraic points, which in the affine case may be in the canonically associated vector space, Up to acl, no further structure is possible. If we assume T is weakly minimal and has a strong type p as above, and also that T is unidimensional, we obtain a global description of any model of T in terms of those structures mentioned in the previous paragraph. (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)

Let $$ {\mathcal {M}}=(M, <, \ldots ) $$ be a weakly o-minimal structure. Assume that $$ {\mathcal {D}}ef({\mathcal {M}})$$ is the collection of all definable sets of $$ {\mathcal {M}} $$ and for any $$ m\in {\mathbb {N}} $$, $$ {\mathcal {D}}ef_m({\mathcal {M}}) $$ is the collection of all definable subsets of $$ M^m $$ in $$ {\mathcal {M}} $$. We show that the structure $$ {\mathcal {M}} $$ has the strong cell decomposition property if and only if there (...) is an o-minimal structure $$ {\mathcal {N}} $$ such that $$ {\mathcal {D}}ef({\mathcal {M}})=\{Y\cap M^m: \ m\in {\mathbb {N}}, Y\in {\mathcal {D}}ef_m({\mathcal {N}})\} $$. Using this result, we prove that: (a) Every induced structure has the strong cell decomposition property. (b) The structure $$ {\mathcal {M}} $$ has the strong cell decomposition property if and only if the weakly o-minimal structure $$ {\mathcal {M}}^*_M $$ has the strong cell decomposition property. Also we examine some properties of non-valuational weakly o-minimal structures in the context of weakly o-minimal structures admitting the strong cell decomposition property. (shrink)

The degree structure of functions induced by a polynomial-time reducibility first introduced in G. Miller's work on the complexity of prime factorization is investigated. Several basic results are established including the facts that the degrees restricted to the sets do not form an upper semilattice and there is a minimal degree, as well as density for the low degrees, a weak form of the exact pair theorem, the existence of minimal pairs and the decidability of the Π2 theory (...) of the low degrees. (shrink)

An intermediate stage in Hrushovski’s construction of flat strongly minimal structures in a relational language L produces ω-stable structures of rank ω. We analyze the pregeometries given by forking on the regular type of rank ω in these structures. We show that varying L can affect the isomorphism type of the pregeometry, but not its finite subpregeometries. A sequel will compare these to the pregeometries of the strongly minimal structures.

We study a strong enumeration reducibility, called bounded enumeration reducibility and denoted by ≤be, which is a natural extension of s-reducibility ≤s. We show that ≤s, ≤be, and enumeration reducibility do not coincide on the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Pi^0_1}$$\end{document} –sets, and the structure \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\boldsymbol{\mathcal{D}_{\rm be}}}$$\end{document} of the be-degrees is not elementarily equivalent to the structure of the s-degrees. We show also that the first (...) order theory of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\boldsymbol{\mathcal{D}_{\rm be}}}$$\end{document} is computably isomorphic to true second order arithmetic: this answers an open question raised by Cooper (Z Math Logik Grundlag Math 33:537–560, 1987). (shrink)

Let be a model of a theory T. Depending on wether is decidable or recursive, and on whether T is strongly minimal or -minimal, we find conditions on which guarantee that every infinite independent subset of is not recursively enumerable. For each of the same four cases we also find conditions on which guarantee that every infinite independent subset of has Turing degree 0'. More generally, let be a recursive -structure, R a relation symbol not in , (...) ψ a recursive infiniatary Π2 sentence in the language {R}, and let 0<α<ωCK1. We discuss conditions under which we can construct a recursive -structure such that ,Rψ for every Δ0α relation R on. (shrink)

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 clarify and correct some statements and results in the literature concerning unimodularity in the sense of Hrushovski [7], and measurability in the sense of Macpherson and Steinhorn [8], pointing out in particular that the two notions coincide for strongly minimal structures and that another property from [7] is strictly weaker, as well as "completing" Elwes' proof [5] that measurability implies 1-basedness for stable theories.

The projective plane of Baldwin 695) is model complete in a language with additional constant symbols. The infinite rank bicolored field of Poizat 1339) is not model complete. The finite rank bicolored fields of Baldwin and Holland 371; Notre Dame J. Formal Logic , to appear) are model complete. More generally, the finite rank expansions of a strongly minimal set obtained by adding a ‘random’ unary predicate are almost strongly minimal and model complete provided the (...) class='Hi'>strongly minimal set is ‘well-behaved’ and admits ‘exactly rank k formulas’. The last notion is a geometric condition on strongly minimal sets formalized in this paper. (shrink)

Theorem: For every k, there is an expansion of the theory of algebraically closed fields (of any fixed characteristic) which is almost strongly minimal with Morley rank k.

An exponential $\exp $ on an ordered field $$. The structure $$ is then called an ordered exponential field. A linearly ordered structure $$ is called o-minimal if every parametrically definable subset of M is a finite union of points and open intervals of M.The main subject of this thesis is the algebraic and model theoretic examination of o-minimal exponential fields $$ whose exponential satisfies the differential equation $\exp ' = \exp $ with initial condition $\exp = 1$. (...) This study is mainly motivated by the Transfer Conjecture, which states as follows:Any o-minimal exponential field $$ whose exponential satisfies the differential equation $\exp ' = \exp $ with initial condition $\exp =1$ is elementarily equivalent to $\mathbb {R}_{\exp }$.Here, $\mathbb {R}_{\exp }$ denotes the real exponential field $$, where $\exp $ denotes the standard exponential $x \mapsto \mathrm {e}^x$ on $\mathbb {R}$. Moreover, elementary equivalence means that any first-order sentence in the language $\mathcal {L}_{\exp } = \{+,-,\cdot,0,1, <,\exp \}$ holds for $$ if and only if it holds for $\mathbb {R}_{\exp }$.The Transfer Conjecture, and thus the study of o-minimal exponential fields, is of particular interest in the light of the decidability of $\mathbb {R}_{\exp }$. To the date, it is not known if $\mathbb {R}_{\exp }$ is decidable, i.e., whether there exists a procedure determining for a given first-order $\mathcal {L}_{\exp }$ -sentence whether it is true or false in $\mathbb {R}_{\exp }$. However, under the assumption of Schanuel’s Conjecture—a famous open conjecture from Transcendental Number Theory—a decision procedure for $\mathbb {R}_{\exp }$ exists. Also a positive answer to the Transfer Conjecture would result in the decidability of $\mathbb {R}_{\exp }$. Thus, we study o-minimal exponential fields with regard to the Transfer Conjecture, Schanuel’s Conjecture, and the decidability question of $\mathbb {R}_{\exp }$.Overall, we shed light on the valuation theoretic invariants of o-minimal exponential fields—the residue field and the value group—with additional induced structure. Moreover, we explore elementary substructures and extensions of o-minimal exponential fields to the maximal ends—the smallest elementary substructures being prime models and the maximal elementary extensions being contained in the surreal numbers. Further, we draw connections to models of Peano Arithmetic, integer parts, density in real closure, definable Henselian valuations, and strongly NIP ordered fields.Parts of this thesis were published in [2–5].Abstract prepared by Lothar Sebastian KrappE-mail: [email protected]: https://d-nb.info/1202012558/34. (shrink)

We provide a general framework for studying the expansion of strongly minimal sets by adding additional relations in the style of Hrushovski. We introduce a notion of separation of quantifiers which is a condition on the class of expansions of finitely generated models for the expanded theory to have a countable ω-saturated model. We apply these results to construct for each sufficiently fast growing finite-to-one function μ from 'primitive extensions' to the natural numbers a theory T μ of (...) an expansion of an algebraically closed field which has Morley rank 2. Finally, we show that if μ is not finite-to-one the theory may not be ω-stable. (shrink)

We show the following results on Wainer's notation for a minimal subrecursive inaccessible ordinal τ: First, we give a constructive proof of the collapsing theorem. Secondly, we prove that the slow-growing hierarchy and the fast-growing hierarchy up to τ have elementary properties on increase and domination, which completes Wainer's proof that τ is a minimal subrecursive inaccessible. Our results are obtained by showing a strong normalization theorem for the term structure of the notation. MSC: 03D20, 03F15.

Anthropocentrism has been proposed as the underlying cause of modern society's environmental impact. Concomitantly, hunter-gatherers’ orientation towards nature is connected with minimal environmental change or conservation, and seen as validating the idea that ‘what people do about their ecology depends upon what they think about themselves in relation to things around them’ (White 1967: 1205). Here it is argued that the notion that orientation towards nature is instrumental in environmental impact in any generalisable way has little empirical support and, (...) most importantly, is under-theorised and conceptually flawed. Employing a strong structurationist approach, it is shown that the tendency to abstract particular values from their social and environmental context must be resisted and that a deeper conception of the ‘inner lives’ of agents is required. Such an approach is more expansive and engages with a range of other motives as well as the unintended environmental consequences of actions. (shrink)