Title :
Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory
Author :
Colcombet, Thomas
Author_Institution :
LIAFA, Univ. Paris-Diderot, Paris, France
Abstract :
Cost monadic logic extends monadic second-order logic with the ability to measure the cardinality of sets and comes with decision procedures for boundedness related questions. We provide new decidability results allowing the systematic investigation of questions involving “relative boundedness”. We first introduce a suitable logic, magnitude monadic logic. We then establish the decidability of this logic over finite words. We finally advocate that developing the proofs in the axiomatic system of “relative internal set theory”, a variant of nonstandard analysis, entails a significant simplification of the proofs.
Keywords :
decidability; set theory; axiomatic system; cardinality of sets; cost monadic logic; decidability; magnitude monadic logic; monadic second-order logic; relative boundedness; relative internal set theory; Automata; Context; Games; Set theory; Standards; Syntactics; Upper bound;
Conference_Titel :
Logic in Computer Science (LICS), 2013 28th Annual IEEE/ACM Symposium on
Conference_Location :
New Orleans, LA
Print_ISBN :
978-1-4799-0413-6
DOI :
10.1109/LICS.2013.17