All finitely axiomatizable tense logics of linear time flows are coNP-complete (Q817685): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: All normal extensions of S5-squared are finitely axiomatizable / rank
 
Normal rank
Property / cites work
 
Property / cites work: All proper normal extensions of S5-square have the polynomial size model property / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order logic with two variables and unary temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5483006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of refutation Kripke models for some linear modal and tense logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional linear temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tense Logic Without Tense Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Finitely Axiomatizable Normal Extensions of K4.3 are Decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4789450 / rank
 
Normal rank

Latest revision as of 11:05, 24 June 2024

scientific article
Language Label Description Also known as
English
All finitely axiomatizable tense logics of linear time flows are coNP-complete
scientific article

    Statements

    All finitely axiomatizable tense logics of linear time flows are coNP-complete (English)
    0 references
    0 references
    0 references
    17 March 2006
    0 references
    NP-completeness
    0 references
    tense logic
    0 references
    temporal logic
    0 references
    computational complexity
    0 references
    frame incompleteness
    0 references

    Identifiers

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