Pages that link to "Item:Q1849868"
From MaRDI portal
The following pages link to A model-theoretic characterization of the weak pigeonhole principle (Q1849868):
Displaying 12 items.
- Dual weak pigeonhole principle, Boolean complexity, and derandomization (Q1887654) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- Circuit principles and weak pigeonhole variants (Q2383589) (← links)
- Upper and lower Ramsey bounds in bounded arithmetic (Q2488271) (← links)
- Structures interpretable in models of bounded arithmetic (Q2570136) (← links)
- Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← links)
- FRAGMENTS OF APPROXIMATE COUNTING (Q2921008) (← links)
- Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
- The Ordering Principle in a Fragment of Approximate Counting (Q2946740) (← links)
- The polynomial and linear hierarchies in models where the weak pigeonhole principle fails (Q3503756) (← links)
- A note on the Σ<sub>1</sub>collection scheme and fragments of bounded arithmetic (Q3552388) (← links)
- Where pigeonhole principles meet Koenig lemmas (Q5158115) (← links)
