Skip to content
<title>Channels - The First-Order Theory of Ground Tree Rewrite Graphs :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
The First-Order Theory of Ground Tree Rewrite Graphs
Search for more channels:
Similar Items: The First-Order Theory of Ground Tree Rewrite Graphs
Channel Options
View Record
Explore related channels
Quick Look
Canonized Rewriting and Ground AC Completion Modulo Shostak Theories : Design and Implementation
Quick Look
Thermodynamic graph-rewriting
Quick Look
Tree-width for first order formulae
Quick Look
On first-order transductions of classes of graphs
Quick Look
Partial Order Infinitary Term Rewriting
Quick Look
Modes of Convergence for Term Graph Rewriting
Quick Look
Positive First-order Logic on Words and Graphs
Quick Look
Towards 3-Dimensional Rewriting Theory
Quick Look
Undecidable First-Order Theories of Affine Geometries
Quick Look
A Functional (Monadic) Second-Order Theory of Infinite Trees
Quick Look
First Order Theories of Some Lattices of Open Sets
Quick Look
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
Quick Look
From nominal to higher-order rewriting and back again
Quick Look
Deciding Confluence and Normal Form Properties of Ground Term Rewrite Systems Efficiently
Quick Look
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
Quick Look
An Integrated First-Order Theory of Points and Intervals over Linear Orders (Part I)
Quick Look
An Integrated First-Order Theory of Points and Intervals over Linear Orders (Part II)
Quick Look
Complexity Hierarchies and Higher-order Cons-free Term Rewriting
Quick Look
Petri Net Reachability Graphs: Decidability Status of First Order Properties
Quick Look
Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic
Quick Look
Ground interpolation for the theory of equality
Quick Look
Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories
Quick Look
Analytic Tableaux for Simple Type Theory and its First-Order Fragment
Quick Look
Decidability of Querying First-Order Theories via Countermodels of Finite Width
Load more items
View Record
Prev
Explore related channels
Next
