Admissibility of cut in LC with fixed point combinator (Q817697): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q591019 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Martin W. Bunder / rank | |||
Normal rank | |||
Revision as of 02:56, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Admissibility of cut in LC with fixed point combinator |
scientific article |
Statements
Admissibility of cut in LC with fixed point combinator (English)
0 references
17 March 2006
0 references
Structurally free logics are sequent calculi that include combinators and dual combinators as formulas. Standard structural rules can be conveniently stated using these combinators. The author extends previously studied systems which involved only proper combinator by including structural rules involving the fixed point combinator \(Y\) and its dual \(y\). She shows that in this extended system a multiple cut rule is admissible.
0 references
Combinatory logic
0 references
structurally free logics
0 references
substructural logics
0 references
cut rule
0 references
fixed point combinator
0 references
