Last Updated:2022/12/24

5.7.T ( Unification theorem ) For any two terms or formulas without quantifiers X and Y, the following holds. (i) The unification algorithm UNIF₁, applied to X, Y, terminates after a finite number of steps. (ii) {X, Y} is unifiable iff UNIF₁ so indicates upon ter- mination. Moreover, the substitution σ then available as out- put is a most general unifier of {X, Y}.

音声機能が動作しない場合はこちらをご確認ください
Edit Histories(0)

Sentence quizzes to help you learn to read

Edit Histories(0)

Login / Sign up

 

Download the app!
DiQt

DiQt

Free

★★★★★★★★★★