Question

By using laws of algebra of statements show that p or (p and q) is equivalent to p .

score 332 · Answer 1 · 2026-03-31 18:04:26

332

Views

By using laws of algebra of statements show that p or (p and q) is equivalent to p .

Published on 31 Mar 2026 - 18:04

score 401 · Answer 2 · 2020-04-18 12:48:37

401

Views

Only if at the middle of a sentence vs only if at the start of a sentence

Published on 18 Apr 2020 - 12:48

score 506 · Answer 3 · 2026-03-25 06:12:17

506

Views

How to use a Semantic Tableau to show satisfiable and falsifiable

Published on 25 Mar 2026 - 6:12

score 384 · Answer 4 · 2020-04-19 03:49:34

384

Views

$(r \wedge \neg s) \rightarrow \neg q$

Published on 19 Apr 2020 - 3:49

score 617 · Answer 5 · 2026-03-25 06:09:27

617

Views

Issue proving a Formula to be Valid using Semantic Tableau

Published on 25 Mar 2026 - 6:09

score 90 · Answer 6 · 2020-04-19 20:41:36

90

Views

Are there any strong forms of "clamped" induction?

Published on 19 Apr 2020 - 20:41

score 115 · Answer 7 · 2020-04-19 22:57:06

115

Views

$((\neg q\;\text{if}\;r)\text{unless}\;s)$ OR $(\neg q)\;\text{if}\;(r\;\text{unless}\; s)$

Published on 19 Apr 2020 - 22:57

score 158 · Answer 8 · 2026-03-28 11:35:20

158

Views

Length of the well formed formula $(((p_0)\rightarrow ((p_1)∧(p_{32}))) \rightarrow ((((p_{13})∧(p_6))∨(p_{317})) \rightarrow (p_{26})))$

Published on 28 Mar 2026 - 11:35

score 50 · Answer 9 · 2026-03-31 18:03:02

50

Views

How to solve system of equations (boolean algebra)?

Published on 31 Mar 2026 - 18:03

score 547 · Answer 10 · 2026-03-25 11:08:39

547

Views

Convert $A⟺B⟺C$ into Conjunctive Normal Form.

Published on 25 Mar 2026 - 11:08

score 207 · Answer 11 · 2020-04-20 20:09:06

207

Views

Semantical and syntactical derivation notation

Published on 20 Apr 2020 - 20:09

score 123 · Answer 12 · 2026-03-31 18:04:05

123

Views

Show functional completeness of $\{\nleftarrow, \sim\}$ (inhibition, negation) via structural induction

Published on 31 Mar 2026 - 18:04

score 705 · Answer 13 · 2026-03-31 20:53:10

705

Views

Represent the following sentences in first order logic.

Published on 31 Mar 2026 - 20:53

score 31 · Answer 14 · 2026-02-23 04:52:39

31

Views

Syntactical proof in a Hilbert system without additional lemmas

Published on 23 Feb 2026 - 4:52

score 2.8k · Answer 15 · 2026-03-26 17:44:34

2.8k

Views

Prove constructive dilemma without using additional assumptions

Published on 26 Mar 2026 - 17:44

List Question

By using laws of algebra of statements show that p or (p and q) is equivalent to p .

Only if at the middle of a sentence vs only if at the start of a sentence

How to use a Semantic Tableau to show satisfiable and falsifiable

$(r \wedge \neg s) \rightarrow \neg q$

Issue proving a Formula to be Valid using Semantic Tableau

Are there any strong forms of "clamped" induction?

$((\neg q\;\text{if}\;r)\text{unless}\;s)$ OR $(\neg q)\;\text{if}\;(r\;\text{unless}\; s)$

Length of the well formed formula $(((p_0)\rightarrow ((p_1)∧(p_{32}))) \rightarrow ((((p_{13})∧(p_6))∨(p_{317})) \rightarrow (p_{26})))$

How to solve system of equations (boolean algebra)?

Convert $A⟺B⟺C$ into Conjunctive Normal Form.

Semantical and syntactical derivation notation

Show functional completeness of $\{\nleftarrow, \sim\}$ (inhibition, negation) via structural induction

Represent the following sentences in first order logic.

Syntactical proof in a Hilbert system without additional lemmas

Prove constructive dilemma without using additional assumptions

Trending Questions

Popular # Hahtags

Popular Questions