期刊文献+

The Theory of Finite Models without Equal Sign

The Theory of Finite Models without Equal Sign
原文传递
导出
摘要 In this paper, it is the first time ever to suggest that we study the model theory of all finite structures and to put the equal sign in the same situtation as the other relations. Using formulas of infinite lengths we obtain new theorems for the preservation of model extensions, submodels, model homomorphisms and inverse homomorphisms. These kinds of theorems were discussed in Chang and Keisler's Model Theory, systematically for general models, but Gurevich obtained some different theorems in this direction for finite models. In our paper the old theorems manage to survive in the finite model theory. There are some differences between into homomorphisms and onto homomorphisms in preservation theorems too. We also study reduced models and minimum models. The characterization sentence of a model is given, which derives a general result for any theory T to be equivalent to a set of existential-universal sentences. Some results about completeness and model completeness are also given. In this paper, it is the first time ever to suggest that we study the model theory of all finite structures and to put the equal sign in the same situtation as the other relations. Using formulas of infinite lengths we obtain new theorems for the preservation of model extensions, submodels, model homomorphisms and inverse homomorphisms. These kinds of theorems were discussed in Chang and Keisler's Model Theory, systematically for general models, but Gurevich obtained some different theorems in this direction for finite models. In our paper the old theorems manage to survive in the finite model theory. There are some differences between into homomorphisms and onto homomorphisms in preservation theorems too. We also study reduced models and minimum models. The characterization sentence of a model is given, which derives a general result for any theory T to be equivalent to a set of existential-universal sentences. Some results about completeness and model completeness are also given.
作者 Li Bo LUO
出处 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2006年第3期865-872,共8页 数学学报(英文版)
基金 supported by the research foundation of Guangdong Women's Professional Technical College
关键词 Finite models Equal sign Preservation theorems Finite models, Equal sign, Preservation theorems
  • 相关文献

参考文献5

  • 1Chang, C. C., Keisler, H. J.: Model Theory, North Holland, Amsterdam, 3rd ed., 1989
  • 2Gurevich, Y.: Toward logic tailored for computational complexity, Computation and proof theory (Ed. M.Richter et al.), Springer Lecture Notes in Math., 1104, 175-216, 1984
  • 3Gurevich, Y.: Logic and the challenge of computer science, Current Trends in Theoretical Computer Science(Ed. E. BSrger), Computer Science Press, Indianapolis, 1988, 1 57
  • 4Gurevich, Y.: On finite model theory, Feasible Mathematics, (Ed. S. R. Buss et al.), A Mathematical Sciences Institute Workshop, Ithaca, New York, 211-219, 1989
  • 5Lyndon, R. C,, An interpolation theorem in the predicate calculus. Pacific J. Math., 9, 155-164 (1959)

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部