Pages that link to "Item:Q3868730"

The following pages link to Proving termination with multiset orderings (Q3868730):

Displaying 50 items.

• A semantic account of strong normalization in linear logic (Q276260) (← links)
• Proof theory for lattice-ordered groups (Q287483) (← links)
• Paramodulation with non-monotonic orderings and simplification (Q352977) (← links)
• On unification and admissible rules in Gabbay-de Jongh logics (Q386639) (← links)
• Intermutation (Q421481) (← links)
• On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
• Proof pearl: a formal proof of Higman's lemma in ACL2 (Q438550) (← links)
• On multiset ordering (Q502679) (← links)
• Hypergraph polytopes (Q554398) (← links)
• Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
• Orderings for term-rewriting systems (Q593789) (← links)
• Lazy narrowing: strong completeness and eager variable elimination (Q671677) (← links)
• Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
• Modularity in noncopying term rewriting (Q673186) (← links)
• Natural termination (Q673622) (← links)
• Mathematics of multisets: a unified approach (Q680223) (← links)
• Complete axiomatizations of some quotient term algebras (Q685393) (← links)
• On weakly confluent monadic string-rewriting systems (Q685433) (← links)
• Rippling: A heuristic for guiding inductive proofs (Q685548) (← links)
• Deleting string rewriting systems preserve regularity (Q703575) (← links)
• The Hydra battle and Cichon's principle (Q734036) (← links)
• A descriptive type foundation for RDF Schema (Q739626) (← links)
• Linearizing well quasi-orders and bounding the length of bad sequences (Q744984) (← links)
• Using forcing to prove completeness of resolution and paramodulation (Q757093) (← links)
• A completion procedure for conditional equations (Q758211) (← links)
• Leanest quasi-orderings (Q876045) (← links)
• Normal forms for fuzzy logics: a proof-theoretic approach (Q884948) (← links)
• Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
• Unique parallel decomposition in branching and weak bisimulation semantics (Q896916) (← links)
• Equational completion in order-sorted algebras (Q912606) (← links)
• A rationale for conditional equational programming (Q915429) (← links)
• Conditional equational theories and complete sets of transformations (Q918541) (← links)
• On some homotopical and homological properties of monoid presentations. (Q927282) (← links)
• A complexity tradeoff in ranking-function termination proofs (Q1006896) (← links)
• Giles's game and the proof theory of Łukasiewicz logic (Q1037588) (← links)
• Differential dynamic logic for hybrid systems (Q1040772) (← links)
• Context unification with one context variable (Q1041589) (← links)
• Termination orderings for associative-commutative rewriting systems (Q1072371) (← links)
• A theory for nondeterminism, parallelism, communication, and concurrency (Q1081296) (← links)
• Constructing recursion operators in intuitionistic type theory (Q1094421) (← links)
• Termination of rewriting (Q1098624) (← links)
• Path of subterms ordering and recursive decomposition ordering revisited (Q1099655) (← links)
• The Church-Rosser property for ground term-rewriting systems is decidable (Q1100890) (← links)
• History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
• Extension functions for multiset orderings (Q1104349) (← links)
• Only prime superpositions need be considered in the Knuth-Bendix completion procedure (Q1106657) (← links)
• Critical pair criteria for completion (Q1106659) (← links)
• On termination of the direct sum of term-rewriting systems (Q1108785) (← links)
• A geometrical approach to multiset orderings (Q1119955) (← links)
• Equational problems and disunification (Q1124372) (← links)