[FOM] Two Questions About Second-order Branching Quantifiers
T.Forster at dpmms.cam.ac.uk
Sat Jan 27 03:40:48 EST 2007
There's a theorem about this in the literature, connecting branching
quantifiers to NP formulae. No doubt others will be quick off the mark
with the details. I have a student about to start work on this stuff, and
it has been much on my mind.
As for how to write these things in LaTeX you might find this illustration
\forall x \exists y \\
\forall x'\exists y' \\
\left( (x = x' \to y = y') \wedge R(x,y) \wedge R(x',y')
If anyone has a better way i'd be glad to learn of it.
Fri, 26 Jan 2007, Richard Heck wrote:
> As said.
> (1) Consider a very simple branching structure
> Every such formula is clearly \Delta^1_1. Is it also the case that every
> \Delta^1_1 formula is equivalent to some such simple branching formula? If
> not, what is the strength of a system (semantically characterized, for now)
> admitting comprehension for such formulae?
> (2) Does anyone know a good way to do branching quantifiers in LaTeX?
> Richard Heck
www.dpmms.cam.ac.uk/~tf; Home phone +44-1223-704452.
work: +44-1223-337981. Mobile in UK +44-7887-701-562
More information about the FOM