LIPIcs.CSL.2011.218.pdf
- Filesize: 0.5 MB
- 15 pages
Document
Non-Definability Results for Randomised First-Order Logic
Author
-
Part of:
Volume:
Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL (CSL 2011)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Computer Science Logic (CSL) - License:
Creative Commons Attribution-NoDerivs 3.0 Unported license
- Publication Date: 2011-08-31
Cite AsGet BibTex
Kord Eickmeyer. Non-Definability Results for Randomised First-Order Logic. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 218-232, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.CSL.2011.218
https://doi.org/10.4230/LIPIcs.CSL.2011.218
Abstract
We investigate the expressive power of randomised first-order logic
(BPFO) on restricted classes of structures. While BPFO is
stronger than FO in general, even on structures with a built-in
addition relation, we show that BPFO is not stronger than FO
on structures with a unary vocabulary, nor on the class of
equivalence relations. The same techniques can be applied to show
that evenness of a linear order, and therefore graph connectivity,
can not be defined in BPFO. Finally, we show that there is an
FO[<]-definable query on word structures which can not be
defined in BPFO[+1].
Keywords
- descriptive complexity
- randomised logics
- derandomisation
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads