Pages that link to "Item:Q4647523"

The following pages link to An improved lower bound for the elementary theories of trees (Q4647523):

Displaying 7 items.

• Extracting models from clause sets saturated under semantic refinements of the resolution rule. (Q1401929) (← links)
• Explicit versus implicit representations of subsets of the Herbrand universe. (Q1853582) (← links)
• Ordering constraints over feature trees expressed in second-order monadic logic. (Q1854347) (← links)
• Working with ARMs: Complexity results on atomic representations of Herbrand models (Q1854418) (← links)
• The first order theory of primal grammars is decidable (Q1882903) (← links)
• (Q5020661) (← links)
• A Full First-Order Constraint Solver for Decomposable Theories (Q5505492) (← links)