Skip to main content
Erfan Khaniki's user avatar
Erfan Khaniki's user avatar
Erfan Khaniki's user avatar
Erfan Khaniki
  • Member for 8 years, 7 months
  • Last seen more than 1 year ago
  • Tehran, Iran
12 votes
1 answer
682 views

Intutionistic Robinson Arithmetic

10 votes
0 answers
261 views

Collapsing the Linear Time Hierarchy and finite axiomatizability of bounded arithmetic

10 votes
1 answer
364 views

Complexity of induction formulas in proof theoretic ordinals

8 votes
1 answer
360 views

Forcing in Constructive Set Theories

8 votes
0 answers
196 views

Kripke models of $HA$

8 votes
0 answers
135 views

Does every model of $I\Delta_0$ has an end extension to a model of $I\Delta_0+\Omega_1$?

7 votes
2 answers
232 views

On models of $Th_{\Pi_2}(PA)$

7 votes
2 answers
241 views

Measure of the numbers with length of $n$ for a nonstandard number $n$

6 votes
0 answers
194 views

Complexity of defining prime numbers [duplicate]

6 votes
1 answer
169 views

Logical complexity of hard functions conjectures

5 votes
0 answers
104 views

Collapsing the Exponential time Hierarchy with a complete language as oracle

5 votes
0 answers
125 views

Collapsing the Intuitionistic Bounded Arithmetics Hierarchy

4 votes
1 answer
284 views

Weak Bounded Arithmetics

4 votes
0 answers
219 views

Construction of model of arithmetic from an arbitrary model

4 votes
3 answers
353 views

End Extension models of $I\Delta_0$

3 votes
0 answers
63 views

Equational theory for resolution proof system

3 votes
0 answers
185 views

Reducing Consistency of $PA$ [closed]

3 votes
1 answer
122 views

On subtheories of $\mathsf{T_2+EXP}$

2 votes
0 answers
192 views

$P=NP$ and provability of family of propositional formulas

2 votes
1 answer
215 views

Bounded Arithmetic and Counting

2 votes
0 answers
89 views

Recursion theoretical Characterization of time complexity classes

1 vote
0 answers
87 views

models of $I\exists^+_1$

1 vote
0 answers
111 views

Is there any standard name for Provably Decidable Set?