Skip to content
Carmelics
Topics
Thinkers
Changes
Contributors
Loading account…
Statements
321,452
Perspectives
108,905
Topics
42
Home
/
Original
/
inverse
See Original
Inverse View
It is not the case that If φ is an infinitary sentence, G(¬φ) need not be the strict dual of G(φ), so neither player may possess a winning strategy in either game.
?
Set your confidence on the premises below to see your aggregate.
Reasons For
1 perspective
Reason for
?
1.
Classical game duality holds structurally regardless of sentence complexity—negation always swaps win conditions symmetrically.
?
How convincing is this?
Think about whether this reason is strong or weak
2.
If G(φ) lacks a winning strategy, logical principles alone guarantee G(¬φ) cannot both lack one—excluding the middle.
?
How convincing is this?
Think about whether this reason is strong or weak
3.
The claim conflates semantic non-determinacy with game-theoretic indeterminacy, which requires separate justification entirely.
?
How convincing is this?
Think about whether this reason is strong or weak
Reasons Against
1 perspective
Reason against
?
1.
Infinitary sentences lack the recursive closure properties finite sentences possess, breaking standard duality assumptions.
?
How convincing is this?
Think about whether this reason is strong or weak
2.
Game trees for infinitary logic can be non-wellfounded, making traditional game-theoretic determinacy proofs inapplicable.
?
How convincing is this?
Think about whether this reason is strong or weak
3.
Neither player can guarantee winning via finite strategies when plays may require infinitely many moves to resolve truth-value.
?
How convincing is this?
Think about whether this reason is strong or weak
Next step
Based on where you are in your exploration
Strongest counterpoint
Explore the most compelling reason on the other side.