We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

On a hierarchy involving transitive closure logic and existential second-order quantification.

Gault, R. L. and Stewart, I. A. (2001) 'On a hierarchy involving transitive closure logic and existential second-order quantification.', Logic journal of the IGPL., 9 (6). pp. 769-780.


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.

Item Type:Article
Keywords:Finite model theory, Ehrenfeucht-Fraïssé games, Existential second-order logic, Transitive closure logic.
Full text:Full text not available from this repository.
Publisher Web site:
Date accepted:No date available
Date deposited:No date available
Date of first online publication:2001
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar