2,122 reputation
427
bio website
location
age
visits member for 2 years, 8 months
seen Jan 6 at 21:50

(your about me is currently blank)


Feb
23
awarded  Popular Question
Jan
29
awarded  Notable Question
Nov
28
awarded  Popular Question
Aug
20
awarded  Yearling
Aug
3
comment Logic - prove/refute claims using assignments
$A \vdash _{FOL=}^t B$ means that for every struct $M$ and assignment $v$ such that $ M,v \models A $ so does $ M,v \models B $. $A \vdash _{FOL=}^v B$ means that for every struct such that for all the assignments under its scope $ M,v \models A $ (OR: $ M \models A $) also this struct implies $ M \models B $.
Aug
3
asked Logic - prove/refute claims using assignments
Aug
3
accepted If $ \forall A $ Logic Equivalent to $\forall B$ so $A$ is t-Equivalent to $B$
Aug
2
asked If $ \forall A $ Logic Equivalent to $\forall B$ so $A$ is t-Equivalent to $B$
Jun
4
accepted Prove by Hilbert deduction: $\vdash _{HFOL} \forall x (\neg(A \to \bar{B}))\to \neg(\forall xA \to \neg(\forall xB))$
May
27
comment Prove by Hilbert deduction: $\vdash _{HFOL} \forall x (\neg(A \to \bar{B}))\to \neg(\forall xA \to \neg(\forall xB))$
@mercio: yes, it is.
May
25
asked Prove by Hilbert deduction: $\vdash _{HFOL} \forall x (\neg(A \to \bar{B}))\to \neg(\forall xA \to \neg(\forall xB))$
May
13
awarded  Caucus
Apr
24
awarded  Popular Question
Apr
19
awarded  Popular Question
Apr
12
accepted Prove: $(A\rightarrow B),(A\rightarrow C)\rightarrow B, \mapsto_{HPC} B $
Mar
21
asked Prove: $(A\rightarrow B),(A\rightarrow C)\rightarrow B, \mapsto_{HPC} B $
Feb
24
awarded  Nice Question
Dec
14
awarded  Popular Question
Sep
21
awarded  Custodian
Sep
4
accepted Computable function and decidable sets: For a computable $g$ and decidable set $A$ , Does $g(A), g^{-1}(A)$ necessarily decidable?