Register

TestBook Lattice question

• retagged by
728 views
0 0 votes

Consider the relation R = {(p, p), (p, q), (p, r), (p, s), (p, t), (q, q,) (q, s), (q, t), (s, s), (s, t), (r, r), (r, t), (t ,t) which is a subset of A × A where A  = {p, q, r, s, t} then which of the following is/are true?

  • 1

    (A, R) is a Boolean Algebra

  • 2

    (A, R) is a complemented lattice

  • 3

    (A, R) is distributed lattice

  • 4

    (A, R) is not a lattice

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Testbook set theory ...Next → · when i make excitati...
← Previous in category · Testbook set theory ...Next in category → · Testbook poset quest...
Position:
Show:

Related questions

1 1 vote
1 1 answer
1.5k
1.5k views
pC asked Jun 22, 2016
1,543 views
Lattice | Boolean Albegra
Need IN Depth Explanation for each option POSET [ A ; <= ] is a) Bounded Lattics b) Distributive Lattice c) Complemented Lattice d) Boolean Algebra POSET [ P(A) ; $...
5 5 votes
3 3 answers
5.3k
5.3k views
amarVashishth asked Nov 11, 2015
5,254 views
Boolean Algebra
Consider a Hasse Diagram for a Boolean Algebra of Order 3What can we comment about it? How is it successfully able to represent the Boolean Algebra System?Is there an eas...
0 0 votes
0 0 answers
1.8k
1.8k views
Nidhi Budhraja asked Aug 22, 2018
1,756 views
Boolean Algebra Lattice Discrete Mathematics
Boolean algebra is a bounded distributed complemented lattice, also lattice is a poset thus it satisfies reflexive , antisymmetric and transitive properties. Does Boolean...
2 2 votes
1 1 answer
1.0k
1.0k views
GO Classes asked May 12, 2022
1,039 views
GO Classes Weekly Quiz 10 | Discrete Mathematics | Set Theory, Mathematical Logic, Lattice | Question: 6
Let $[N, \leq ]$ is a partial order relation defined on natural numbers, where “$\leq$” is the “less than equal to” relation defined on $N = \{ 0,1,2,3,\dots \}.$ Which o...