S. Thomas, Theories with finitely many models, J. Symbolic Logic, 51:374--376, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Finite Models And Finitely Many Variables - Dawar (1999) (1 citation) (Correct)
....does it have infinitely many 2. If a complete L k theory has sufficiently large finite models, does it have arbitrarily large ones 3. Do any two L k equivalent structures have a common L k elementary extension Simon Thomas provides a negative answer to the first of these questions in [56] where he shows the following: Theorem 15 (Thomas) For each k 3, there are complete theories in L 2k Gamma2 and L 2k Gamma1 having exactly k 1 models. Moreover, since all models of the theories constructed in this proof are of the same cardinality, this also provides a negative answer to ....
S. Thomas, Theories with finitely many models, J. Symbolic Logic, 51:374--376, 1986.
Describing Graphs: a First-Order Approach to Graph Canonization - Immerman, Lander (1990) (61 citations) (Correct)
No context found.
Simon Thomas, "Theories With Finitely Many Models," J. Symbolic Logic, 51, No. 2 (1986), 374-376.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC