Dana Scott, David Bostock, Graeme Forbes, Daniel Isaacson, and Goren Sundholm. Notes on the formalization of logic. Study Aids Monograph no. 2 and 3, Sub-faculty of Philosophy, Oxford, July 1981.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....example. The definitions of the barred identifiers can be referred to by the identifier prefixed by Bar , in the case above thus as BarPsi . 6. 8 Proofs Proofs in TLP are written in a structural, natural deduction style, essentially as introduced by Gentzen (see e.g. Prawitz [30] and Scott [31]) A proof in TLP consists of a head goal denoted by the keyword Theorem or Lemma with a unique name for later reference, a goal (see below) that is to be proved valid (with respect to the built in axioms and rules of TLP and to already proven facts as well as assumed facts asserted by the ....

Dana Scott, David Bostock, Graeme Forbes, Daniel Isaacson, and Goren Sundholm. Notes on the formalization of logic. Study Aids Monograph no. 2 and 3, Sub-faculty of Philosophy, Oxford, July 1981.

.... then Gamma j= E (Rep) c) If Gamma j= E and Gamma; E j= E 0 then Gamma j= E 0 (Cut) d) If Gamma j= E and E j= E 0 then Gamma j= E 0 (Trans) e) Gamma j= E and Gamma j= E 0 iff Gamma j= E E 0 (Conj) f) Gamma; E j= E 0 iff Gamma j= E E 0 (Imp) Proof Standard, see e.g. [16]. 2 In general, there is not any similar disjunction theorem allowing both introduction and elimination to the right. However, from the entailment theorems and a few tautologies, we get proposition 2. As a consequence of jD being an equivalence relation we also have proposition 3. Proposition 2 ....

D. Scott. Notes on the formalization of logic. Technical report, Sub-faculty of Phil., Oxford, 1981.

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