Could you be thinking of Skolem's Paradox?
It is sometimes explained in terms of "internal sets", the sets that a model can "see". Example:
That's a description of why a theory containing the power set of the integers still has a countable model. The model doesn't actually contain the full powerset, but it also doesn't contain a bijection between its integers and its sets of integers, so "internally" the power set is uncountable even though it's countable "externally".
If that's what you're looking for, then http://math.stackexchange.com is probably a better place than here for follow-up discussion.