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

Ferrarotti, Flavio Antonio2008-08-132008-08-132008http://hdl.handle.net/10179/678We 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.enThe AuthorFinite model theoryDatabasesHigher order logicsExpressibilityQuantifier alternationFields of Research::280000 Information, Computing and Communication Sciences::280400 Computation Theory and Mathematics::280403 Logics and meaning of programsExpressibility 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 ZealandThesisQ111965385https://www.wikidata.org/wiki/Q111965385