A generalization of Ehrenfeucht's game and some applications

DOI10.1007/BF02790755MaRDI QIDQ2557698zbMATH OpenFDO

Authors Shlomo Vinner

Publication date 1972

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02790755

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Other classical first-order model theory (03C68) Model theory (03C99)

Cites work

• An application of games to the completeness problem for formalized theories
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Generalized quantifiers and well orderings
• scientific article; zbMATH DE number 3266608 (Why is no real title available?)
• scientific article; zbMATH DE number 3304035 (Why is no real title available?)
• scientific article; zbMATH DE number 3310894 (Why is no real title available?)
• Skolem-type normal forms for first-order languages with a generalized quantifier

Cited in

(5)

• 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
• Muller message-passing automata and logics

This page was built for publication: A generalization of Ehrenfeucht's game and some applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2557698)