Pawel Urzyczyn

Publication Activity (10 Years)

Years Active: 1981-2024
Publications (10 Years): 9

Top Topics

Intuitionistic Logic

Sequent Calculus

Answer Set Programming

Top Venues

ACM Trans. Comput. Log.

Publications

Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski
Between proof construction and SAT-solving. CoRR (2024)
Ken-etsu Fujita, Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski
The existential fragment of second-order propositional intuitionistic logic is undecidable. J. Appl. Non Class. Logics 34 (1) (2024)
Andrej Dudenhefner, Pawel Urzyczyn
Kripke Semantics for Intersection Formulas. ACM Trans. Comput. Log. 22 (3) (2021)
Pawel Urzyczyn
Duality in Intuitionistic Propositional Logic. TYPES (2020)
Aleksy Schubert, Pawel Urzyczyn
First-order Answer Set Programming as Constructive Proof Search. Theory Pract. Log. Program. 18 (3-4) (2018)
Aleksy Schubert, Pawel Urzyczyn
First-order answer set programming as constructive proof search. CoRR (2018)
Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski
On the Mints Hierarchy in First-Order Intuitionistic Logic. Log. Methods Comput. Sci. 12 (4) (2016)
Aleksy Schubert, Pawel Urzyczyn, Daria Walukiewicz-Chrzaszcz
How Hard Is Positive Quantification? ACM Trans. Comput. Log. 17 (4) (2016)
Pawel Urzyczyn
Intuitionistic Games: Determinacy, Completeness, and Normalization. Stud Logica 104 (5) (2016)
Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski
On the Mints Hierarchy in First-Order Intuitionistic Logic. FoSSaCS (2015)
Aleksy Schubert, Pawel Urzyczyn, Daria Walukiewicz-Chrzaszcz
Restricted Positive Quantification Is Not Elementary. TYPES (2014)
Boris Düdder, Oliver Garbe, Moritz Martens, Jakob Rehof, Pawel Urzyczyn
Using Inhabitation in Bounded Combinatory Logic with Intersection Types for Composition Synthesis. ITRS (2012)
Boris Düdder, Moritz Martens, Jakob Rehof, Pawel Urzyczyn
Bounded Combinatory Logic. CSL (2012)
Jakob Rehof, Pawel Urzyczyn
The Complexity of Inhabitation with Explicit Intersection. Logic and Program Semantics (2012)
Jakob Rehof, Pawel Urzyczyn
Finite Combinatory Logic with Intersection Types. TLCA (2011)
Morten Heine Sørensen, Pawel Urzyczyn
A Syntactic Embedding of Predicate Logic into Second-Order Propositional Logic. Notre Dame J. Formal Log. 51 (4) (2010)
Pawel Urzyczyn
The Logic of Persistent Intersection. Fundam. Informaticae 103 (1-4) (2010)
Anna Gambin, Damian Niwinski, Pawel Urzyczyn
Preface. Fundam. Informaticae 103 (1-4) (2010)
Pawel Urzyczyn
Inhabitation of Low-Rank Intersection Types. TLCA (2009)
Morten Heine Sørensen, Pawel Urzyczyn
Strong cut-elimination in sequent calculus using Klop's iota-translation and perpetual reductions. J. Symb. Log. 73 (3) (2008)
Agnieszka Kozubek, Pawel Urzyczyn
In the Search of a Naive Type Theory. TYPES (2007)
Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz
Unsafe Grammars and Panic Automata. ICALP (2005)
Martin Hofmann, Pawel Urzyczyn
Typed Lambda Calculi and Applications 2003, Selected Papers. Fundam. Informaticae 65 (1-2) (2005)
Pawel Urzyczyn
My (Un)Favourite Things. CSL (2004)
Pawel Urzyczyn
A Simple Proof of the Undecidability of Strong Normalisation. Math. Struct. Comput. Sci. 13 (1) (2003)
Viviana Bono, Jerzy Tiuryn, Pawel Urzyczyn
Type Inference for Nested Self Types. TYPES (2003)
Laurent Regnier, Pawel Urzyczyn
Retractions of Types with Many Atoms CoRR (2002)
Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
Higher-Order Pushdown Trees Are Easy. FoSSaCS (2002)
Jerzy Tiuryn, Pawel Urzyczyn
The Subtyping Problem for Second-Order Types Is Undecidable. Inf. Comput. 179 (1) (2002)
Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
Deciding Monadic Theories of Hyperalgebraic Trees. TLCA (2001)
A. J. Kfoury, Simona Ronchi Della Rocca, Jerzy Tiuryn, Pawel Urzyczyn
Alpha-Conversion and Typability. Inf. Comput. 150 (1) (1999)
Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn
Discrimination by Parallel Observers: The Algorithm. Inf. Comput. 150 (2) (1999)
Zdzislaw Splawski, Pawel Urzyczyn
Type Fixpoints: Iteration vs. Recursion. ICFP (1999)
Pawel Urzyczyn
The Emptiness Problem for Intersection Types. J. Symb. Log. 64 (3) (1999)
Pawel Urzyczyn
. Math. Struct. Comput. Sci. 7 (4) (1997)
Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn
Discrimination by Parallel Observers. LICS (1997)
Pawel Urzyczyn
Inhabitation in Typed Lambda-Calculi (A Syntactic Approach). TLCA (1997)
Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn
Comparing Cubes of Typed and Type Assignment Systems. Ann. Pure Appl. Log. 86 (3) (1997)
Pawel Urzyczyn
Positive Recursive Type Assignment. Fundam. Informaticae 28 (1-2) (1996)
Jerzy Tiuryn, Pawel Urzyczyn
The Subtyping Problem for Second-Order Types is Undecidable. LICS (1996)
Pawel Urzyczyn
Positive Recursive Type Assignment. MFCS (1995)
Pawel Urzyczyn
The Emptiness Problem for Intersection Types LICS (1994)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
An Analysis of ML Typability. J. ACM 41 (2) (1994)
Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn
Comparing Cubes. LFCS (1994)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
Type Reconstruction in the Presence of Polymorphic Recursion. ACM Trans. Program. Lang. Syst. 15 (2) (1993)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
The Undecidability of the Semi-unification Problem Inf. Comput. 102 (1) (1993)
Pawel Urzyczyn
Type reconstruction in F-omega is undecidable. TLCA (1993)
Pawel Urzyczyn
Primitive Recursion with Extential Types. Fundam. Informaticae 19 (1/2) (1993)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures. Theor. Comput. Sci. 93 (1) (1992)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
ML Typability is DEXTIME-Complete. CAAP (1990)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
The Undecidability of the Semi-Unification Problem (Preliminary Report) STOC (1990)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report) LICS (1989)
A. J. Kfoury, Pawel Urzyczyn
Algo-Like Languages with Higher-Order Procedures and Their Expressive Power. Logic at Botik (1989)
Jerzy Tiuryn, Pawel Urzyczyn
Some Relationships Between Logics of Programs and Complexity Theory. Theor. Comput. Sci. 60 (1988)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
A Proper Extension of ML with an Effective Type-Assignment. POPL (1988)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
On the Computational Power of Universally Polymorphic Recursion LICS (1988)
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
The Hierarchy of Finitely Typed Functional Programs (Short Version) LICS (1987)
Wojciech Kowalczyk, Pawel Urzyczyn
Verification of Programs with Higher-Order Arrays. FCT (1987)
Pawel Urzyczyn
"During" Cannot be Expressed by "After". J. Comput. Syst. Sci. 32 (1) (1986)
A. J. Kfoury, Pawel Urzyczyn
Necessary and Sufficient Conditions for the Universality of Programming Formalisms. Acta Informatica 22 (4) (1985)
Jerzy Tiuryn, Pawel Urzyczyn
Remarks on Comparing Expressive Power of Logics of Programs. MFCS (1984)
Pawel Urzyczyn
A Necessary and Sufficient Condition in Order That a Herbrand Interpretation Be Expressive Relative to Recursive Programs Inf. Control. 56 (3) (1983)
A. J. Kfoury, Pawel Urzyczyn
Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report). Logic of Programs (1983)
Jerzy Tiuryn, Pawel Urzyczyn
Some Relationships between Logics of Programs and Complexity Theory (Extended Abstract) FOCS (1983)
Pawel Urzyczyn
Nontrivial Definability by Flow-Chart Programs Inf. Control. 58 (1-3) (1983)
Pawel Urzyczyn
Deterministic Context-Free Dynamic Logic is More Expressive than Deterministic Dynamic Logic of Regular Programs. FCT (1983)
Pawel Urzyczyn
Algorithmic triviality of abstract structures. Fundam. Informaticae 4 (4) (1981)
Pawel Urzyczyn
The Unwind Property in Certain Algebras Inf. Control. 50 (2) (1981)