English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Let      T T       be a countable complete theory having Skolem functions. We prove that if all the types over finitely generated models are definable (this is the case for example if      T T       is stable), then either      T T       has      2 ℵ  0 {2^{{\aleph _0}}}       countable models or all its models are homogeneous. The proof makes heavy use of stability techniques.

Les modèles dénombrables d’une théorie ayant des fonctions de Skolem