利用谓词的约束变元的换名规则和自由变元的代入规则，可将公式改写成______． A: (x)(P(y)→Q(x，y))∧R(z，s) B: (z)(P(z)→Q(z，s))∧R(x，s) C: (x)(P(s)→Q(x，s))∧R(x，s) D: (z)(P(s)→Q(z，s))∧R(z，s)

对公式∀x∀y(P(x,y)∨Q(x,z))∧∃xP(x,y)使用代入和换名规则后得到的公式为( )。 A: ∀u∀y(P(u,y)∨Q(u,z))∧∃wP(w,s) B: ∀x∀u(P(x,u)∨Q(x,z))∧∃xP(x,y) C: ∀x∀y(P(x,y)∨Q(x,u))∧∃xP(x,s) D: ∀x∀y(P(x,y)∨Q(x,z))∧∃uP(u,z)

【单选题】公式(∀x)[P(x)∧Q(x, A) →(∃y)[R(x, y)∨S(y)]]中，∀x的辖域为 , ∃y的辖域为 。 A. P(x); R(x, y) B. P(x)∧Q(x, A); R(x, y) C. P(x)∧Q(x, A)→(∃y)[R(x, y)∨S(y)]; R(x, y) D. P(x)∧Q(x, A)→(∃y)[R(x, y)∨S(y)]; R(x, y)∨S(y)

在一个双链表中,在* $p$ 结点之后插入一个结点*s 的操作是[input=type:blank,size:4][/input]。 A: s-> prior =p ; p->n e x t=s ; p-> next -> prior =s ; s->n e x t=p-> next s -> next = p -> next ； B: p -> next -> prior = s ; p -> next = s ; s \rightarrow> prior = p C: p -> next = s ; s \rightarrow> prior = p ; s -> next = p -> next ; p -> next -> prior = s ; D: p -> next -> prior = s ; s -> next = p -> next ; s \rightarrow prior = p ; p -> next = s

设个体域A={a,b}，公式"任意xP(x)在A中消去量词后应为（ ） 未知类型：{'options': ['P(b)', 'P(a)[img=20x24]17da6cc8e4430a9.jpg[/img]P(b)', 'P(a)', 'P(a)[img=20x23]17da6cc8f0bd30c.jpg[/img]P(b)'], 'type': 102}