Switch to: References

Add citations

You must login to add citations.
  1. The prospects for mathematical logic in the twenty-first century.Samuel R. Buss, Alexander S. Kechris, Anand Pillay & Richard A. Shore - 2001 - Bulletin of Symbolic Logic 7 (2):169-196.
    The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Model theory of finite and pseudofinite groups.Dugald Macpherson - 2018 - Archive for Mathematical Logic 57 (1-2):159-184.
    This is a survey, intended both for group theorists and model theorists, concerning the structure of pseudofinite groups, that is, infinite models of the first-order theory of finite groups. The focus is on concepts from stability theory and generalisations in the context of pseudofinite groups, and on the information this might provide for finite group theory.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Completeness and categoricity (in power): Formalization without foundationalism.John T. Baldwin - 2014 - Bulletin of Symbolic Logic 20 (1):39-79.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Homogeneous 1‐based structures and interpretability in random structures.Vera Koponen - 2017 - Mathematical Logic Quarterly 63 (1-2):6-18.
    Let V be a finite relational vocabulary in which no symbol has arity greater than 2. Let be countable V‐structure which is homogeneous, simple and 1‐based. The first main result says that if is, in addition, primitive, then it is strongly interpretable in a random structure. The second main result, which generalizes the first, implies (without the assumption on primitivity) that if is “coordinatized” by a set with SU‐rank 1 and there is no definable (without parameters) nontrivial equivalence relation on (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • 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   8 citations  
  • Finite Satisfiability and N₀-Categorical Structures with Trivial Dependence.Marko Djordjević - 2006 - Journal of Symbolic Logic 71 (3):810 - 830.
    Download  
     
    Export citation  
     
    Bookmark   8 citations