The following pages link to Konrad Zdanowski (Q549717):
Displaying 14 items.
- Theories of initial segments of standard models of arithmetics and their complete extensions (Q549718) (← links)
- Degrees of logics with Henkin quantifiers in poor vocabularies (Q1882566) (← links)
- New bounds on the strength of some restrictions of Hindman's theorem (Q2011655) (← links)
- On efficiency of notations for natural numbers (Q2143116) (← links)
- A Note on Ramsey Theorems and Turing Jumps (Q2904397) (← links)
- THE STRENGTH OF RAMSEY’S THEOREM FOR COLORING RELATIVELY LARGE SETS (Q2921021) (← links)
- Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
- Lower and upper bounds for the provability of Herbrand consistency in weak arithmetics (Q3083669) (← links)
- Theories of arithmetics in finite models (Q3370752) (← links)
- (Q3509164) (← links)
- On second order intuitionistic propositional logic without a universal quantifier (Q3616347) (← links)
- On a question of Andreas Weiermann (Q3619872) (← links)
- A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata (Q3638092) (← links)
- Truth definition for $\Delta _ 0$ formulas and PSPACE computations (Q5146427) (← links)
