Switch to: References

Add citations

You must login to add citations.
  1. Dimensional Groups and Fields.Frank O. Wagner - 2020 - Journal of Symbolic Logic 85 (3):918-936.
    We shall define a general notion of dimension, and study groups and rings whose interpretable sets carry such a dimension. In particular, we deduce chain conditions for groups, definability results for fields and domains, and show that a pseudofinite$\widetilde {\mathfrak M}_c$-group of finite positive dimension contains a finite-by-abelian subgroup of positive dimension, and a pseudofinite group of dimension 2 contains a soluble subgroup of dimension 2.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Pseudofinite difference fields.Tingxiang Zou - 2019 - Journal of Mathematical Logic 19 (2):1950011.
    We study a family of ultraproducts of finite fields with the Frobenius automorphism in this paper. Their theories have the strict order property and TP2. But the coarse pseudofinite dimension of the definable sets is definable and integer-valued. Moreover, we establish a partial connection between coarse dimension and transformal transcendence degree in these difference fields.
    Download  
     
    Export citation  
     
    Bookmark  
  • Pseudofinite difference fields and counting dimensions.Tingxiang Zou - 2021 - Journal of Mathematical Logic 21 (1):2050022.
    We study a family of ultraproducts of finite fields with the Frobenius automorphism in this paper. Their theories have the strict order property and TP2. But the coarse pseudofinite dimension of the definable sets is definable and integer-valued. Moreover, we also discuss the possible connection between coarse dimension and transformal transcendence degree in these difference fields.
    Download  
     
    Export citation  
     
    Bookmark  
  • Multidimensional Exact Classes, Smooth Approximation and Bounded 4-Types.Daniel Wolf - 2020 - Journal of Symbolic Logic 85 (4):1305-1341.
    In connection with the work of Anscombe, Macpherson, Steinhorn and the present author in [1] we investigate the notion of a multidimensional exact class (R-mec), a special kind of multidimensional asymptotic class (R-mac) with measuring functions that yield the exact sizes of definable sets, not just approximations. We use results about smooth approximation [24] and Lie coordinatization [13] to prove the following result (Theorem 4.6.4), as conjectured by Macpherson: For any countable language$\mathcal {L}$and any positive integerdthe class$\mathcal {C}(\mathcal {L},d)$of all (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Dividing and weak quasi-dimensions in arbitrary theories.Isaac Goldbring & Henry Towsner - 2015 - Archive for Mathematical Logic 54 (7-8):915-920.
    We show that any countable model of a model complete theory has an elementary extension with a “pseudofinite-like” quasi-dimension that detects dividing.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Pseudofinite structures and simplicity.Darío García, Dugald Macpherson & Charles Steinhorn - 2015 - Journal of Mathematical Logic 15 (1):1550002.
    We explore a notion of pseudofinite dimension, introduced by Hrushovski and Wagner, on an infinite ultraproduct of finite structures. Certain conditions on pseudofinite dimension are identified that guarantee simplicity or supersimplicity of the underlying theory, and that a drop in pseudofinite dimension is equivalent to forking. Under a suitable assumption, a measure-theoretic condition is shown to be equivalent to local stability. Many examples are explored, including vector spaces over finite fields viewed as 2-sorted finite structures, and homocyclic groups. Connections are (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • On $n$ -Dependence.Artem Chernikov, Daniel Palacin & Kota Takeuchi - 2019 - Notre Dame Journal of Formal Logic 60 (2):195-214.
    In this article, we develop and clarify some of the basic combinatorial properties of the new notion of n-dependence recently introduced by Shelah. In the same way as dependence of a theory means its inability to encode a bipartite random graph with a definable edge relation, n-dependence corresponds to the inability to encode a random -partite -hypergraph with a definable edge relation. We characterize n-dependence by counting φ-types over finite sets, and in terms of the collapse of random ordered -hypergraph (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations