Dag Prawitz. Natural Deduction; A Proof-Theoretical Study. Stockholm Studies in Philosophy 3. Almqvist and Wiksell, 1965.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....developments. If you type Load strengthening, the file strengthening.l (which contains the proof of strengthening for PTS ) will be loaded, preceeded by every module it depends on This distinction is already present in Gentzen [Gen69, pages 71 2, 116 7, 141, 216 7] and Prawitz [Pra65] The dependencies are determined from the module headers, not by examining There are over 70 proof source files with extension .l containing over 1500 definitions and lemmas. This is a large amount of formal knowledge, which we can only survey here. This paper uses informal mathematical ....

Dag Prawitz. Natural Deduction; A Proof-Theoretical Study. Stockholm Studies in Philosophy 3. Almqvist and Wiksell, 1965.

....comprehension schemata later in the paper and use this link to categories to provide models for the formal systems of classes. There is a superficial resemblance between the formal systems presented in this paper and set theories, especially those in Natural Deduction form as in [Fitch 1952] [Prawitz 1965] and [Hallnas 1988] However, what we present differs from these set theories in that, in the systems in this paper, 1) there are no variables ranging over classes, and (2) there is no membership predicate, so that in the expression fx : K j OEg, the proposition OE does not include membership. ....

....the coherence result. Finally, we show how this relates to type classes in programming languages. 2 A formal system of classes We begin by describing a first order system C which incorporates a notion of comprehension. The system is presented as a sequent calculus in a Natural Deduction style [Prawitz 1965]. It consists of terms t which are classified by what we call classes K, and we write t : K. Properties of terms are described by propositional formulae OE which may have free variables for which terms may be substituted. A note about terminology: Type theory and proof theory each come with their ....

[Article contains additional citation context not shown here]

Dag Prawitz, Natural Deduction, A Proof-Theoretical Study, Stockholm Studies in Philosophy 3. Almqvist and Wiksell, 1965.

....two preceding lemmas together, we deduce that is complete for classical provability. Remark. It is worth pointing out that with only fi reduction, normal proofs of nd, or equivalently of C, do not satisfy the subformula property. In the mid1960s (as pointed out to us by P. de Groote) Prawitz [26] considered a version of nd that almost satisfies the property. He introduced proof reduction rules that essentially push double negation onto simpler formulae. Thus in normal proofs of the system, hypotheses discharged by the classical absurdity rule are atomic propositions. The (i) group of ....

D. Prawitz. Natural Deduction. Almqvist and Wiksell, 1965. Stockholm Studies in Philosophy 3.

....for the implication and the universal quantifier, using a definability result in [HJP80, Theorem 1.4] Though cast in category theoretic language, the result in op. cit. is essentially the inter definability result of second order logical connectives which is attributed to Russell, see e.g. Pra65] Definition 3.7 Let f : I J be a map between sets. Recall that Pm (I) def = h Prf(U) I ; I i. We define functors Pm (f) Pm (J) Pm (I) and 8f : Pm (I) Pm (J) as follows: for any A 2 Prf(U) J and B 2 Prf(U) I , Pm (f) is just composition with f i.e. Pm (f) A(i) def = A(f(i) ....

D. Prawitz. Natural Deduction. Almqvist and Wiksell, 1965. Stockholm Studies in Philosophy 3.

.... In fact a correspondence between n and Gentzen s natural deduction for classical logic with four rules, namely, axiom, introduction, elimination, and classical absurdity, can be established (see [30] or [27] for an account) the rule (i fun ) then corresponds to a rule of Prawitz [34] that pushes double negation of an implicational formula into its components. Computationally the dual constructs of abstraction ff: Gamma and naming [fi] Gamma) which witness the elimination and introduction of absurdity respectively) give expression to a kind of generic jump operator. See ....

D. Prawitz. Natural Deduction. Almqvist and Wiksell, 1965. Stockholm Studies in Philosophy 3.

No context found.

D. Prawitz - Natural Deduction: a Proof-Theoretical Study. Stockholm studies in Philosophy, Almqvist & Wiksell, Stockholm, 1965

No context found.

Natural Deduction, A Proof-Theoretical Study, Stockholm Studies in Philosophy 3, Almquist & Wiksell, Stockholm

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