Synthetic Domain Theory provides a setting far denotational semantics following Dana Scott's slogan 'domains as sets' in which all functions are continuous. Several approaches can be found in the literature, but they are either model-dependent or if they use an axiomatic setting then not uniformly and not explicitly. We present a completely logical approach to Synthetic Domain Theory (SDT), axiomatizing (complete) Extensional PERs. On these grounds some basic domain theory is developed. Special attention is devoted to admissibility. The axiomatic approach is advantageous since it allows for easy formalization and comparison to other axiomatic settings.