The following pages link to (Q3409073):
Displaying 21 items.
- Inverse images of box formulas in modal logic (Q383565) (← links)
- Inessential features, ineliminable features, and modal logics for model theoretic syntax (Q1006492) (← links)
- LR parsing for LCFRS (Q1736827) (← links)
- Reasoning with ambiguity (Q2035848) (← links)
- Modal logics that are both monotone and antitone: Makinson's extension results and affinities between logics (Q2108580) (← links)
- Hybrid tree automata and the yield theorem for constituent tree automata (Q2164739) (← links)
- The failure of the strong pumping lemma for multiple context-free languages (Q2254497) (← links)
- Geometric representations for minimalist grammars (Q2255202) (← links)
- Stack and register complexity of radix conversions (Q2272392) (← links)
- Partial algebras, meaning categories and algebraization (Q2368946) (← links)
- Computation in networks of passively mobile finite-state sensors (Q2375293) (← links)
- Efficient learning of multiple context-free languages with multidimensional substitutability from positive data (Q2431429) (← links)
- A context-free language for binary multinomial processing tree models (Q2654150) (← links)
- The Proper Treatment of Linguistic Ambiguity in Ordinary Algebra (Q2835064) (← links)
- Disentangling Notions of Specifier Impenetrability: Late Adjunction, Islands, and Expressive Power (Q3172834) (← links)
- Normal Forms for Multiple Context-Free Languages and Displacement Lambek Grammars (Q3455855) (← links)
- Learning Left-to-Right and Right-to-Left Iterative Languages (Q3528409) (← links)
- The Pumping Lemma for Well-Nested Multiple Context-Free Languages (Q3637235) (← links)
- AGGREGATION AND IDEMPOTENCE (Q5414137) (← links)
- Hybrid tree automata and the yield theorem for constituent tree automata (Q6057836) (← links)
- A step towards absolute versions of metamathematical results (Q6150669) (← links)
