Pages that link to "Item:Q3868730"
From MaRDI portal
The following pages link to Proving termination with multiset orderings (Q3868730):
Displayed 48 items.
- 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)
- 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)
- Ensuring termination by typability (Q2500473) (← links)
- Reduction relations for monoid semirings (Q2643513) (← links)
- Decision Procedures for Automating Termination Proofs (Q3075496) (← links)
- Mobile Processes and Termination (Q3184750) (← links)
- Implementing term rewriting by jungle evaluation (Q3486867) (← links)
- Labelled Calculi for Łukasiewicz Logics (Q3511458) (← links)
- Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities (Q3522029) (← links)
- (Q3700828) (← links)
- On an interpretation of second order quantification in first order intuitionistic propositional logic (Q4008745) (← links)
- Contraction-free sequent calculi for intuitionistic logic (Q4032862) (← links)
- The order types of termination orderings on monadic terms, strings and multisets (Q4358058) (← links)
- Extensions of arithmetic for proving termination of computations (Q4732468) (← links)
- SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID (Q4786319) (← links)
- A multi-dimensional terminological knowledge representation language (Q4868227) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions (Q5458329) (← links)
- Termination Analysis of CHR Revisited (Q5504676) (← links)
- Speeding up algorithms on atomic representations of Herbrand models via new redundancy criteria (Q5927983) (← links)
- Tableau methods for a logic with term declarations (Q5927986) (← links)
- Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem (Q5941196) (← links)
- A general framework to build contextual cover set induction provers (Q5950934) (← links)
- Two applications of analytic functors (Q5958294) (← links)