Admissibility of cut in LC with fixed point combinator (Q817697): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11225-005-4651-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066761871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics for structurally free logics LC+ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two extensions of the structurally free logic LC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinators and structurally free logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinator logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560258 / rank
 
Normal rank

Latest revision as of 12:05, 24 June 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
    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
    0 references
    Combinatory logic
    0 references
    structurally free logics
    0 references
    substructural logics
    0 references
    cut rule
    0 references
    fixed point combinator
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references