Obserwuj
Konrad Zdanowski
Konrad Zdanowski
Zweryfikowany adres z uksw.edu.pl
Tytuł
Cytowane przez
Cytowane przez
Rok
A tight lower bound for determinization of transition labeled Büchi automata
T Colcombet, K Zdanowski
International Colloquium on Automata, Languages, and Programming, 151-162, 2009
372009
Undecidability and concatenation
A Grzegorczyk, K Zdanowski
Andrzej Mostowski and foundational studies, 72-91, 2008
352008
Collapsing modular counting in bounded arithmetic and constant depth propositional proofs
S Buss, L Kołodziejczyk, K Zdanowski
Transactions of the American Mathematical Society 367 (11), 7517-7563, 2015
292015
Theories of arithmetics in finite models
M Krynicki, K Zdanowski
The Journal of Symbolic Logic 70 (1), 1-28, 2005
272005
The polish school of argumentation: A manifesto
K Budzynska, M Araszkiewicz, B Bogołȩbska, P Cap, T Ciecierski, ...
Argumentation 28 (3), 267-282, 2014
222014
FM-representability and beyond
M Mostowski, K Zdanowski
Conference on Computability in Europe, 358-367, 2005
202005
The intended model of arithmetic. an argument from Tennenbaum’s theorem
P Quinon12, K Zdanowski
Computation and logic in the real world, 313, 2007
192007
On the Mints hierarchy in first-order intuitionistic logic
A Schubert, P Urzyczyn, K Zdanowski
International Conference on Foundations of Software Science and Computation …, 2015
112015
On second order intuitionistic propositional logic without a universal quantifier
K Zdanowski
The Journal of Symbolic Logic 74 (1), 157-167, 2009
112009
Arithmetics in finite but potentially infinite worlds
K Zdanowski
PhD thesis, Warsaw University, 2005
102005
Coprimality in finite models
M Mostowski, K Zdanowski
International Workshop on Computer Science Logic, 263-275, 2005
92005
Lower bounds for the provability of Herbrand consistency in weak arithmetics
Z Adamowicz, K Zdanowski
Logical Approaches to Barriers in Computing and Complexity, 1, 2011
82011
New bounds on the strength of some restrictions of Hindman’s Theorem
L Carlucci, LA Kołodziejczyk, F Lepore, K Zdanowski
Conference on Computability in Europe, 210-220, 2017
72017
The strength of Ramsey’s Theorem for coloring relatively large sets
L Carlucci, K Zdanowski
The Journal of Symbolic Logic 79 (1), 89-102, 2014
72014
Theories of initial segments of standard models of arithmetics and their complete extensions
M Krynicki, J Tomasik, K Zdanowski
Theoretical Computer Science 412 (31), 3975-3991, 2011
72011
Finite arithmetics
M Krynicki, M Mostowski, K Zdanowski
Fundamenta Informaticae 81 (1-3), 183-202, 2007
62007
A modal logic of a truth definition for finite models
M Czarnecki, K Zdanowski
Fundamenta Informaticae 164 (4), 299-325, 2019
52019
On the Mints Hierarchy in First-Order Intuitionistic Logic
K Zdanowski, P Urzyczyn, A Schubert
Logical Methods in Computer Science 12, 2017
5*2017
Degrees of logics with Henkin quantifiers in poor vocabularies
M Mostowski, K Zdanowski
Archive for Mathematical Logic 43 (5), 691-702, 2004
52004
A note on ramsey theorems and turing jumps
L Carlucci, K Zdanowski
Conference on Computability in Europe, 89-95, 2012
32012
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20