DECIDING DEFINABILITY IN FO 2 (< v , < h ) ON TREES

Thomas Place 1 Luc Segoufin 2
2 DAHU - Verification in databases
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
Abstract : We provide a decidable characterization of regular forest languages definable in FO 2 (
Document type :
Journal articles
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-01223373
Contributor : Luc Segoufin <>
Submitted on : Monday, November 2, 2015 - 3:24:40 PM
Last modification on : Thursday, July 4, 2019 - 3:56:24 PM
Long-term archiving on : Wednesday, February 3, 2016 - 10:52:34 AM

File

fodeux-char.pdf
Files produced by the author(s)

Identifiers

Citation

Thomas Place, Luc Segoufin. DECIDING DEFINABILITY IN FO 2 (< v , < h ) ON TREES. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2015, 11 (3), ⟨10.2168/LMCS-11(3:5)2015⟩. ⟨hal-01223373⟩

Share

Metrics

Record views

190

Files downloads

202