Disjunction property and complexity of substructural logics (Q549720): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2011.04.004 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983988429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity issues in Basic Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of nonassociative Lambek calculus with unit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128959 / 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: Expanding the Realm of Systematic Proof Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of philosophical logic. Vol. 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / 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: Algebraization, parametrized local deduction theorem and interpolation for substructural logics over FL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical non-associative Lambek calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metamathematics of fuzzy logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems for propositional linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Logic of Bunched Implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4805593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic approach to the disjunction property of substructural logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic propositional logic is polynomial-space complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the polynomial-space completeness of intuitionistic propositional logic / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2011.04.004 / rank
 
Normal rank

Latest revision as of 21:13, 9 December 2024

scientific article
Language Label Description Also known as
English
Disjunction property and complexity of substructural logics
scientific article

    Statements

    Disjunction property and complexity of substructural logics (English)
    0 references
    0 references
    0 references
    18 July 2011
    0 references
    substructural logics
    0 references
    disjunction property
    0 references
    computational complexity
    0 references

    Identifiers