Is there a logic without induction that captures much of P? Posted by András Salamon, at cstheory.stackexchange.com, 02 Sep 2010 The Immerman-Vardi theorem states that PTIME (or P) is precisely the class of languages that can be described by a sentence of…