The following pages link to (Q4385532):
Displaying 50 items.
- Remarks on Thatte's transformation of term rewriting systems (Q1763376) (← links)
- Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
- Normalisation for higher-order calculi with explicit substitutions (Q1770414) (← links)
- Tree automata with one memory set constraints and cryptographic protocols (Q1770429) (← links)
- Abstract interpretation of mobile systems (Q1772313) (← links)
- Skew confluence and the lambda calculus with letrec (Q1849854) (← links)
- Algorithms and reductions for rewriting problems. II. (Q1853144) (← links)
- Unions of non-disjoint theories and combinations of satisfiability procedures (Q1853591) (← links)
- Normalization, approximation, and semantics for combinator systems (Q1853619) (← links)
- Logic with equality: Partisan corroboration and shifted pairing (Q1854299) (← links)
- Bisimilarity in term graph rewriting. (Q1854321) (← links)
- Sequentiality, monadic second-order logic and tree automata. (Q1854333) (← links)
- Higher order unification via explicit substitutions (Q1854337) (← links)
- Descendants and origins in term rewriting. (Q1854348) (← links)
- Induction = I-axiomatization + first-order consistency. (Q1854350) (← links)
- Complexity of nilpotent unification and matching problems. (Q1854363) (← links)
- On terminating lemma speculations. (Q1854370) (← links)
- Using tableaux to automate the Lambek and other categorial calculi (Q1854380) (← links)
- Automata-driven automated induction (Q1854445) (← links)
- A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser (Q1854476) (← links)
- The undecidability of the first-order theories of one step rewriting in linear canonical systems (Q1854538) (← links)
- A hidden Herbrand theorem: Combining the object and logic paradigms (Q1858427) (← links)
- Cancellative Abelian monoids and related structures in refutational theorem proving. I (Q1864898) (← links)
- Finding direct partition bijections by two-directional rewriting techniques (Q1877658) (← links)
- Pattern matching as cut elimination (Q1882898) (← links)
- Sound generalizations in mathematical induction (Q1882908) (← links)
- Right-linear half-monadic term rewrite systems (Q1884902) (← links)
- Ground reducibility is EXPTIME-complete (Q1887142) (← links)
- Implicit induction in conditional theories (Q1891255) (← links)
- Asynchronous communication model based on linear logic (Q1898813) (← links)
- Category-based modularisation for equational logic programming (Q1901708) (← links)
- Normal forms in combinatory logic (Q1903133) (← links)
- Total termination of term rewriting (Q1912706) (← links)
- Induction using term orders (Q1915132) (← links)
- On the rational subsets of the free group (Q1924996) (← links)
- From diagrammatic confluence to modularity (Q1929228) (← links)
- Some general results about proof normalization (Q1931341) (← links)
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (Q1931906) (← links)
- Declarative debugging of rewriting logic specifications (Q1931907) (← links)
- Monadic simultaneous rigid \(E\)-unification (Q1960540) (← links)
- Elimination of conditions (Q1974693) (← links)
- Proving theorems by reuse (Q1978233) (← links)
- Specification and proof in membership equational logic (Q1978640) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- Logicality of conditional rewrite systems (Q1978646) (← links)
- A procedure for deciding symbolic equivalence between sets of constraint systems (Q2013557) (← links)
- A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems (Q2095424) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description) (Q2104541) (← links)
- Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach (Q2219192) (← links)
