Complexity of some problems in positive and related calculi (Q1401362): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3128959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guide to completeness and complexity for modal logics of knowledge and belief / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4175531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic logic and implicit definability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic propositional logic is polynomial-space complete / rank
 
Normal rank

Revision as of 08:51, 6 June 2024

scientific article
Language Label Description Also known as
English
Complexity of some problems in positive and related calculi
scientific article

    Statements

    Complexity of some problems in positive and related calculi (English)
    0 references
    17 August 2003
    0 references
    complexity
    0 references
    positive logic
    0 references
    interpolation
    0 references
    projective Beth property
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references