A generalization of Ehrenfeucht's game and some applications
From MaRDI portal
Publication:2557698
DOI10.1007/BF02790755zbMath0253.02051MaRDI QIDQ2557698
Publication date: 1972
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
03C99: Model theory
03B25: Decidability of theories and sets of sentences
03C68: Other classical first-order model theory
Related Items
Muller message-passing automata and logics, The expressive power of Malitz quantifiers for linear orderings, The theorems of beth and Craig in abstract model theory II. Compact logics, Stationary Logic and Ordinals, L(Q)-preservation theorems
Cites Work
- An application of games to the completeness problem for formalized theories
- Skolem-type normal forms for first-order languages with a generalized quantifier
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Generalized quantifiers and well orderings
- Unnamed Item
- Unnamed Item
- Unnamed Item