default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPawel Urzyczyn
Person information
- affiliation: University of Warsaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]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): 55-74 (2024)- [i3]Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski:
Between proof construction and SAT-solving. CoRR abs/2405.05670 (2024) - 2021
- [j30]Andrej Dudenhefner, Pawel Urzyczyn:
Kripke Semantics for Intersection Formulas. ACM Trans. Comput. Log. 22(3): 15:1-15:16 (2021) - 2020
- [c34]Pawel Urzyczyn:
Duality in Intuitionistic Propositional Logic. TYPES 2020: 11:1-11:10
2010 – 2019
- 2018
- [j29]Aleksy Schubert, Pawel Urzyczyn:
First-order Answer Set Programming as Constructive Proof Search. Theory Pract. Log. Program. 18(3-4): 673-690 (2018) - [i2]Aleksy Schubert, Pawel Urzyczyn:
First-order answer set programming as constructive proof search. CoRR abs/1804.10004 (2018) - 2016
- [j28]Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski:
On the Mints Hierarchy in First-Order Intuitionistic Logic. Log. Methods Comput. Sci. 12(4) (2016) - [j27]Pawel Urzyczyn:
Intuitionistic Games: Determinacy, Completeness, and Normalization. Stud Logica 104(5): 957-1001 (2016) - [j26]Aleksy Schubert, Pawel Urzyczyn, Daria Walukiewicz-Chrzaszcz:
How Hard Is Positive Quantification? ACM Trans. Comput. Log. 17(4): 30 (2016) - 2015
- [c33]Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski:
On the Mints Hierarchy in First-Order Intuitionistic Logic. FoSSaCS 2015: 451-465 - 2014
- [c32]Aleksy Schubert, Pawel Urzyczyn, Daria Walukiewicz-Chrzaszcz:
Restricted Positive Quantification Is Not Elementary. TYPES 2014: 251-273 - 2012
- [c31]Jakob Rehof, Pawel Urzyczyn:
The Complexity of Inhabitation with Explicit Intersection. Logic and Program Semantics 2012: 256-270 - [c30]Boris Düdder, Moritz Martens, Jakob Rehof, Pawel Urzyczyn:
Bounded Combinatory Logic. CSL 2012: 243-258 - [c29]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: 18-34 - 2011
- [c28]Jakob Rehof, Pawel Urzyczyn:
Finite Combinatory Logic with Intersection Types. TLCA 2011: 169-183 - 2010
- [j25]Anna Gambin, Damian Niwinski, Pawel Urzyczyn:
Preface. Fundam. Informaticae 103(1-4) (2010) - [j24]Pawel Urzyczyn:
The Logic of Persistent Intersection. Fundam. Informaticae 103(1-4): 303-322 (2010) - [j23]Morten Heine Sørensen, Pawel Urzyczyn:
A Syntactic Embedding of Predicate Logic into Second-Order Propositional Logic. Notre Dame J. Formal Log. 51(4): 457-473 (2010)
2000 – 2009
- 2009
- [c27]Pawel Urzyczyn:
Inhabitation of Low-Rank Intersection Types. TLCA 2009: 356-370 - 2008
- [j22]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): 919-932 (2008) - 2007
- [c26]Agnieszka Kozubek, Pawel Urzyczyn:
In the Search of a Naive Type Theory. TYPES 2007: 110-124 - 2006
- [e2]Rastislav Kralovic, Pawel Urzyczyn:
Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings. Lecture Notes in Computer Science 4162, Springer 2006, ISBN 3-540-37791-3 [contents] - 2005
- [j21]Martin Hofmann, Pawel Urzyczyn:
Typed Lambda Calculi and Applications 2003, Selected Papers. Fundam. Informaticae 65(1-2) (2005) - [c25]Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz:
Unsafe Grammars and Panic Automata. ICALP 2005: 1450-1461 - [e1]Pawel Urzyczyn:
Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings. Lecture Notes in Computer Science 3461, Springer 2005, ISBN 3-540-25593-1 [contents] - 2004
- [c24]Pawel Urzyczyn:
My (Un)Favourite Things. CSL 2004: 25 - 2003
- [j20]Pawel Urzyczyn:
A Simple Proof of the Undecidability of Strong Normalisation. Math. Struct. Comput. Sci. 13(1): 5-13 (2003) - [c23]Viviana Bono, Jerzy Tiuryn, Pawel Urzyczyn:
Type Inference for Nested Self Types. TYPES 2003: 99-114 - 2002
- [j19]Jerzy Tiuryn, Pawel Urzyczyn:
The Subtyping Problem for Second-Order Types Is Undecidable. Inf. Comput. 179(1): 1-18 (2002) - [c22]Teodor Knapik, Damian Niwinski, Pawel Urzyczyn:
Higher-Order Pushdown Trees Are Easy. FoSSaCS 2002: 205-222 - [i1]Laurent Regnier, Pawel Urzyczyn:
Retractions of Types with Many Atoms. CoRR cs.LO/0212005 (2002) - 2001
- [c21]Teodor Knapik, Damian Niwinski, Pawel Urzyczyn:
Deciding Monadic Theories of Hyperalgebraic Trees. TLCA 2001: 253-267
1990 – 1999
- 1999
- [j18]A. J. Kfoury, Simona Ronchi Della Rocca, Jerzy Tiuryn, Pawel Urzyczyn:
Alpha-Conversion and Typability. Inf. Comput. 150(1): 1-21 (1999) - [j17]Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn:
Discrimination by Parallel Observers: The Algorithm. Inf. Comput. 150(2): 153-186 (1999) - [j16]Pawel Urzyczyn:
The Emptiness Problem for Intersection Types. J. Symb. Log. 64(3): 1195-1215 (1999) - [c20]Zdzislaw Splawski, Pawel Urzyczyn:
Type Fixpoints: Iteration vs. Recursion. ICFP 1999: 102-113 - 1997
- [j15]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): 267-303 (1997) - [j14]Pawel Urzyczyn:
Type Reconstruction in Fomega. Math. Struct. Comput. Sci. 7(4): 329-358 (1997) - [c19]Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn:
Discrimination by Parallel Observers. LICS 1997: 396-407 - [c18]Pawel Urzyczyn:
Inhabitation in Typed Lambda-Calculi (A Syntactic Approach). TLCA 1997: 373-389 - 1996
- [j13]Pawel Urzyczyn:
Positive Recursive Type Assignment. Fundam. Informaticae 28(1-2): 197-209 (1996) - [c17]Jerzy Tiuryn, Pawel Urzyczyn:
The Subtyping Problem for Second-Order Types is Undecidable. LICS 1996: 74-85 - 1995
- [c16]Pawel Urzyczyn:
Positive Recursive Type Assignment. MFCS 1995: 382-391 - 1994
- [j12]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
An Analysis of ML Typability. J. ACM 41(2): 368-398 (1994) - [c15]Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn:
Comparing Cubes. LFCS 1994: 353-365 - [c14]Pawel Urzyczyn:
The Emptiness Problem for Intersection Types. LICS 1994: 300-309 - 1993
- [j11]Pawel Urzyczyn:
Primitive Recursion with Extential Types. Fundam. Informaticae 19(1/2): 201-222 (1993) - [j10]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
The Undecidability of the Semi-unification Problem. Inf. Comput. 102(1): 83-101 (1993) - [j9]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
Type Reconstruction in the Presence of Polymorphic Recursion. ACM Trans. Program. Lang. Syst. 15(2): 290-311 (1993) - [c13]Pawel Urzyczyn:
Type reconstruction in F-omega is undecidable. TLCA 1993: 418-432 - 1992
- [j8]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures. Theor. Comput. Sci. 93(1): 1-41 (1992) - 1990
- [c12]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
ML Typability is DEXTIME-Complete. CAAP 1990: 206-220 - [c11]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
The Undecidability of the Semi-Unification Problem (Preliminary Report). STOC 1990: 468-476
1980 – 1989
- 1989
- [c10]A. J. Kfoury, Pawel Urzyczyn:
Algo-Like Languages with Higher-Order Procedures and Their Expressive Power. Logic at Botik 1989: 186-199 - [c9]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report). LICS 1989: 98-105 - 1988
- [j7]Jerzy Tiuryn, Pawel Urzyczyn:
Some Relationships Between Logics of Programs and Complexity Theory. Theor. Comput. Sci. 60: 83-108 (1988) - [c8]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
On the Computational Power of Universally Polymorphic Recursion. LICS 1988: 72-81 - [c7]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
A Proper Extension of ML with an Effective Type-Assignment. POPL 1988: 58-69 - 1987
- [c6]Wojciech Kowalczyk, Pawel Urzyczyn:
Verification of Programs with Higher-Order Arrays. FCT 1987: 251-258 - [c5]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
The Hierarchy of Finitely Typed Functional Programs (Short Version). LICS 1987: 225-235 - 1986
- [j6]Pawel Urzyczyn:
"During" Cannot be Expressed by "After". J. Comput. Syst. Sci. 32(1): 97-104 (1986) - 1985
- [j5]A. J. Kfoury, Pawel Urzyczyn:
Necessary and Sufficient Conditions for the Universality of Programming Formalisms. Acta Informatica 22(4): 347-377 (1985) - 1984
- [c4]Jerzy Tiuryn, Pawel Urzyczyn:
Remarks on Comparing Expressive Power of Logics of Programs. MFCS 1984: 535-543 - 1983
- [j4]Pawel Urzyczyn:
A Necessary and Sufficient Condition in Order That a Herbrand Interpretation Be Expressive Relative to Recursive Programs. Inf. Control. 56(3): 212-219 (1983) - [j3]Pawel Urzyczyn:
Nontrivial Definability by Flow-Chart Programs. Inf. Control. 58(1-3): 59-87 (1983) - [c3]Pawel Urzyczyn:
Deterministic Context-Free Dynamic Logic is More Expressive than Deterministic Dynamic Logic of Regular Programs. FCT 1983: 498-504 - [c2]Jerzy Tiuryn, Pawel Urzyczyn:
Some Relationships between Logics of Programs and Complexity Theory (Extended Abstract). FOCS 1983: 180-184 - [c1]A. J. Kfoury, Pawel Urzyczyn:
Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report). Logic of Programs 1983: 279-289 - 1981
- [j2]Pawel Urzyczyn:
Algorithmic triviality of abstract structures. Fundam. Informaticae 4(4): 819-850 (1981) - [j1]Pawel Urzyczyn:
The Unwind Property in Certain Algebras. Inf. Control. 50(2): 91-109 (1981)
Coauthor Index
aka: A. J. Kfoury
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
