Konrad Zdanowski

Available identifiers

zbMath Open zdanowski.konradWikidataQ102355990 ScholiaQ102355990MaRDI QIDQ549717

List of research outcomes

Publication	Date of Publication	Type
The existential fragment of second-order propositional intuitionistic logic is undecidable	2024-03-20	Paper
On efficiency of notations for natural numbers	2022-05-31	Paper
Truth definition for \(\Delta_0\) formulas and PSPACE computations	2021-01-25	Paper
New bounds on the strength of some restrictions of Hindman’s Theorem	2020-11-09	Paper
A modal logic of a truth definition for finite models	2019-05-24	Paper
One Henkin quantifier in the empty vocabulary suffices for undecidability	2019-05-24	Paper
New bounds on the strength of some restrictions of Hindman's theorem	2017-08-04	Paper
On the Mints hierarchy in first-order intuitionistic logic	2017-04-11	Paper
Second order intuitionistic propositional logic of the real line is decidable	2016-12-21	Paper
On the Mints hierarchy in first-order intuitionistic logic	2015-10-01	Paper
Collapsing modular counting in bounded arithmetic and constant depth propositional proofs	2015-09-08	Paper
The strength of Ramsey's theorem for coloring relatively large sets	2014-09-30	Paper
A note on Ramsey theorems and Turing jumps	2012-08-14	Paper
Theories of initial segments of standard models of arithmetics and their complete extensions	2011-07-18	Paper
Lower and upper bounds for the provability of Herbrand consistency in weak arithmetics	2011-03-22	Paper
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata	2009-07-14	Paper
On a question of Andreas Weiermann	2009-04-09	Paper
On second order intuitionistic propositional logic without a universal quantifier	2009-03-25	Paper
https://portal.mardi4nfdi.de/entity/Q3509164	2008-07-01	Paper
https://portal.mardi4nfdi.de/entity/Q5445166	2008-03-03	Paper
Computer Science Logic	2006-11-01	Paper
Theories of arithmetics in finite models	2006-02-08	Paper
New Computational Paradigms	2006-01-11	Paper
Degrees of logics with Henkin quantifiers in poor vocabularies	2004-10-01	Paper
Reductions of well-ordering principles to combinatorial theorems	N/A	Paper

Research outcomes over time

This page was built for person: Konrad Zdanowski