A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
How to win a game with features
[chapter]
Constraints in Computational Logics
Preserved Fulltext
We employ the model-theoretic method of Ehrenfeucht-Fra ss e 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 ss e Games lead to simpler proofs.
doi:10.1007/bfb0016863
dblp:conf/ccl/BackofenT94
fatcat:asgip7kbireeji4zlubrz2crni