Question

Is there an inference rule with premise neg X with neg X OR Y and conclusion Y?

score 39 · Answer 1 · 2018-05-31 23:30:17

39

Views

Is there an inference rule with premise neg X with neg X OR Y and conclusion Y?

Published on 31 May 2018 - 23:30

score 69 · Answer 2 · 2018-06-02 04:22:08

69

Views

What is "not needing modus ponens"?

Published on 02 Jun 2018 - 4:22

score 858 · Answer 3 · 2026-03-25 01:35:35

858

Views

How do I show that A iff B proves A implies B?

Published on 25 Mar 2026 - 1:35

score 28 · Answer 4 · 2018-06-08 02:07:05

28

Views

How would I do a derivation of this: ¬q→(q↔r), ¬q∧(p∨r) ⊢ p using inference rules?

Published on 08 Jun 2018 - 2:07

score 566 · Answer 5 · 2026-03-24 23:52:46

566

Views

Writing statements using logical connectives.

Published on 24 Mar 2026 - 23:52

score 1.4k · Answer 6 · 2018-06-10 01:53:08

1.4k

Views

Prove that $p$ and $q$ are logically equivalent if and only if $p\leftrightarrow q$ is a tautology.

Published on 10 Jun 2018 - 1:53

score 62 · Answer 7 · 2018-06-10 11:48:19

62

Views

Help with duality and recursive definitions

Published on 10 Jun 2018 - 11:48

score 566 · Answer 8 · 2018-06-10 16:45:33

566

Views

Expressive adequacy

Published on 10 Jun 2018 - 16:45

score 46 · Answer 9 · 2018-06-11 21:02:01

46

Views

Does $ (A \lor B \lor C \implies P)\land (\neg A \land \neg B \land P \implies C)$ imply $P\implies A \lor B \lor C$?

Published on 11 Jun 2018 - 21:02

score 197 · Answer 10 · 2026-03-25 20:36:40

197

Views

What is the advantage of Horn logic in comparision to predicate logic or proposition logic

Published on 25 Mar 2026 - 20:36

score 51 · Answer 11 · 2026-03-25 20:42:21

51

Views

Given the domain $S=\{0,1\}$, how to write $\forall x \, \exists y \, P(x, y)$ without quantifiers?

Published on 25 Mar 2026 - 20:42

score 64 · Answer 12 · 2026-03-24 23:54:04

64

Views

Positively confused about negation

Published on 24 Mar 2026 - 23:54

score 237 · Answer 13 · 2026-03-24 23:42:42

237

Views

Enumerate propositional formulas that are classically valid, but intuitionistically invalid

Published on 24 Mar 2026 - 23:42

score 1.1k · Answer 14 · 2026-03-26 19:58:52

1.1k

Views

Explaining the resolution rule.

Published on 26 Mar 2026 - 19:58

score 191 · Answer 15 · 2018-06-14 19:46:02

191

Views

Substituting statement form (well formed formula) for statement letter (propositional variable) in tautology

Published on 14 Jun 2018 - 19:46

List Question

Is there an inference rule with premise neg X with neg X OR Y and conclusion Y?

What is "not needing modus ponens"?

How do I show that A iff B proves A implies B?

How would I do a derivation of this: ¬q→(q↔r), ¬q∧(p∨r) ⊢ p using inference rules?

Writing statements using logical connectives.

Prove that $p$ and $q$ are logically equivalent if and only if $p\leftrightarrow q$ is a tautology.

Help with duality and recursive definitions

Expressive adequacy

Does $ (A \lor B \lor C \implies P)\land (\neg A \land \neg B \land P \implies C)$ imply $P\implies A \lor B \lor C$?

What is the advantage of Horn logic in comparision to predicate logic or proposition logic

Given the domain $S=\{0,1\}$, how to write $\forall x \, \exists y \, P(x, y)$ without quantifiers?

Positively confused about negation

Enumerate propositional formulas that are classically valid, but intuitionistically invalid

Explaining the resolution rule.

Substituting statement form (well formed formula) for statement letter (propositional variable) in tautology

Trending Questions

Popular # Hahtags

Popular Questions