Let {A1, A2, A3, ... } be an infinite set of formulas in propositional logic. Assume that(adsbygoogle = window.adsbygoogle || []).push({});

for every valuation v there is some n (depending on v) such that v(An) = 1. Show

then that there is some fixed m with A1 [tex]\vee[/tex] A2 [tex]\vee[/tex] ... [tex]\vee[/tex] Am a tautology.

This is equivalent to showing that v(Ai) = 1 for at least one 1[tex]\leq[/tex]i[tex]\leq[/tex]m. But I'm not sure where to proceed from here.

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Infinite set, disjunction, and tautology

Loading...

Similar Threads - Infinite disjunction tautology | Date |
---|---|

I Problem with infinite decimal numbers? | Oct 23, 2017 |

I Can you calculate probability with infinite sets? | Aug 11, 2017 |

I Cardinality of the Power Series of an Infinite Set | Jul 9, 2017 |

A Formal axiom systems and the finite/infinite sets | Mar 1, 2017 |

Conjunctive/disjunctive normal form | Feb 14, 2011 |

**Physics Forums - The Fusion of Science and Community**