Definition. Compositionality, computability, and complexity › Complex indirect constant μ-systems (§ 8.3.4) [pagin2021-CIC]

A complex indirect constant μ-system Φ must satisfy the following.

  1. RΦ is finite.
  2. For any rule, the rewrite variables on the rhs must be a subset of those on the left.
  3. Rewrite variables v1,v2,... take all and only object language grammatical terms as instances.
  4. Rewrite variables y1,y2,... take all and only expressions in Cm as instances.
  5. Every atomic rule rRΦ is of the form μi(t)e where μiS, tAO and e is a simple or complex expression in Cm.
  6. For every pair μiS,tAo there is an atomic rule.
  7. Every direct complex rule r has the form μi(α(v1,...,vn))K(μk1(v1),...,μkn(vn))Gr(α(v1,...,vn)) where Gr corresponds to grammaticality.
  8. Every indirect complex rule has the form μi(α(v1,...,vn))f(μk1(v1),...,μkn(vn),v1,...,vn)Gr(α(v1,...,vn)) where v1,...,vn are optional and fF.
  9. For every pair μiS,αΣo, there is a unique complex (indirect or direct) rule.
  10. Every indirect ground rule is of the F-form f(y1,...,yn,...,tn)K(f(y1,...,yn)) or the G-form g(e1,...,en)K(e1,...,en) where f,fF, gG, K,K are operators over Σm, e1,...,enAm and t1,...,tjAo, and at most one of the primed operators is null.
  11. Every indirect recurisve rule in RΦ has an F-form f(y1,...,yn,σ(v1,...,vn))K(f(y1,...,yn,v1)...,f(y1,...,yn,vn)) or G-form g(K(y1,...,yn))K(g(y1,...,yn)) where fF, g,gG, K,K are operators over Σm, σΣO, and at most one of the primed operators is null.