Master Beth Tableaux: A Beginner's Guide

  • Thread starter Thread starter EvLer
  • Start date Start date
  • Tags Tags
    Master
AI Thread Summary
Practicing with Beth Tableaux can be challenging for beginners due to a lack of accessible resources. The discussion highlights the importance of understanding semantic tableaux, also known as truth trees, and suggests using alternative names in searches for better results. A recommended resource is a link that provides explanations and examples relevant to the topic. For practice, users can create their own problems based on arguments from their textbooks or the provided link. Key tips include focusing on when to branch in tableaux and converting implications to disjunctions for easier construction.
EvLer
Messages
454
Reaction score
0
Hello,
can anyone recommend a good source on practicing with Beth Tableaux? It is an interesting idea, but my textbook does not contain a whole lot about it.
I tried googling but it does not produce anything helpful, most of the stuff is too advanced for me.
Is it still generally applicable?
Thanks in advance.
 
Physics news on Phys.org
Are you also studying semantic tableaux or truth trees or something like that- it's called different things? The one not so clear explanation google turned up sounds very similar. You can find an explanation of what I'm talking about here:
http://tellerprimer.ucdavis.edu/1ch8.pdf
If that is the same thing, you can find plenty more examples. Just try the other names- truth trees, semantic tableaux.

Edit: Actually, are you just looking for practice problems? If so, you can just make up your own :) , use the arguments in your book, or there are several in the link above.
 
Last edited by a moderator:
Yeah, the link discusses the same idea. I am going through the book on my own, so I wasn't sure about other names. I'll search for that.
Thanks a lot!
 
Sure. Do you understand how it works- why you negate the conclusion and such?

As far as constructing the tableaux, the hardest thing to keep straight is when to branch and when not to branch. I never bothered to learn all of the rules for whether to branch or not, because you only need two of them: For a disjunction, branch; For a conjunction or literal, don't branch. I just convert all of my propositions to disjunctions or conjunctions first, then construct the tableaux.
For example, you should already know that (P -> Q) <=> (~P v Q). So instead of learning the rule for implications, you can just learn the rule for disjunctions and convert your implications to disjunctions before you add them to the tableaux. Make sense?
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top