Regular quantifiers in Logics
Material type:
TextPublication details: 2013Description: 130pSubject(s): Computer Science | First Order Logic | HBNI Th64 | Linear Temporal Logic | LogicsOnline resources: Click here to access online Dissertation note: 2013Ph.DHBNI Abstract: In this thesis, we study logic on words extended with regular quantifiers. Modulo counting quantifiers are one particular example of such quantifiers, which have been well studied in the past. These quantifiers can be generalized to group quantifiers and further to monoid quantifiers all being regular quantifiers. The logics we extend can be classified into two parts. In the first part, we look at logics which define regular languages like FO[<] and linear temporal logic (LTL). We extend these logics with the above mentioned regular quantifiers. In the second part, we look at regular quantifiers over a linear order and an addition function which respects the linear order. In the first part of our work, we show that LTL extended with modulo counting/ group operators (LTLgrp) and FO[<] extended with modulo counting/group quantifiers (FOgrp[<]), both accept the same set of languages. We then go on to show that the satisfiability and model checking for LTLgrp is PSPACE-complete. We also look at satisfiability of various fragments of this logic. Then we show that the two variable fragment of FOgrp[<] is EXPSPACE-complete. We also analyse certain important sublogics. In the second part of our work, we study first order logic with a linear order and the arithmetic predicate, +. We first show that the two variable fragment of FOmod[<,+] is undecidable. Then we show that over a unary alphabet satisfiability of FOmod[<,+] is 2EXPSPACE. Finally we investigate the expressive power of M[<,+], where M is a set of monoid quantifiers. We show, using the concept of a neutral letter [BIL+05], that the class of neutral letter languages definable in M[<,+] is equivalent to those definable in M[<]. Using the above claim, we are able to show that the logics M1[<,+] is different from M2[<,+], if the set of monoid quantifiers M1 and M2 are different. This lets us answer a conjecture of Roy and Straubing [RS07] that FO[<,+] and mod[<,+] are incomparable. We also show that given a regular language L, it is decidable whether L is definable in mod[<,+] or not.
THESIS & DISSERTATION
| Current library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
| IMSc Library | IMSc Library | HBNI Th64 (Browse shelf (Opens below)) | Link to resource | Available | 69861 |
2013
Ph.D
HBNI
In this thesis, we study logic on words extended with regular quantifiers. Modulo counting quantifiers are one particular example of such quantifiers, which have been well studied in the past. These quantifiers can be generalized to group quantifiers and further to monoid quantifiers all being regular quantifiers. The logics we extend can be classified into two parts. In the first part, we look at logics which define regular languages like FO[<] and linear temporal logic (LTL). We extend these logics with the above mentioned regular quantifiers. In the second part, we look at regular quantifiers over a linear order and an addition function which respects the linear order. In the first part of our work, we show that LTL extended with modulo counting/ group operators (LTLgrp) and FO[<] extended with modulo counting/group quantifiers (FOgrp[<]), both accept the same set of languages. We then go on to show that the satisfiability and model checking for LTLgrp is PSPACE-complete. We also look at satisfiability of various fragments of this logic. Then we show that the two variable fragment of FOgrp[<] is EXPSPACE-complete. We also analyse certain important sublogics. In the second part of our work, we study first order logic with a linear order and the arithmetic predicate, +. We first show that the two variable fragment of FOmod[<,+] is undecidable. Then we show that over a unary alphabet satisfiability of FOmod[<,+] is 2EXPSPACE. Finally we investigate the expressive power of M[<,+], where M is a set of monoid quantifiers. We show, using the concept of a neutral letter [BIL+05], that the class of neutral letter languages definable in M[<,+] is equivalent to those definable in M[<]. Using the above claim, we are able to show that the logics M1[<,+] is different from M2[<,+], if the set of monoid quantifiers M1 and M2 are different. This lets us answer a conjecture of Roy and Straubing [RS07] that FO[<,+] and mod[<,+] are incomparable. We also show that given a regular language L, it is decidable whether L is definable in mod[<,+] or not.
There are no comments on this title.