Ehrenfeucht games and ordinal addition

DOI10.1016/S0168-0072(97)00005-5zbMath0897.03028MaRDI QIDQ1377635

Françoise Maurin

Publication date: 26 January 1998

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

quantifier eliminationEhrenfeucht gamesordinal addition

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Ordinal and cardinal numbers (03E10) Quantifier elimination, model completeness, and related topics (03C10)

Cites Work

• A uniform method for proving lower bounds on the computational complexity of logical theories
• The computational complexity of logical theories
• The first order properties of products of algebraic systems
• An application of games to the completeness problem for formalized theories
• Weak Second‐Order Arithmetic and Finite Automata
• A Decision Procedure for the First Order Theory of Real Addition with Order
• Definability and decision problems in arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ehrenfeucht games and ordinal addition