- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
Switch to: References
Citations of:
Add citations
You must login to add citations.
|
|
|
We construct a nontrivial definable type V field topology on any dp-minimal field K that is not strongly minimal, and prove that definable subsets of Kn have small boundary. Using this topology and... |
|
|
|
|
|
We give an axiomatic framework for the non-modular simple 0-categorical structures constructed by Hrushovski. This allows us to verify some of their properties in a uniform way, and to show that these properties are preserved by iterations of the construction. |
|
|
Ni konstruas nun malbonajn korpojn, kun malfinita Morleya ranko, kiuj estas ricevitaj per memsuficanta amalgameco de korpoj kun unara predikato nomanta sumigan au obligan subgrupon, ciam lau la Hrushovskija maniero. Al uzado de ciuj kiuj la anglujon malkonprenas, tiel tradukigas la supera citajo : "Estas prava ke tiu ci kiu kun la sago interrilatigas, la sagecon rikoltas". Gustatempe, la autoro varmege dankas ciujn kiuj la korektan citajon sendis al li, speciale la unuan respondinton : David KUEKER. |
|
|
An ω-categorical supersimple group is finite-by-abelian-by-finite, and has finite SU-rank. Every definable subgroup is commensurable with an acl( $\emptyset$ )-definable subgroup. Every finitely based regular type in a CM-trivial ω-categorical simple theory is non-orthogonal to a type of SU-rank 1. In particular, a supersimple ω-categorical CM-trivial theory has finite SU-rank. |
|
|
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 (...) |
|
|
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 (...) |
|
|
CM-triviality of a stable theory is a notion introduced by Hrushovski [1]. The importance of this property is first that it holds of Hrushovski's new non 1-based strongly minimal sets, and second that it is still quite a restrictive property, and forbids the existence of definable fields or simple groups (see [2]). In [5], Frank Wagner posed some questions aboutCM-triviality, asking in particular whether a structure of finite rank, which is “coordinatized” byCM-trivial types of rank 1, is itselfCM-trivial. (Actually Wagner (...) |
|
|
|
|
|
Non-$n$-ampleness as defined by Pillay [20] and Evans [5] is preserved under analysability. Generalizing this to a more general notion of $\Sigma$-ampleness, this gives an immediate proof for all simple theories of a weakened version of the Canonical Base Property (CBP) proven by Chatzidakis [4] for types of finite SU-rank. This is then applied to the special case of groups. |
|
|
|
|
|
The notion of CM-triviality was introduced by Hrushovski, who showed that his new strongly minimal sets have this property. Recently Baudisch has shown that his new ω 1 -categorical group has this property. Here we show that any group of finite Morley rank definable in a CM-trivial theory is nilpotent-by-finite, or equivalently no simple group of finite Morley rank can be definable in a CM-trivial theory. |
|
|
In this paper we construct a non-CM-trivial stable theory in which no infinite field is interpretable. In fact our theory will also be trivial and ω-stable, but of infinite Morley rank. A long term aim would be to find a nonCM-trivial theory which has finite Morley rank (or is even strongly minimal) and does not interpret a field. The construction in this paper is direct, and is a “3-dimensional” version of the free pseudoplane. In a sense we are cheating: the (...) |
|
|
|
|
|
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 strongly minimal set is ‘well-behaved’ (...) |
|
|
A study of smooth classes whose generic structures have simple theory is carried out in a spirit similar to Hrushovski 147; Simplicity and the Lascar group, preprint, 1997) and Baldwin–Shi 1). We attach to a smooth class K0, of finite -structures a canonical inductive theory TNat, in an extension-by-definition of the language . Here TNat and the class of existentially closed models of =T+,EX, play an important role in description of the theory of the K0,-generic. We show that if M (...) |
|
|
|
|
|
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. |
|
|
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. |
|
|
Several attempts have been done to distinguish “positive” information in an arbitrary first order theory, i.e., to find a well behaved class of closed sets among the definable sets. In many cases, a definable set is said to be closed if its conjugates are sufficiently distinct from each other. Each such definition yields a class of theories, namely those where all definable sets are constructible, i.e., boolean combinations of closed sets. Here are some examples, ordered by strength:Weak normality describes a (...) |
|
|
We associate with every first order structure [Formula: see text] a family of invariant, locally Noetherian topologies. The structure is almost determined by the topologies, and properties of the structure are reflected by topological properties. We study these topologies in particular for stable structures. In nice cases, we get a behaviour similar to the Zariski topology in algebraically closed fields. |
|
|
Ni konstruas korpojn de Morleja ranko du, kiuj estas ricevitaj per memsuficanta amalgameco de korpoj kun unara predikato, lau la Hrushovkija maniero. |
|
|
We present a topos-theoretic interpretation of (a categorical generalization of) Fraïssé’s construction in Model Theory, with applications to homogeneous models and countably categorical theories. |
|
|
We propose a criterion to regard a property of a theory (in first or second order logic) as virtuous: the property must have significant mathematical consequences for the theory (or its models). We then rehearse results of Ajtai, Marek, Magidor, H. Friedman and Solovay to argue that for second order logic, ‘categoricity’ has little virtue. For first order logic, categoricity is trivial; but ‘categoricity in power’ has enormous structural consequences for any of the theories satisfying it. The stability hierarchy extends (...) |
|
|
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. |
|
|
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excellence, which is a key to the structure theory of uncountable models. The notion of Abstract Elementary Class arose naturally in attempting to prove the categoricity theorem for L ω 1 ,ω (Q). More recently, Zilber has attempted to identify canonical mathematical structures as those whose theory (in an appropriate logic) (...) |
|
|
For every structure M of finite signature Mekler 781) has constructed a group G such that for every κ the maximal number of n -types over an elementary equivalent model of cardinality κ is the same for M and G . These groups are nilpotent of class 2 and of exponent p , where p is a fixed prime greater than 2. We consider stable structures M only and show that M is CM -trivial if and only if G is (...) |
|
|
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 show that equational independence in the sense of Srour equals local non-forking. We then examine so-called almost equational theories where equational independence is a symmetric relation. |
|
|
A set of axioms is presented defining an ‘analytic Zariski structure’, as a generalisation of Hrushovski and Zilber’s Zariski structures. Some consequences of the axioms are explored. A simple example of a structure constructed using Hrushovski’s method of free amalgamation is shown to be a non-trivial example of an analytic Zariski structure. A number of ‘quasi-analytic’ results are derived for this example e.g. analogues of Chow’s theorem and the proper mapping theorem. |
|
|
§1. Introduction. By and large, definitions of a differentiable structure on a set involve two ingredients, topology and algebra. However, in some cases, partial information on one or both of these is sufficient. A very simple example is that of the field ℝ where algebra alone determines the ordering and hence the topology of the field:In the case of the field ℂ, the algebraic structure is insufficient to determine the Euclidean topology; another topology, Zariski, is associated with the ield but (...) |
|
|
We study smooth classes without the algebraic closure property. For such smooth classes we investigate the simplicity of the class of generic structures, in the context of Robinson theories. |
|
|
We construct a stable one-based, trivial theory with a reduct which is not trivial. This answers a question of John B. Goode. Using this, we construct a stable theory which is n-ample for all natural numbers n, and does not interpret an infinite group. |
|
|
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 show that the N₀-categorical structures produced by Hrushovski's predimension construction with a control function fit neatly into Shelah's $SOP_n $ hierarchy: if they are not simple, then they have SOP₃ and NSOP₄. We also show that structures produced without using a control function can be undecidable and have SOP. |
|
|
|
|
|
|
|
|
It is possible to define a combinatorial closure on alternating bilinear maps with few relations similar to that in [2]. For the ℵ 0 - categorical case we show that this closure is part of the algebraic closure. |
|
|
|
|
|
Generalising Hrushovski's fusion technique we construct the free fusion of two strongly minimal theories T₁, T₂ intersecting in a totally categorical sub-theory T₀. We show that if, e.g., T₀ is the theory of infinite vector spaces over a finite field then the fusion theory Tω exists, is complete and ω-stable of rank ω. We give a detailed geometrical analysis of Tω, proving that if both T₁, T₂ are 1-based then, Tω can be collapsed into a strongly minimal theory, if some (...) |
|
|
|
|
|
We define a generalized version of CM-triviality, and show that in the presence of enough regular types, or solubility, a stable CM-trivial group is nilpotent-by-finite. A torsion-free small CM-trivial stable group is abelian and connected. The first result makes use of a generalized version of the analysis of bad groups. |
|
|
§1. Introduction. With Hrushovski's proof of the function field Mordell-Lang conjecture [16] the relevance of geometric stability theory to diophantine geometry first came to light. A gulf between logicians and number theorists allowed for contradictory reactions. It has been asserted that Hrushovski's proof was simply an algebraic argument masked in the language of model theory. Another camp held that this theorem was merely a clever one-off. Still others regarded the argument as magical and asked whether such sorcery could unlock the (...) |
|
|
Continuing work of Baldwin and Shi 1), we study non-ω-saturated generic structures of the ab initio Hrushovski construction with amalgamation over closed sets. We show that they are CM-trivial with weak elimination of imaginaries. Our main tool is a new characterization of non-forking in these theories. |
|
|
We show that if a class K of finite relational structures is closed under quasi-substructures, then there is no saturated K-generic structure that is superstable but not ω -stable. |
|
|
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 employ an infinite-signature Hrushovski amalgamation construction to yield two results in Recursive Model Theory. The first result, that there exists a strongly minimal theory whose only recursively presentable models are the prime and saturated models, adds a new spectrum to the list of known possible spectra. The second result, that there exists a strongly minimal theory in a finite language whose only recursively presentable model is saturated, gives the second non-trivial example of a spectrum produced in a finite language. |
|
|
Summary. From known examples of theories T obtained by Hrushovski-constructions and of infinite Morley rank, properties are extracted, that allow the collapse to a finite rank substructure. The results are used to give a more model-theoretic proof of the existence of the new uncountably categorical groups in [3]. |
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-87c79dc74-2dr8j uwo