A.S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge U.P., 1996.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Sequent of Relations Calculi: A Framework for Analytic.. - Baaz, Ciabattoni.. (2003) (Correct)
....of T (separated by ) # is a substitution of variables by formulas and a side sequent. Remark 9. Because of the presence of weakening and contraction, there is no loss of generality in considering only identical side sequents in the premisses. Indeed this additive version of rules (see [28]) is more suitable in the context of tableau style proof search. An extended structural rule is admissible in RLT if . # where x is the vector of all variables occurring in # 1 , # n ,# and # is the disjunction of the atomic formulas # consists of. True for empty #. ....
Troelstra, A.S. and Schwichtenberg, H.: Basic Proof Theory. Cambridge University Press (1996)
The Axiom Of Choice And Combinatory Logic - Cantini (Correct)
....(x = #x)T (ux) x = #x)T (ux) Technically speaking, it is clear that (x, P ) is a positive operator form in the applicative language expanded with P (P being a unary fresh predicate) Definition 6. SeqCLT i consists of (i) the logical rules of the intuitionistic calculus G3i of [17]; ii) initial sequents corresponding to the identity axioms and the basic equations of combinatory logic: #, A A, where A : t = s) T t ; Id1) #, K = S A ; #) t = t ; Id2) #, t = s, T t Ts ; Id3) tr = sr ; R Ap) rt = rs ; L Ap) s = t ; Sym) #, t = s, s = r t = r ; ....
A.S. Troelstra and H. Schwichtenberg, Basic Proof Theory, Cambridge University Press, 1997.
A Spatial Logic for Concurrency (Part II) - Caires, Cardelli (2003) (Correct)
....removing the contraction rules (CL) and (CR) and replacing the rules (8L) jR) L) IL) IR) rR) and ( R) by the rules shown in Figure 17. 21 The specific CF rules are identical to the corresponding ones in system S, except in that they absorb a contraction step (cf. the system G3c in [23]) The replaced rules are precisely the non invertible ones. Note that in sequent calculus presentations of classical logic (e.g. Gentzen s LK) 8L) is not invertible, and in classical linear logic ( R) is not invertible (cf. jR) and ( L) is not invertible (cf. Note that any ....
A. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, 2000.
Deciding Regular Grammar Logics With Converse Through.. - Demri, de Nivelle (2003) (3 citations) (Correct)
.... 5 Translating IPL into GF We de ne a new translation from intuitionistic propositional logic IPL with connectives ; and (see e.g. details in [CZ97] into GF : The method is obtained by composing G odel s translation into S4 with our translation from S4 into the guarded fragment (See [TS96]) This provides another (logspace) embedding of IPL into a decidable fragment of classic logic (see e.g. KK97] Our translation could be used as a method for theorem proving in intuitionistic logic, but we admit that it is not likely that our translation results in an ecient procedure. For ....
....logic does not admit an equivalent negation normal form. For example : is not equivalent to ) We explicitly add the polarity to the translation function. A similar technique was used in for example [DG00] Before de ning the map, we repeat the translation from IPL into S4, as given in [TS96]. De nition 10. Function t S4 is de ned as follows by recursion on the subformulas of : t S4 ( equals ; for a propositional symbol p; t S4 (p) equals 2p; equals t S4 ( t S4 ( equals t S4 ( t S4 ( equals 2( t S4 ( t S4 ( Translation t S4 takes ....
A.S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, 1996.
Fibring Labelled Deduction Systems - Rasga, Sernadas, Sernadas (2002) (Correct)
....temporal logic with #, # and the until operator U . In the case of By natural deduction systems we mean, as is usual, systems for proof under assumption that consist of introduction and elimination rules for each of the connectives except falsum, i.e. which only an elimination rule is given [27]. These rules define the meaning of each connective, specifying how it is introduced in a formula or eliminated from it. Our lds s subsume labelled natural deduction systems because we do not commit ourselves here to such requirements on the rules but allow for the more general form of rules of ....
A. S. Troelstra and H. Schwichtenberg. Basic proof theory. Cambridge University Press, 1996.
A Tableaux Calculus for Ambiguous Quantification - Monz, de Rijke (1998) (2 citations) (Correct)
....disambiguation does exist, it suffices to verify (falsify) this one, because it entails (is entailed by) all other disambiguations. But what are the circumstances under which a strongest (weakest) disambiguation exists To explain this we need to define positive and negative contexts (see also [TS96]) Definition 12. A u formula is a positive context for a subformula of , notation: con : j [ j [ j [ j [ j [ j 8x[ j 9x[ holds. A u formula is a negative context for a subformula of , con : j [ j [ j [ j [ j 8x[ j ....
A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, 1996.
Constructivism and Proof Theory - Troelstra (2003) Self-citation (Troelstra) (Correct)
No context found.
A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, Cambridge UK., 1996. To appear.
An Hypersequent Calculus for L/ukasiewicz Logic - Without The Merge (Correct)
No context found.
A.S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge U.P., 1996.
Categorical Models Of First-Order Classical Proofs - McKinley (2006) (Correct)
No context found.
A.S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, Cambridge, 1996.
A System of Interaction and Structure II: The Need for Deep.. - Tiu (2005) (Correct)
No context found.
A. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, 1996. 21
Cut Rules and Explicit Substitutions - Vestergaard, Wells (2000) (3 citations) (Correct)
No context found.
Troelstra, A.S. and Schwichtenberg, H. (1996). Basic Proof Theory, volume 43 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press.
Modal Sequent Calculi Labelled with Truth Values: Cut.. - Mateus, Rasga, Sernadas (Correct)
No context found.
A. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, 1996. 26
Imperative LF Meta-Programming - Stump (2004) (Correct)
No context found.
A. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, 2nd edition, 2000.
Validated Proof-Producing Decision Procedures - Klapper, Stump (2004) (Correct)
No context found.
A. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, 2nd edition, 2000. 15
Validated Proof-Producing Decision Procedures - Klapper, Stump (2004) (Correct)
No context found.
A. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, 2nd edition, 2000. 64
Uniform Variable Splitting - Antonsen (Correct)
No context found.
A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, 2 edition, 2000.
Explicit Provability And Constructive Semantics - Artemov (2001) (1 citation) (Correct)
No context found.
A. Troelstra and H. Schwichtenberg, Basic proof theory, Cambridge University Press, Amsterdam, 1996.
Combinable Proof Fragments for the Web - Silva, McGuinness, Fikes (2003) (2 citations) (Correct)
No context found.
A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, Cambridge, UK, second edition, 2000.
Re ective -calculus Jesse Alt - Sergei Artemov August (Correct)
No context found.
A.S. Troelstra and H. Schwichtenberg, Basic Proof Theory, Cambridge University Press, 1996. 19
"Clarifying the Nature of the Infinite": the development of.. - Avigad, Reck (2001) (Correct)
No context found.
A. S. Troelstra and Helmut Schwichtenberg. Basic Proof Theory. Cambridge University Press, Cambridge, second edition, 2000.
Combinable Proof Fragments for the Web - Silva, McGuinness, Fikes (2003) (2 citations) (Correct)
No context found.
A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, Cambridge, UK, second edition, 2000.
Reflection and Propositions-as-Types - Artemov, Barzilay, Constable, Nogin (Correct)
No context found.
A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, Amsterdam, 1996. 13
Comparing Control Constructs by Double-barrelled CPS - Thielecke (2002) (2 citations) (Correct)
No context found.
A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, 2001.
An O((n.log n)³)-time transformation from Grz into.. - Demri, Goré (1998) (Correct)
No context found.
A. Troelstra and H. Schwichtenberg. Basic Proof Theory. CUP, 1996.
Importing Isabelle Formal Mathematics into NuPRL - Naumov (1999) (2 citations) (Correct)
No context found.
A.S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, 1996.
First 50 documents Next 50
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