Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

if F , G are two propostional formulas , h[f] is the height of the formula f ,

then h[ G a F ] is less or equal to sup( h[F] , h[G] ) + 1 , a is one of the connectives , my question is , what is sup ??? and how to compute sup ?!!

share|improve this question

2 Answers 2

up vote 2 down vote accepted

$\sup$ is most likely the supremum:

In mathematics, the supremum (sup) of a subset S of a totally or partially ordered set T is the least element of T that is greater than or equal to all elements of S. Consequently, the supremum is also referred to as the least upper bound (lub or LUB). If the supremum exists, it is unique meaning that there will be only one supremum. If S contains a greatest element, then that element is the supremum; otherwise, the supremum does not belong to S (or does not exist). For instance, the negative real numbers do not have a greatest element, and their supremum is 0 (which is not a negative real number).

As André Nicolas already mentioned, there is no difference between the maximum and the supremum given that the formulas whose height you need to compute are of finite length. Infinitary logic, however, admits formulas of infinite height.

share|improve this answer
    
thank you very much :) , i use text " mathematical logic : a course with exercises part 1 " by rene cori and lascar .. it would be better if he used max instead of sup ! –  Maths Lover Jan 17 '13 at 18:09

The term $\sup$ stands for supremum. For finite sets, it coincides with $\max$, the maximum. So for example $\sup(3,7)=7$, and $\sup(4,4)=4$. It is surprising that $\sup$ was used instead of the more common $\max$.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.