Quantifier alternation in a class of recursively defined tree properties
Logic
2019-02-15 v1 Combinatorics
Abstract
Alternating quantifier depth is a natural measure of difficulty required to express first order logical sentences. We define a sequence of first order properties on rooted, locally finite trees in a recursive manner, and provide rigorous arguments for finding the alternating quantifier depth of each property in the sequence, using Ehrenfeucht-Fra\"{i}ss\'{e} games.
Keywords
Cite
@article{arxiv.1902.05533,
title = {Quantifier alternation in a class of recursively defined tree properties},
author = {Moumanti Podder},
journal= {arXiv preprint arXiv:1902.05533},
year = {2019}
}
Comments
4 figures, 18 pages