Coherence and computational complexity of quantifier-free dependence logic formulas (Q1956380): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991388620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite model theory and its applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On definability in dependence logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3446107 / rank
 
Normal rank

Latest revision as of 12:23, 6 July 2024

scientific article
Language Label Description Also known as
English
Coherence and computational complexity of quantifier-free dependence logic formulas
scientific article

    Statements

    Coherence and computational complexity of quantifier-free dependence logic formulas (English)
    0 references
    0 references
    13 June 2013
    0 references
    dependence
    0 references
    logic
    0 references
    team
    0 references
    complexity
    0 references
    coherence
    0 references
    model checking
    0 references
    computational complexity
    0 references
    quantifier-free dependence logic
    0 references

    Identifiers