On a hierarchy involving transitive closure logic and existential second-order quantification
Gault, R.L.; Stewart, I.A.
We study a hierarchy of logics where each formula of each logic in the hierarchy consists of a formula of a certain fragment of transitive closure logic prefixed with an existentially quantified tuple of unary relation symbols. By playing an Ehrenfeucht-Fraïssé game specifically developed for our logics, we prove that there are problems definable in the second level of our hierarchy that are not definable in the first; and that if we are to prove that the hierarchy is proper in its entirety (or even that the third level does not collapse to the second) then we shall require substantially different constructions than those used previously to show that the hierarchy is indeed proper in the absence of the existentially quantified second-order symbols.
Gault, R., & Stewart, I. (2001). On a hierarchy involving transitive closure logic and existential second-order quantification. Logic Journal of the IGPL, 9(6), 769-780. https://doi.org/10.1093/jigpal/9.6.769
|Journal Article Type||Article|
|Publication Date||Jan 1, 2001|
|Deposit Date||Jun 29, 2009|
|Journal||Logic Journal of the Interest Group in Pure and Applied Logic (IGPL)|
|Publisher||Oxford University Press|
|Peer Reviewed||Peer Reviewed|
|Keywords||Finite model theory, Ehrenfeucht-Fraïssé games, Existential second-order logic, Transitive closure logic.|
You might also like
Using semidirect products of groups to build classes of interconnection networks
Variational networks of cube-connected cycles are recursive cubes of rings
INRFlow: An interconnection networks research flow-level simulation framework
The influence of datacenter usage on symmetry in datacenter network design