Polynomial time logic: Inability to express
Logic
2009-09-25 v1 Logic in Computer Science
Abstract
Here we deal with the logic of [GuSh 533], which tries to capture polynomial time (for finite models). There it is proved that the logic cannot say much on models with equality only. Here we prove that it cannot say much on models for which we expect it cannot say much, like random enough graphs. This is the result of having a general criterion.
Keywords
Cite
@article{arxiv.math/9807179,
title = {Polynomial time logic: Inability to express},
author = {Saharon Shelah},
journal= {arXiv preprint arXiv:math/9807179},
year = {2009}
}