The following pages link to (Q4339021):
Displaying 14 items.
- Passive induction and a solution to a Paris-Wilkie open question (Q882120) (← links)
- Keeping logic in the trivium of computer science: a teaching perspective (Q1696593) (← links)
- The Matiyasevich theorem. Preliminaries (Q1795565) (← links)
- Diophantine sets. Preliminaries (Q1796771) (← links)
- When is a schema not a schema? On a remark by Suszko (Q2307299) (← links)
- Basic Diophantine relations (Q2311525) (← links)
- Diophantine sets. II (Q2337339) (← links)
- Formalization of the MRDP theorem in the Mizar system (Q2337340) (← links)
- A generalization of the second incompleteness theorem and some exceptions to it (Q2500470) (← links)
- On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos (Q2910986) (← links)
- (Q3220545) (← links)
- Restricted polynomial induction versus ordinary induction (Q4565103) (← links)
- Restricted polynomial induction versus parameter free ordinary induction (Q5066172) (← links)
- Rasiowa–Sikorski Sets and Forcing (Q5214735) (← links)
