Pages that link to "Item:Q3868730"
From MaRDI portal
The following pages link to Proving termination with multiset orderings (Q3868730):
Displayed 50 items.
- A note on simplification orderings (Q1139374) (← links)
- Definability in dynamic logic (Q1158140) (← links)
- On multiset orderings (Q1165004) (← links)
- Posets admitting a unique order-compatible topology (Q1171078) (← links)
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory (Q1182475) (← links)
- Combining matching algorithms: The regular case (Q1186723) (← links)
- A general criterion for avoiding infinite unfolding during partial deduction (Q1205178) (← links)
- Conditional narrowing modulo a set of equations (Q1261194) (← links)
- Completion for rewriting modulo a congruence (Q1262752) (← links)
- Superposition theorem proving for abelian groups represented as integer modules (Q1275020) (← links)
- Decidability of behavioural equivalence in unary PCF (Q1285665) (← links)
- Self-stabilizing extensions for message-passing systems (Q1310564) (← links)
- Modularity of confluence: A simplified proof (Q1318777) (← links)
- Confluence by decreasing diagrams (Q1322164) (← links)
- A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets (Q1322849) (← links)
- Completeness results for basic narrowing (Q1328184) (← links)
- The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
- On proving the termination of algorithms by machine (Q1341666) (← links)
- On the modularity of termination of term rewriting systems (Q1349693) (← links)
- Buchberger's algorithm: The term rewriter's point of view (Q1350495) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- Deciding the word problem in the union of equational theories. (Q1400706) (← links)
- A uniform framework for term and graph rewriting applied to combined systems (Q1583048) (← links)
- Uniform interpolation and sequent calculi in modal logic (Q1712936) (← links)
- Skolemization and Herbrand theorems for lattice-valued logics (Q1733060) (← links)
- On the computational strength of pure ambient calculi (Q1763730) (← links)
- Partial orderings for sets of multisets (Q1821780) (← links)
- Proof of termination of the rewriting system SUBSET on CCL (Q1822494) (← links)
- Equality between functionals in the presence of coproducts (Q1854334) (← links)
- On terminating lemma speculations. (Q1854370) (← links)
- Right-linear half-monadic term rewrite systems (Q1884902) (← links)
- Three-variable statements of set-pairing (Q1885036) (← links)
- Deciding confluence of certain term rewriting systems in polynomial time (Q1886319) (← links)
- Intersection types for explicit substitutions (Q1887145) (← links)
- A linear time algorithm for monadic querying of indefinite data over linearly ordered domains (Q1887153) (← links)
- Decidability of bounded second order unification (Q1887168) (← links)
- Total termination of term rewriting (Q1912706) (← links)
- Infinite complete group presentations (Q1916428) (← links)
- Linear and unit-resulting refutations for Horn theories (Q1923821) (← links)
- An improved general path order (Q1925013) (← links)
- Jumping and escaping: modular termination and the abstract path ordering (Q1929229) (← links)
- Superposition decides the first-order logic fragment over ground theories (Q1949088) (← links)
- Sequent calculi for intuitionistic Gödel-Löb logic (Q1982008) (← links)
- A general framework for Noetherian well ordered polynomial reductions (Q2000264) (← links)
- Variadic equational matching in associative and commutative theories (Q2029000) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- Ground joinability and connectedness in the superposition calculus (Q2104507) (← links)
- A framework for approximate generalization in quantitative theories (Q2104546) (← links)
- The G4i analogue of a G3i sequent calculus (Q2106879) (← links)
- AC simplifications and closure redundancies in the superposition calculus (Q2142076) (← links)