This is a preview. Log in through your library . Abstract An example of finite tree $M_{o}$ is presented such that its predicate logic (i.e. the intermediate ...
We first extend Quine's method of eliminating the bound variables to first-order predicate logic with operation symbols ; then we give a device for eliminating also the free variables ; and finally we ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback