Definition. Compositionality, computability, and complexity › Complex indirect constant -systems (§ 8.3.4) [pagin2021-CIC]
Definition. Compositionality, computability, and complexity › Complex indirect constant -systems (§ 8.3.4) [pagin2021-CIC]
A complex indirect constant -system must satisfy the following.
- is finite.
- For any rule, the rewrite variables on the rhs must be a subset of those on the left.
- Rewrite variables take all and only object language grammatical terms as instances.
- Rewrite variables take all and only expressions in as instances.
- Every atomic rule is of the form where , and is a simple or complex expression in .
- For every pair there is an atomic rule.
- Every direct complex rule has the form where Gr corresponds to grammaticality.
- Every indirect complex rule has the form where are optional and .
- For every pair , there is a unique complex (indirect or direct) rule.
- Every indirect ground rule is of the -form or the -form where , , are operators over , and , and at most one of the primed operators is null.
- Every indirect recurisve rule in has an -form or -form where , , are operators over , , and at most one of the primed operators is null.