The two‐variable fragment with counting and equivalence (Q3460527): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Modal languages and bounded fragments of predicate logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small solutions of linear diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Carathéodory bounds for integer cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Restraining Power of Guards / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Decision Problem for Two-Variable First-Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tableau decision procedure for \(\mathcal{SHOIQ}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical reasoning for very expressive description logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of some simple formalized theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Variable First-Order Logic with Equivalence Closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: On languages with two variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the two-variable fragment with counting quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the Guarded Two-variable Fragment with Counting Quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank

Latest revision as of 07:56, 11 July 2024

scientific article
Language Label Description Also known as
English
The two‐variable fragment with counting and equivalence
scientific article

    Statements

    The two‐variable fragment with counting and equivalence (English)
    0 references
    0 references
    7 January 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    first-order logic with counting
    0 references
    satisfiability
    0 references
    finite satisfiability
    0 references
    NExpTime-completeness
    0 references
    two-variable first-order logic
    0 references
    0 references