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

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import recommendations run Q6534273
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1017/jsl.2015.18 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1017/JSL.2015.18 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Negation with logical variables in conditional rewriting / rank
 
Normal rank
Property / Recommended article: Negation with logical variables in conditional rewriting / qualifier
 
Similarity Score: 0.78353155
Amount0.78353155
Unit1
Property / Recommended article: Negation with logical variables in conditional rewriting / qualifier
 
Property / Recommended article
 
Property / Recommended article: Conditional rewrite rule systems with built-in arithmetic and induction / rank
 
Normal rank
Property / Recommended article: Conditional rewrite rule systems with built-in arithmetic and induction / qualifier
 
Similarity Score: 0.7597657
Amount0.7597657
Unit1
Property / Recommended article: Conditional rewrite rule systems with built-in arithmetic and induction / qualifier
 
Property / Recommended article
 
Property / Recommended article: Simplifying conditional term rewriting systems: Unification, termination and confluence / rank
 
Normal rank
Property / Recommended article: Simplifying conditional term rewriting systems: Unification, termination and confluence / qualifier
 
Similarity Score: 0.74728787
Amount0.74728787
Unit1
Property / Recommended article: Simplifying conditional term rewriting systems: Unification, termination and confluence / qualifier
 
Property / Recommended article
 
Property / Recommended article: Elimination of conditions / rank
 
Normal rank
Property / Recommended article: Elimination of conditions / qualifier
 
Similarity Score: 0.7438983
Amount0.7438983
Unit1
Property / Recommended article: Elimination of conditions / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3819990 / rank
 
Normal rank
Property / Recommended article: Q3819990 / qualifier
 
Similarity Score: 0.7433543
Amount0.7433543
Unit1
Property / Recommended article: Q3819990 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Conditional rewrite rules / rank
 
Normal rank
Property / Recommended article: Conditional rewrite rules / qualifier
 
Similarity Score: 0.7425148
Amount0.7425148
Unit1
Property / Recommended article: Conditional rewrite rules / qualifier
 
Property / Recommended article
 
Property / Recommended article: Unravelings and ultra-properties / rank
 
Normal rank
Property / Recommended article: Unravelings and ultra-properties / qualifier
 
Similarity Score: 0.74191743
Amount0.74191743
Unit1
Property / Recommended article: Unravelings and ultra-properties / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3696496 / rank
 
Normal rank
Property / Recommended article: Q3696496 / qualifier
 
Similarity Score: 0.7392137
Amount0.7392137
Unit1
Property / Recommended article: Q3696496 / qualifier
 
Property / Recommended article
 
Property / Recommended article: MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE / rank
 
Normal rank
Property / Recommended article: MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE / qualifier
 
Similarity Score: 0.7371084
Amount0.7371084
Unit1
Property / Recommended article: MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE / qualifier
 
Property / Recommended article
 
Property / Recommended article: UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS / rank
 
Normal rank
Property / Recommended article: UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS / qualifier
 
Similarity Score: 0.73245585
Amount0.73245585
Unit1
Property / Recommended article: UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS / qualifier
 

Latest revision as of 19:59, 27 January 2025

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