Decidability and complexity of simultaneous rigid E-unification with one variable and related results (Q1575636): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56765172, #quickstatements; #temporary_batch_1712186161777
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Theorem Proving via General Matings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3833651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree generating regular systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottom-up tree pushdown automata: Classification and connection with rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of simultaneous rigid E-unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree acceptors and some of their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order modal tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigid E-unification: NP-completeness and applications to equational matings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem proving using equational matings and rigid <i>E</i> -unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic simultaneous rigid E-unification and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive First-Order Logic Is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanical Theorem-Proving by Model Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic automata and context-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5559244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special cases and substitutes for rigid \(E\)-unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Haskell overloading is DEXPTIME-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for reasoning about equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient ground completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Herbrand's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof-search in intuitionistic logic based on constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof-search in intuitionistic logic with equality, or back to simultaneous rigid E-unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem / rank
 
Normal rank

Latest revision as of 13:13, 30 May 2024

scientific article
Language Label Description Also known as
English
Decidability and complexity of simultaneous rigid E-unification with one variable and related results
scientific article

    Statements

    Decidability and complexity of simultaneous rigid E-unification with one variable and related results (English)
    0 references
    0 references
    21 August 2000
    0 references
    0 references
    rigid-unification
    0 references
    finite tree automata
    0 references
    logic with equality
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references