Expressibility of higher-order logics on relational databases : proper hierarchies : a dissertation presented in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Information Systems at Massey University, Wellington, New Zealand

Description

We investigate the expressive power of different fragments of higher-order logics over finite relational structures (or equivalently, relational databases) with special emphasis in higher-order logics of order greater than or equal three. Our main results concern the study of the effect on the expressive power of higher-order logics, of simultaneously bounding the arity of the higher-order variables and the alternation of quantifiers.

Links & Downloads

1. http://hdl.handle.net/10179/678

Tags

finite model theory

databases

higher order logics

expressibility

quantifier alternation

quantifier arity

Additional Fields

Identifer	oai:union.ndltd.org:ADTP/186038
Creators	Ferrarotti, Flavio Antonio
Source Sets	Australiasian Digital Theses Program
Language	English
Detected Language	English