It looks like you're new here. If you want to get involved, click one of these buttons!

- All Categories 2.4K
- Chat 505
- Study Groups 21
- Petri Nets 9
- Epidemiology 4
- Leaf Modeling 2
- Review Sections 9
- MIT 2020: Programming with Categories 51
- MIT 2020: Lectures 20
- MIT 2020: Exercises 25
- Baez ACT 2019: Online Course 339
- Baez ACT 2019: Lectures 79
- Baez ACT 2019: Exercises 149
- Baez ACT 2019: Chat 50
- UCR ACT Seminar 4
- General 75
- Azimuth Code Project 111
- Statistical methods 4
- Drafts 10
- Math Syntax Demos 15
- Wiki - Latest Changes 3
- Strategy 113
- Azimuth Project 1.1K
- - Spam 1
- News and Information 148
- Azimuth Blog 149
- - Conventions and Policies 21
- - Questions 43
- Azimuth Wiki 719

Options

Now that we're about to dip our toe into the sea of logic, it's good to do an exercise involving the **Booleans**:

$$ \mathbf{Bool} = \{ \textrm{true}, \textrm{false} \} . $$ This set becomes a poset where \(\textrm{false}\leq\textrm{false}\), \(\textrm{false}\leq\textrm{true}\), and \(\textrm{true}\leq\textrm{true}\), but \(\textrm{true}\not\leq\textrm{false}\). In other words \(A\leq B\) in the poset if \(A\) implies \(B\), often denoted \(A\implies B\).

In any poset \(A \vee B\) stands for the **join** of \(A\) and \(B\): the least element of the poset that is greater than both \(A\) and \(B\). The join may not exist, but it is unique.

In the poset \(\mathbb{B}\), what is

\(\textrm{true} \vee \textrm{false}\)?

\(\textrm{false} \vee \textrm{true}\)?

\(\textrm{true} \vee \textrm{true}\)?

\(\textrm{false} \vee \textrm{false}\)?

## Comments

This does not appear to be formatting correctly... try:

`\text{true}`

and`\text{false}`

?`This does not appear to be formatting correctly... try: <code>\text{true}</code> and <code>\text{false}</code>?`

Done.

`Done.`

We've been working out lots of "meets", or "least upper bounds", so it's good to emphasize that they don't always exist!

Puzzle 26.What is the simplest poset that contains two elements \(x\) and \(y\) that have no least upper bound?Puzzle 27.What is the simplest poset that contains a subset that has no least upper bound?`We've been working out lots of "meets", or "least upper bounds", so it's good to emphasize that they don't always exist! **Puzzle 26.** What is the simplest poset that contains two elements \\(x\\) and \\(y\\) that have no least upper bound? **Puzzle 27.** What is the simplest poset that contains a subset that has no least upper bound?`

Hi John Baez, where above you wrote \( A \vee B \) means the meet, did you mean, means the join?

`Hi [John Baez](https://forum.azimuthproject.org/profile/17/John%20Baez), where above you wrote \\( A \vee B \\) means the meet, did you mean, means the join?`

Yes, I meant "join", and I will fix this. I often mix up the words "meet" and "join" because in ordinary language the mean similar things. I find it easier to remember "greatest lower bound" and "least upper bound", or "inf" and "sup".

`Yes, I meant "join", and I will fix this. I often mix up the words "meet" and "join" because in ordinary language the mean similar things. I find it easier to remember "greatest lower bound" and "least upper bound", or "inf" and "sup".`

Re. #5 I always remember the Open Systems Interconnect layers as PuDiN TSPA.

Q. Are these mnemonics correct even if not useful?

`Re. #5 I always remember the Open Systems Interconnect layers as PuDiN TSPA. Q. Are these mnemonics correct even if not useful? * Meet up (^) and greatest intersect (MUAGI). * Join down (v) or least disjunct (JDOLD).`

Jim: the great

antimnemonicis this picture:The meet \(\wedge\) is at the bottom and the join \(\vee\) is at the top, exactly opposite from how their symbols look!

`Jim: the great _antimnemonic_ is this picture: <center><img src = "https://upload.wikimedia.org/wikipedia/commons/thumb/8/8b/Join_and_meet.svg/500px-Join_and_meet.svg.png"></center> The meet \\(\wedge\\) is at the bottom and the join \\(\vee\\) is at the top, exactly opposite from how their symbols look!`

Lol. :)

`Lol. :)`

For me it's mnemonic*; I think of the Meet (Join) symbol as pointing up (down) to the elements in the subset (and the up-arrow occurs twice in M, while the down-arrow is vaguely J-shaped).

*I hope this doesn't cancel w/ the anti-mnemonic; you should probably try to forget at least one of these:-)

`For me it's mnemonic*; I think of the Meet (Join) symbol as pointing up (down) to the elements in the subset (and the up-arrow occurs twice in M, while the down-arrow is vaguely J-shaped). *I hope this doesn't cancel w/ the anti-mnemonic; you should probably try to forget at least one of these:-)`

I think of it as diving crocodile and soaring crocodile. :)

`I think of it as diving crocodile and soaring crocodile. :)`