• Keine Ergebnisse gefunden

PETER SCHROEDER-HEISTER,

N/A
N/A
Protected

Academic year: 2021

Aktie "PETER SCHROEDER-HEISTER,"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

PETER SCHROEDER-HEISTER,An alternative implication-left schema for the se- quent calculus.

Wilhelm-Schickard-Institut f¨ur Informatik, Universit¨at T¨ubingen, Sand 13, 72076 T¨ubingen, Germany.

E-mail: psh@informatik.uni-tuebingen.de.

As an alternative to Gentzen’s schema (→L) for the introduction of implication on the left side of the sequent sign in the intuitionistic sequent calculus LJwe propose the schema (→L):

(→L) Γ⊢A ∆, B⊢C

Γ,∆, A→B⊢C (→L) Γ⊢A Γ, A→B⊢B

In the absence of cut, (→L)is weaker than (→L). In the system based on (→L), cut is admissible except for cuts whose left premiss is the conclusion of (→L), i.e., cuts of the following restricted form:

... (→L)

Γ⊢A

... A,∆⊢C (cut)

Γ,∆⊢C

Using cut in this restricted form, (→L) and (→L)can be shown to be equivalent. Un- like full cut, applications of restricted cut do not compromise the subformula property and are harmless in this sense. Philosophically, (→L)is motivated by the interpreta- tion of implications as rules [1, 2] and can be viewed as a direct translation ofmodus ponens into the sequent calculus.

[1]P. Schroeder-Heister,Generalized elimination inferences, higher-level rules, and the implications-as-rules interpretation of the sequent calculus,Advances in Nat- ural Deduction(E. H. Haeusler, L. C. Pereira and V. de Paiva, editors), 2010.

[2] Implications-as-rules vs. implications-as-links: An alternative implication -left schema for the sequent calculus, submitted for publication.

Referenzen

ÄHNLICHE DOKUMENTE

Previous experimental research has shown that such models can account for the information processing of dimensionally described and simultaneously presented choice

(c) Repeat the exercise, only this time the cone’s tip is fixed to a point on the z axis such that its longitudinal axis is parallel with the

� is an upper bound to the generalization error of a trained ML classifier of limited complexity.. � is a lower bound to the generalization error of a trained ML classifier of

Start a MPI cluster (e.g. in a public Cloud infrastructure service like Amazon EC2) and execute your MPI application in the MPI cluster4. Test your MPI application with dierent

The interpretation of implications as rules motivates a different left-introduction schema for implication in the sequent calculus, which is conceptually more basic than

Conversely, every derivation in higher-level natural deduction can be translated into the higher-level sequent calculus (with cut) along the lines described by Gentzen ([6],

Satzmenge wahr wird. Formulieren Sie die entsprechenden Dekompositionsregeln.. Symbolisieren Sie die folgenden Sätze in PLI, ohne Satzbuchstaben zu verwenden. Verwenden Sie dabei

Bestimmen Sie, ob die folgenden Modalverkn¨ upfungen affirmativ oder nega- tiv sind und geben Sie ihre