Pages that link to "Item:Q3476273"
From MaRDI portal
The following pages link to Nondeterministic polynomial-time computations and models of arithmetic (Q3476273):
Displaying 8 items.
- Construction of models of bounded arithmetic by restricted reduced powers (Q506954) (← links)
- \(\text{NP}\not={co}\)-NP and models of arithmetic (Q672454) (← links)
- P, NP, Co-NP and weak systems of arithmetic (Q672742) (← links)
- Polynomial time computations in models of ET (Q795035) (← links)
- Polynomial-time versus recursive models (Q1182471) (← links)
- Polynomial time uniformization and non-standard methods (Q1817062) (← links)
- On the metamathematics of the P vs. NP question (Q2383632) (← links)
- Sur le statut logique de l'assertion ``co-NP \(\neq\) NP''. (On the logical status of the ''co-NP \(\neq\) NP'' assertion) (Q3983716) (← links)
