A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Number 43 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, second edition, 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Basic Dependency-Based Logical Grammar - Kruijff (1998) (1 citation) (Correct)
....the resources and C the category. Essentially R is a syntactic structure in terms of words and their modes of composition, whereas C is the category assigned to that structure. Peculiar to a natural deduction system is that it allows for assumptions (or hypotheses) to be used in an inference [48]. Whenever an R C is assumed, it is enclosed in square brackets: R C] Definition 3.4 (Proof Theoretical Syntax) Common Behavior (1) s A= i B t B (s ffi i t) A = i E [v B] s ffi i v) A s A= i B = i I (2) t B s B n i A (t ffi i s) A n i E [v B] v ffi i s) ....
A.S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Number 43 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge UK, 1996.
A Relevant Analysis of Natural Deduction - Ishtiaq (1999) (28 citations) (Correct)
....x in the term Lx:A :B. The linear aspect is lost by translating linear and intuitionistic variables in exactly the same manner. 48 Chapter 2. The lL calculus and the RLF logical framework We refer also to Troelstra and Schwichtenberg for the technique of strong normalization by translation [TS96]. We will use this technique again when we remark on extending ChurchRosser to h conversion, in Section 2.3.6 later. We note some minor technicalities to do with the translation. The translation of G S U :V is given by t(S) t(G) l jU j:t(V ) The translation of the signature and context is ....
....rule 5.2. The Gentzenized lL calculus 131 G S M:A 0 A 1 G S p i (M) A i is replaced by the following left rule G;x:A i S M:B G;y:A 0 A 1 S (M:B) p i (y) x] We will omit the treatment of in the sequel but refer to Girard, Lafont and Taylor [GLT89] and Troelstra and Schwichtenberg [TS96] for the standard treatment. The combinatorics of the two types of declarations (linear and intuitionistic) and the two types of dependent function spaces (linear and intuitionistic) leads us to consider the following four left rules for the dependent function spaces: G S N:B D;x:D S M:A ( ....
AS Troelstra and H Schwichtenberg. Basic Proof Theory. Number 43 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1996.
A Simpler Proof Theory for Nominal Logic - Cheney (2005) Self-citation (Theory) (Correct)
No context found.
A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Number 43 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, second edition, 2000.
A Formal Calculus for Categories - Caccamo (2003) (Correct)
No context found.
Anne S. Troelstra and Helmut Schwichtenberg. Basic Proof Theory. Number 43 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, second edition, 2000.
A Formal Calculus for Categories - Caccamo (2003) (Correct)
No context found.
Anne S. Troelstra and Helmut Schwichtenberg. Basic Proof Theory. Number 43 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, second edition, 2000.
Kripke Completeness of First-Order Constructive Logics with.. - Ichiro Hasuo And (Correct)
No context found.
Anne S. Troelstra and Helmut Schwichtenberg. Basic Proof Theory. Number 43 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1996.
An Introduction to Classical Propositional Logic: Syntax.. - Gore (Correct)
No context found.
A Troelstra and H Schwichtenberg. Basic Proof Theory. Number 43 in Cambridge Tracts In Theoretical Computer Science. Cambridge University Press, 1996.
Ramification and Linear Logic - White (1999) (Correct)
No context found.
A.S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Number 43 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, 1996.
Actions, Ramification and Linear Modalities - White (1998) (Correct)
No context found.
A.S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Number 43 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, 1996.
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