Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options answers only not deleted user 12705

Realizability is a collection of methods in proof theory used to study constructive proofs and extract additional information from them.

17 votes
Accepted

Kleene realizability in Peano arithmetic

$\let\T\mathrm\def\kr{\mathrel{\mathbf r}}$Let me first answer a slightly modified question: Proposition: For any sentence $\phi$, the following are equivalent: There exists $n\in\mathbb N$ such tha …
Emil Jeřábek's user avatar
7 votes
Accepted

What is the theory of statements with a provably *bounded* realizer (according to PA)?

$\let\T\mathrm\def\kr{\mathrel{\mathbf r}}\let\LOR\bigvee$The same argument as in my linked answer shows that $$T_2=\T{HA+ECT_0+MP+SWLEM},$$ where $$\T{SWLEM}=\{\neg\phi\lor\neg\neg\phi:\text{$\phi$ s …
Emil Jeřábek's user avatar