1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Logic symbols help pleeease

  1. Oct 17, 2005 #1
    Hi, new here but I see the people are very helpful, hoping I can take advantage of that.

    Does anyone recognize the symbols ⊃, ≡, |, |–, –||–, |=, =||= ??
    They are logical connectives, just different than the ones I know.

    Help would be greatly appreciated as soon as possible.

    Thank you.
     
  2. jcsd
  3. Oct 17, 2005 #2

    EnumaElish

    User Avatar
    Science Advisor
    Homework Helper

    ⊃ is superset
    ≡ is identical or equivalent
    I don't have a clue about the rest.
     
  4. Oct 17, 2005 #3
    thanks man, anyone else have ideas about the rest?
     
  5. Oct 17, 2005 #4

    AKG

    User Avatar
    Science Advisor
    Homework Helper

    The first one is not superset. Well it can be, but in a logical context, it is the horseshoe symbol, and stands for implication. Normally, if you're doing math or something like that, you'll use an arrow, but it's the same thing. The second one is material equivalence. Again, it is a logical connective so it relates sentences only. It is also used to mean other things in other contexts, but in logic, it means that if you have P = Q, then P and Q have the same truth value. The fourth symbol is what some books call "deductive entailment." If you have a set of sentences S and a sentence P, then S |- P means that given a deduction system (i.e. after specifying your logical axioms and rules of inference), you can derive the sentence P from the sentences in S. S |= P is something you might call "semantic entailment." If you're dealing strictly with propositional logic, you might call it "truth-functional entailment" and if you are dealing with predicate logic, you might call it "quantificational entailment." The last two definitions both mean "semantic entailment", but the semantics of propositional logic (logic where you just deal with logic connectives like OR, AND, IMPLIES, NOT, etc.) is different from the semantics of predicate logic (which include quantifiers like "for all x" and predicates). So S |= P means that for any interpretation that each sentence S is true, the sentence P is true.

    The single turnstyle "|-" has to do with syntax. It has nothing to do, essentially, with what your sentences mean. Just stipulate a set of rules for manipulating symbols, and if you have some sentences S, where each sentence is just a string of symbols that adhere to some rules as to what counts as a proper string of symbols, then if you manipulate these sentences according to the rules, you can get another string of symbols P, and you can say S |- P. The double turnstyle has to do with semantics. You choose some way of interpreting your strings of symbols. Some symbols have a standard interpretation, like the logical connectives. But if you have a sentence P & Q, then P and Q can be interpreted to mean just about any English sentence you want, but regardless of what you choose them to mean, if P & Q is true, then P will be true, so {P & Q} |= P. So, giving "P & Q" whatever meaning you want with the condition that P stands for some sentence and & stands for "and," but otherwise having total freedom to choose a meaning, whenever your interpretation makes P & Q true, it must make P true.

    Note: the first two symbols are logical symbols, the rest (well I'm not sure about "|") are 'metalogical' symbols. So if p and q are sentences of your language, p -> q and p = q are also sentences of your language. p |- q and p |= q are not sentences of your language, they are metalogical sentences about sentences in your language.

    I've never seen -||- or =||= before, but I can guess that if you have P -||- Q then it just means P |- Q and Q |- P. That is P is derivable from Q and vice versa. In this case, we say that Q and P are deductively equivalent. Similarly, if you have P =||= Q, then P |= Q and Q |= P, so you would say that P and Q are truth-functionally equiavlent or quantificationally equivalent, depending on the context.

    Still not sure about the "|".
     
  6. Oct 17, 2005 #5
    ⊃ is usually implication, so (P ⊃ Q) means "if P then Q".

    ≡ is usually syntactic equivalence.

    |- is usually inference.

    |= has a different meaning depending on the context. For example, A |= B could mean B is a logical consequence of A, or structure A satisfies B.

    I am not sure about the others.
     
    Last edited: Oct 17, 2005
  7. Oct 17, 2005 #6
    wow, again impressed with the helpfulness of this site.
    Thanks so much you guys, I am extremely grateful.
     
  8. Oct 20, 2005 #7
    |- is inference. It belongs to the category of prepositional logic or predicate logic of the basicl logic symbols. It means 'infers or is derived from' as in x ⊢ y means y is derived from x. Example: A → B ⊢ ¬B → ¬A
     
  9. Oct 20, 2005 #8

    honestrosewater

    User Avatar
    Gold Member

    "|" could be Sheffer's stroke. (Notice that it can be used to define negation, conjunction, disjunction, and implication, so you can use it as your only connective.) Sheffer's stroke would usually be one of AKG's logical symbols, along with the other connectives.

    An extra note on the meta thing: There's an important difference between the object language (the language that you talk about) and the metalanguage (the language that you use to talk about the object language). All of the symbols that you use are symbols of the metalanguage. Additionally, some of them denote symbols of the object language. However, they are not necessarily symbols of the object language -- the object language doesn't necessarily have a written form.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?



Similar Discussions: Logic symbols help pleeease
  1. Symbolic Logic help (Replies: 0)

Loading...