سوال ۹۳ کنکور ارشد علوم کامپیوتر ۱۴۰۳
در زبان شامل یک رابطه دوتایی، فرض کنیم نظریه ترتیبهای خطی چگال بدون نقاط انتهایی باشد. از دو مورد زیر، کدامیک درست است؟
I ـ اگر و ساختارهای شمارا برای باشند، دراینصورت و یکریخت هستند.
II ـ کامل است، یعنی برای هر جمله یا یا .
پاسخ صحیح: گزینهٔ C — هر دو
Here axiomatizes a dense linear order without endpoints: is a total order that is dense () and has no least or greatest element. The canonical model is .
Statement I — countable models are isomorphic
This is Cantor's theorem: any two countable dense linear orders without endpoints are isomorphic. The proof is the back-and-forth method — enumerate the two countable domains and build a partial order-isomorphism finite step by step, at each stage extending it to include the next element of one side (using density to find a matching element on the other side, and no-endpoints to handle extremes). The union is a bijection preserving order.
Equivalently, is -categorical (countably categorical): up to isomorphism it has exactly one countable model, namely . So statement I is TRUE.
Statement II — the theory is complete
Apply the Łoś–Vaught test: if a theory
- is consistent,
- has no finite models, and
- is -categorical for some infinite cardinal ,
then is complete.
satisfies all three: it is consistent ( is a model); density forces every model to be infinite, so there are no finite models; and by Part I it is -categorical. Therefore is complete — for every sentence exactly one of or holds. So statement II is TRUE.
(Completeness also follows because all models of a complete-via-categoricity theory are elementarily equivalent: a sentence true in is provable, one false in has its negation provable.)
Conclusion
Both I and II hold, so the answer is Both — option (3).
Exam trick: -categorical + no finite models + consistent complete (Łoś–Vaught). DLO is the textbook poster child: Cantor's back-and-forth gives categoricity, and categoricity hands you completeness for free.