Polynomial time logic: Inability to express
Saharon Shelah
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.
Create a lesson
Related papers
A Reflection Calculus for Bar Induction and the Linearity of Consistency Strength Ordering
Fedor Pakhomov, Vlad Lazar
What David Teaches Goliath: An Inevitable Extension of ZFC
Ali Enayat
Measures in Nairian models, I
Gabriel Goldberg, Grigor Sargsyan
On separable pairs of fields and beautiful pairs of separably closed valued fields
Zhengqing He, Martin Hils
Fragments of SRP, the nonstationary ideal, and diagonal reflection
Gunter Fuchs, Hiroshi Sakai
Functional Projection and Complexity Reduction
Vera Fischer, Yurii Khomskii, Yipu Li et al.