Publications

Paweł Urzyczyn

Number of publications: 35

2021

• Paweł Urzyczyn , Duality in Intuitionistic Propositional Logic, 26th International Conference on Types for Proofs and Programs, Turyn, Italy, 2 March 2020 - 5 March 2020, 188 2021, p. 11:1--11:10. See in PBN
• Andrej Dudenhefner, Paweł Urzyczyn , Kripke Semantics for Intersection Formulas, ACM Transactions on Computational Logic, 22 (3) 2021, p. 1-16. See in PBN

2018

• Aleksy Schubert , Paweł Urzyczyn , Answer set programming in intuitionistic logic, Indagationes Mathematicae, 29 (1) 2018, p. 276-292. See in PBN
• Aleksy Schubert , Paweł Urzyczyn , First-order Answer Set Programming as Constructive Proof Search, Theory and Practice of Logic Programming, 34th International Conference on Logic Programming, Oxford, the United Kingdom of Great Britain and Northern Ireland, 14 July 2018 - 17 July 2018, 18 (3-4) 2018, p. 673-690. See in PBN

2017

• Aleksy Schubert , Paweł Urzyczyn , Konrad Zdanowski, On the Mints Hierarchy in First-Order Intuitionistic Logic, Logical Methods in Computer Science, 12 (4) 2017, p. 1-25. See in PBN

2016

• Aleksy Schubert , Paweł Urzyczyn , Daria Walukiewicz-Chrząszcz, How Hard Is Positive Quantification?, ACM Transactions on Computational Logic, 2016. See in PBN
• Paweł Urzyczyn , Intuitionistic Games: Determinacy, Completeness, and Normalization, Studia Logica, 2016. See in PBN

2015

• Aleksy Schubert , Paweł Urzyczyn , Konrad Zdanowski, On the Mints Hierarchy in First-Order Intuitionistic Logic, Foundations of Software Science and Computation Structures 18th International Conference, London, the United Kingdom of Great Britain and Northern Ireland, 11 April 2015 - 18 April 2015. See in PBN
• Aleksy Schubert , Paweł Urzyczyn , Daria Walukiewicz-Chrząszcz, Restricted Positive Quantification Is Not Elementary, 20th International Conference on Types for Proofs and Programs, TYPES 2014, Paryż, France, 12 May 2014 - 15 May 2014. See in PBN

2014

• Paweł Urzyczyn , Games for Intuitionistic Logic, 2014. See in PBN

2013

• Paweł Urzyczyn , Undecidability of inhabitation, 2013. See in PBN
• Boris Düdder, Oliver Garbe, Moritz Martens, Jakob Rehof, Paweł Urzyczyn , Using Inhabitation in Bounded Combinatory Logic with Intersection Typesfor Composition Synthesis, Electronic Proceedings in Theoretical Computer Science, Intersection Types and Related Systems, 2013. See in PBN

2012

• Boris Düdder, Moritz Martens, Jakob Rehof, Paweł Urzyczyn , Bounded Combinatory Logic, 2012. See in PBN
• Jakob Rehof, Paweł Urzyczyn , The Complexity of Inhabitation with Explicit Intersection, 2012. See in PBN

2011

• Jakob Rehof, Paweł Urzyczyn , Finite Combinatory Logic with Intersection Types, Lecture Notes in Computer Science, 2011. See in PBN

2010

• Morten Heine Sorensen, Paweł Urzyczyn , A Syntactic Embedding of Predicate Logic into Second-Order Propositional Logic, Notre Dame Journal of Formal Logic, 2010. See in PBN
• Anna Gambin , Damian Niwiński , Paweł Urzyczyn , Preface, Fundamenta Informaticae, 2010. See in PBN
• Paweł Urzyczyn , The Logic of Persistent Intersection, Fundamenta Informaticae, 2010. See in PBN

2009

• Paweł Urzyczyn , Inhabitation of Low-Rank Intersection Types, Lecture Notes in Computer Science, 2009. See in PBN

2008

• Agnieszka Kozubek, Paweł Urzyczyn , In the search of a naive type theory, Lecture Notes in Computer Science, 2008. See in PBN
• Morten Heine Soerensen, Paweł Urzyczyn , Strong cut-elimination in sequent calculus using Klop's iota-translation and perpetual reductions, Journal of Symbolic Logic, 2008. See in PBN

2007

• M. Sorensen, Paweł Urzyczyn , Sequent Calculus, Dialogues, and Cut-Elimination,, 2007. See in PBN
• Thorsten Altenkirch, Paweł Urzyczyn , Special Issue on the 7th International Conference on Typed Lambda Calculi and Applications, TLCA '05, 2007. See in PBN

2006

• M. Sorensen, Paweł Urzyczyn , Lectures on the Curry-Howard Isomorphism, 2006. See in PBN
• P. Kralovic, Paweł Urzyczyn , Mathematical Foundations of Computer Science 31st Int. Symposium, 2006. See in PBN
• Paweł Urzyczyn , Predicates as Types, 2006. See in PBN

2005

• Martin Hofmann, Paweł Urzyczyn , Typed Lambda Calculi and Applications 2003, Selected Papers, 2005. See in PBN
• Paweł Urzyczyn , Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, 2005. See in PBN
• Teodor Knapik, Damian Niwiński , Paweł Urzyczyn , Igor Walukiewicz, Unsafe Grammars and Panic Automata, Lecture Notes in Computer Science, 2005. See in PBN

2004

• Viviana Bono, Jerzy Tiuryn , Paweł Urzyczyn , Type inference for nested self types, Lecture Notes in Computer Science, 2004. See in PBN

2003

• Paweł Urzyczyn , A simple proof of undecidability of strong normalization, Mathematical Structures in Computer Science, 2003. See in PBN

2002

• Teodor Knapik, Damian Niwiński , Paweł Urzyczyn , Higher-order pushdown trees are easy, Lecture Notes in Computer Science, 2002. See in PBN
• Jerzy Tiuryn , Paweł Urzyczyn , The subtyping problem for second-order types is undecidable, Information and Computation, 2002. See in PBN

2001

• T. Knapik, Damian Niwiński , Paweł Urzyczyn , Deciding monadic theories of hyperalgebraic trees, Lecture Notes in Computer Science, 2001. See in PBN
• J. Girard, Paweł Urzyczyn , Special Issue of Fundamenta Informaticae, 2001. See in PBN