The size of a formula as a measure of complexity
Logic
2012-08-24 v1 Logic in Computer Science
Abstract
We introduce a refinement of the usual Ehrenfeucht-Fra\"{\i}ss\'e game. The new game will help us make finer distinctions than the traditional one. In particular, it can be used to measure the size formulas needed for expressing a given property. We will give two versions of the game: the first version characterizes the size of formulas in propositional logic, and the second version works for first-order predicate logic.
Keywords
Cite
@article{arxiv.1208.4803,
title = {The size of a formula as a measure of complexity},
author = {Lauri Hella and Jouko Väänänen},
journal= {arXiv preprint arXiv:1208.4803},
year = {2012}
}
Comments
25 pages