Intuitionistic propositional logic is polynomial-space complete (Q1259589): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): journals/tcs/Statman79, #quickstatements; #temporary_batch_1731505720702
 
(5 intermediate revisions by 5 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56224787 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991670662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5565113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5582318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5559220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5537599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The typed lambda-calculus is not elementary recursive / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/Statman79 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:02, 13 November 2024

scientific article
Language Label Description Also known as
English
Intuitionistic propositional logic is polynomial-space complete
scientific article

    Statements

    Intuitionistic propositional logic is polynomial-space complete (English)
    0 references
    0 references
    1979
    0 references
    validity in intuitionistic propositional logic
    0 references
    length of derivations
    0 references
    complexity of proofs
    0 references
    Np-completeness
    0 references
    proof theory
    0 references
    typed lambda calculus
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers