Gries, D. and Schneider, F. B. Formalizations of substitution of equals for equals, Pre-print, Sept. 1998 (personal communication). Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
A Basic Formal Equational Predicate Logic - Tourlakis (1998) (Correct)
....be that all primary rules of inference are propositional . This will entail a very simple version of the Deduction Theorem that is applicable without constraints. We have the choice of taking all tautologies as schemata in Ax1 below, or restricting the set to just those axiom schemata given in [GS3]. We will succumb to the temptation of taking the big leap and adopting all tautologies as axioms. Technically, this is fine, since the set of all tautologies is recognizable (recursive) # and all tautologies will have to be deducible at any rate, no matter how we start up the logic. ....
Gries, D. and Schneider, F. B. Formalizations of substitution of equals for equals, Pre-print, Sept. 1998 (personal communication).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC