/sqt/ - Stupid questions thread
Ask your stupid questions here if you think they don't deserve their own thread or you're just too lazy to google them.
Don't bump your question, you are not entitled to an answer.
Refer stupid questions outside this thread here.
>>>/g/sqtI need help with Logic edition
I'm supposed to prove that every positive logical formula (i.e. a formula that only contains "and" and "or" junctions, e.g. "A and B or C", but not "not A") is always satisfiable. I'm supposed to use induction.
I do not have a problem with induction at all. But I have no idea how to prove that a formula is satisfiable.
The first step of the induction would be to show that an atomic formula, let's say A, is satisfiable. Then i show that A or B, and A and B are also satisfiable. But i can't make that claim out of thin air. How do I prove a formula is satisfiable?