Classes of truth tables

  1. Philosophy Forum
  2. » Logic
  3. » Classes of truth tables

Get Email Updates Email this Topic Print this Page

Arjen
 
Reply Fri 3 Oct, 2008 12:19 pm
Hi guys,

I think that the truth tables could be 'devided into certain classes' (so to speak):

1) tautology
2) contingency
3) contradiction
4) logical equivalence

Am I forgetting something?
 
VideCorSpoon
 
Reply Fri 3 Oct, 2008 12:33 pm
@Arjen,
Are you talking about base suppositions about truth tables or truth tables in themselves. What I mean is, are the classes you list (i.e. tautology, etc.) master categories of the established rules (i.e. conjunction, disjunction, etc.)

like instead of taking the basic truth tables as is, you suppose there is a grander scale. so instead of saying;

* conjunction
* disjunction
* conditional
* biconditional

you would suppose that these would come after the classifications you list (i.e tautology, etc.) so it would looks something like this (the x means one of the classifications you suppose)

* (x) -- > conjunction
* (x) -- > disjunction
* (x) -- > conditional
* (x) -- > biconditional

More elaboration please!
 
Arjen
 
Reply Sat 4 Oct, 2008 02:47 am
@VideCorSpoon,
Well, grander might not be the right word for it. Allow me to show what I'm referring to:http://img205.imageshack.us/img205/8780/logischequivalentnu7.pnghttp://img258.imageshack.us/img258/3381/tautologiesb8.pnghttp://img509.imageshack.us/img509/9050/contradictionak0.pnghttp://img143.imageshack.us/img143/8886/contingentrl7.png
Definition:
A formula A is a contingency if and only if $(a)=0 and $(a)=1.




I was wondering if there are more that I know nothing about.

Smile
 
Zetetic11235
 
Reply Mon 6 Oct, 2008 10:59 am
@Arjen,
There are logics which take certain chains as axioms or patently valid by the axioms, but it is not really pertinent to logic to root through the infinite possible predicates to try to create groups of patently valid, invalid and contingent lines, since you quickly end up getting diminishing returns. Those predicates which turn up most often are generally considered patently valid or invalid or contingent and they generally suffice under ordinary cirumstances. In some very rare cases where one must find the truth table of a very laborious predicate sentence, one just has to crank through using the atoms and identifying patently valid or invalid pieces to shorten up the process.

I think the sort of project that you are proposing would be more suited to formal ontology.
 
Arjen
 
Reply Fri 10 Oct, 2008 02:42 am
@Zetetic11235,
What project am I proposing?
 
 

 
  1. Philosophy Forum
  2. » Logic
  3. » Classes of truth tables
Copyright © 2020 MadLab, LLC :: Terms of Service :: Privacy Policy :: Page generated in 0.02 seconds on 08/12/2020 at 07:03:54