Question

Interpreting negation of quantifiers.

score 184 · Answer 1 · 2026-04-11 23:10:19

Interpreting negation of quantifiers.

Published on 11 Apr 2026 - 23:10

score 2.8k · Answer 2 · 2018-01-04 16:01:17

Use quantifiers and logical connectives to express the fact that a quadratic polynomial with real number coefficients has at most two real roots.

score 97 · Answer 3 · 2018-01-05 15:58:26

97

Views

(edited)$\mathrm{Dom}(R_1 \cup R_2) \subseteq \mathrm{Dom}(R_1) \cup \mathrm{Dom}(R_2)$?

Published on 05 Jan 2018 - 15:58

score 184 · Answer 4 · 2026-04-11 08:15:53

184

Views

Derivation of null-quantified implication.

Published on 11 Apr 2026 - 8:15

score 321 · Answer 5 · 2026-04-11 08:03:02

321

Views

Definition of universal generalization

Published on 11 Apr 2026 - 8:03

score 917 · Answer 6 · 2026-04-11 21:11:16

917

Views

Definition of substitution in FOL formulas

Published on 11 Apr 2026 - 21:11

score 574 · Answer 7 · 2026-04-11 08:00:37

574

Views

Predicate Form - Set Theory

Published on 11 Apr 2026 - 8:00

score 370 · Answer 8 · 2018-01-07 21:23:39

370

Views

A finite language with an infinite model but no finite ones

Published on 07 Jan 2018 - 21:23

score 686 · Answer 9 · 2018-01-07 22:07:33

686

Views

A set of sentences is satisfiable iff it has an infinite model

Published on 07 Jan 2018 - 22:07

score 77 · Answer 10 · 2018-01-08 12:42:09

77

Views

Can you show the validity of this by means of a derivation? $( \neg P \equiv \forall x Fx) \; \lor \; \exists x(Fx \equiv P)$

Published on 08 Jan 2018 - 12:42

score 104 · Answer 11 · 2026-03-25 13:57:00

104

Views

Show that there is a nonstandard model of the set of all sentences that are true under natural numbers

Published on 25 Mar 2026 - 13:57

score 275 · Answer 12 · 2018-01-08 14:50:35

275

Views

formal logical notation where to place for all

Published on 08 Jan 2018 - 14:50

score 498 · Answer 13 · 2026-04-09 08:05:43

498

Views

(First order logic) Proof with resolution rule

Published on 09 Apr 2026 - 8:05

score 48 · Answer 14 · 2026-04-12 00:51:10

48

Views

Is it possible to prove $\exists a(b + a = b) \vdash \exists a(a + a = a)$?

Published on 12 Apr 2026 - 0:51

score 106 · Answer 15 · 2018-01-09 14:54:22

106

Views

if $\forall x\forall y[P(x) \land P(y) \implies Q(x,y)]$ then prove that $\forall y \exists x[P(x)\land \lnot Q(x,y) \implies \lnot P(y)]$

Published on 09 Jan 2018 - 14:54

List Question

Interpreting negation of quantifiers.

Use quantifiers and logical connectives to express the fact that a quadratic polynomial with real number coefficients has at most two real roots.

(edited)$\mathrm{Dom}(R_1 \cup R_2) \subseteq \mathrm{Dom}(R_1) \cup \mathrm{Dom}(R_2)$?

Derivation of null-quantified implication.

Definition of universal generalization

Definition of substitution in FOL formulas

Predicate Form - Set Theory

A finite language with an infinite model but no finite ones

A set of sentences is satisfiable iff it has an infinite model

Can you show the validity of this by means of a derivation? $( \neg P \equiv \forall x Fx) \; \lor \; \exists x(Fx \equiv P)$

Show that there is a nonstandard model of the set of all sentences that are true under natural numbers

formal logical notation where to place for all

(First order logic) Proof with resolution rule

Is it possible to prove $\exists a(b + a = b) \vdash \exists a(a + a = a)$?

if $\forall x\forall y[P(x) \land P(y) \implies Q(x,y)]$ then prove that $\forall y \exists x[P(x)\land \lnot Q(x,y) \implies \lnot P(y)]$

Trending Questions

Popular # Hahtags

Popular Questions