FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE (Q3188328): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The contraction rule and decision problems for logics without structural rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicate logics without the structure rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untersuchungen über das logische Schliessen. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Residuated lattices. An algebraic glimpse at substructural logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word problem for knotted residuated lattices. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untersuchungen über das logische Schliessen. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic proof theory for substructural logics: cut-elimination and completions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems for propositional linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: ALGORITHMIC PROBLEMS IN VARIETIES / rank
 
Normal rank

Revision as of 10:39, 12 July 2024

scientific article
Language Label Description Also known as
English
FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE
scientific article

    Statements

    FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE (English)
    0 references
    0 references
    0 references
    19 August 2016
    0 references
    substructural logic
    0 references
    full Lambek calculus
    0 references
    contraction rule
    0 references
    square-increasing residuated lattice
    0 references
    equational theory
    0 references
    decidability
    0 references

    Identifiers