Free Variables and Theories: Revisiting Rigid E-unification (Q2964448): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient Algorithms for Bounded Rigid E-unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving with Bounded Rigid E-Unification / 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: What you always wanted to know about rigid \(E\)-unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4863622 / 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: Q4412856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presburger arithmetic with unary predicates is <i>Π</i><sub>1</sub><sup>1</sup> complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723421 / rank
 
Normal rank

Latest revision as of 11:10, 13 July 2024

scientific article
Language Label Description Also known as
English
Free Variables and Theories: Revisiting Rigid E-unification
scientific article

    Statements

    Identifiers