Titlebook: Structures in Logic and Computer Science; A Selection of Essay Jan Mycielski,Grzegorz Rozenberg,Arto Salomaa Book 1997 Springer-Verlag Berl

mentor

书目名称Structures in Logic and Computer Science影响因子(影响力)




书目名称Structures in Logic and Computer Science影响因子(影响力)学科排名




书目名称Structures in Logic and Computer Science网络公开度




书目名称Structures in Logic and Computer Science网络公开度学科排名




书目名称Structures in Logic and Computer Science被引频次




书目名称Structures in Logic and Computer Science被引频次学科排名




书目名称Structures in Logic and Computer Science年度引用




书目名称Structures in Logic and Computer Science年度引用学科排名




书目名称Structures in Logic and Computer Science读者反馈




书目名称Structures in Logic and Computer Science读者反馈学科排名

noxious

Christophe Prieur,Christian Choffrut,Michel Latteux

Host142

On the work of Andrzej Ehrenfeucht in model theory,This is a paper about a certain period of the develpoment of model theory upon which the work of A. Ehrenfeucht made an indelible mark. We will pay a special attention to his results about the theories of (Ord,<), (Ord,<,+), and (Ord,<,+,·). Also some of the history of the applications of Ramsey‘s theorem in model theory will be discussed.

Ostrich

采纳

entail

贪婪的人

异常

朴素

Monadic second order logic and node relations on graphs and trees,y, such a relation can be computed by a finite-state tree-walking automaton, provided the automaton can test MSO properties of the nodes of the tree. For graphs, if a binary relation on the nodes of a graph can be computed by a finite-state graph-walking automaton, then it can be specified by an MSO formula, but, in general, not vice versa.

玩笑