How to Win a Game with Features

We employ the model-theoretic method of Ehrenfeucht-Fra sse Games to prove the completeness of the theory CFT, which has been introduced in 22] for describing rational trees in a language of selector functions. The comparison to other techniques used in this eld shows that Ehrenfeucht{Fra sse Games lead to simpler proofs.

• Type: Conference
• Year: 1994
• Where: CCL
• Authors: Rolf Backofen, Ralf Treinen
• Keywords: Automated Reasoning, CCL 1994, Ehrenfeucht-fra Sse Games, Ehrenfeucht{fra Sse Games, Sse Games