Simple structures axiomatized by almost sure theories

@article{Ahlman2016SimpleSA,
  title={Simple structures axiomatized by almost sure theories},
  author={Ove Ahlman},
  journal={Ann. Pure Appl. Logic},
  year={2016},
  volume={167},
  pages={435-456}
}
In this article we give a classification of the binary, simple, ω-categorical structures with SU-rank 1 and trivial algebraic closure. This is done both by showing that they satisfy certain extensi ... 
BETA
1
Twitter Mention

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

Probabilities on Finite Models

  • J. Symb. Log.
  • 1976
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

ASYMPTOTIC ENUMERATION OF Kn-FREE GRAPHS

alcun K. grafo
  • 2004
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

The computational complexity of asymptotic problems I: partial orders

K. J. Compton
  • Inform. and comput
  • 1988
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

The mathematics of random graphs

J. T. Baldwin
  • Annals of Pure and Applied Logic
  • 2006
VIEW 2 EXCERPTS

Similar Papers

Loading similar papers…