Publisher
Springer Science and Business Media LLC
Reference5 articles.
1. J. T. Baldwin and A. H. Lachlan,On strongly minimal sets, J. Symbolic Logic36 (1971), 79–95.
2. C. C. Chang,Ultraproducts and other methods of constructing models in Sets, Models, and Recursion Theory, ed. Crossley, North-Holland, Amsterdam, 1967, pp. 85–121.
3. A. Ehrenfeucht,An application of games to the completeness problem for formalized theories, Fund. Math.49 (1961), 129–141.
4. R. L. Vaught,Denumerable models of complete theories, in Infinitistic Methods, Pergamon Press, New York, 1961.
5. L. Marcus,A type-open minimal model, to appear in Archiv. Math. Logik.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Learning algebraic structures from text;Theoretical Computer Science;2001-10
2. On the Very Weak 0–1 Law for Random Graphs with Orders;Journal of Logic and Computation;1996
3. Recursive unary algebras and trees;Annals of Pure and Applied Logic;1994-05
4. $1$-ary functions and the F. C. P.;Illinois Journal of Mathematics;1991-09-01
5. Correctness of programs over poor signatures;Lecture Notes in Computer Science;1991