Cybernetics

, Volume 7, Issue 1, pp 54–55 | Cite as

On the formulability of predicates on finite models

  • B. A. Romov
Article
Received:
  • 11 Downloads

Keywords

Operating System Artificial Intelligence System Theory Finite Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Literature Cited

  1. 1.
    V. G. Bodnarchuk, L. A. Kalushinin, V. N. Kotov and B. A. Romov, “Galois theory for Post algebras. I, II,” Kibernetika, Nos. 3, 5 (1969).Google Scholar
  2. 2.
    A. A. Mal'tsev, “On free solvable groups,” Dokl. Akad. Nauk SSSR,130, No. 3 (1960).Google Scholar
  3. 3.
    S. Kochen, “Ultraproducts in the theory of models,” Annals of Math.,74, No. 2 (1961).Google Scholar
  4. 4.
    M. Krasner, “Une généralisation de la notion de corps,” Journal de Math. p. et appl.,17 (1938).Google Scholar
  5. 5.
    L. Henkin and A. Tarski, “Cylindric algebras,” Proc. Symposia Pure Math.,2, Providence (1961).Google Scholar

Copyright information

© Consultants Bureau 1973

Authors and Affiliations

  • B. A. Romov

There are no affiliations available

Personalised recommendations