The following pages link to Paweł Urzyczyn (Q332079):
Displaying 50 items.
- Intuitionistic games: determinacy, completeness, and normalization (Q332080) (← links)
- A syntactic embedding of predicate logic into second-order propositional logic (Q609763) (← links)
- (Q801665) (redirect page) (← links)
- Necessary and sufficient conditions for the universality of programming formalisms (Q801666) (← links)
- Lectures on the Curry-Howard isomorphism (Q881453) (← links)
- ``During'' cannot be expressed by ``after'' (Q1085154) (← links)
- Some relationships between logics of programs and complexity theory (Q1106839) (← links)
- (Q1185005) (redirect page) (← links)
- On the expressive power of finitely typed and universally polymorphic recursive procedures (Q1185006) (← links)
- The undecidability of the semi-unification problem (Q1207950) (← links)
- Comparing cubes of typed and type assignment systems (Q1365249) (← links)
- The subtyping problem for second-order types is undecidable. (Q1400717) (← links)
- Answer set programming in intuitionistic logic (Q1688962) (← links)
- Alpha-conversion and typability (Q1854262) (← links)
- Discrimination by parallel observers: the algorithm. (Q1854269) (← links)
- (Q2778825) (← links)
- Type fixpoints, iteration vs. recursion (Q2817715) (← links)
- The Complexity of Inhabitation with Explicit Intersection (Q2897957) (← links)
- The Logic of Persistent Intersection (Q3000287) (← links)
- Finite Combinatory Logic with Intersection Types (Q3007665) (← links)
- (Q3024919) (← links)
- (Q3142168) (← links)
- (Q3204025) (← links)
- (Q3314965) (← links)
- (Q3326828) (← links)
- A necessary and sufficient condition in order that a Herbrand interpretation be expressive relative to recursive programs (Q3332239) (← links)
- Nontrivial definability by flow-chart programs (Q3345746) (← links)
- (Q3345772) (← links)
- In the Search of a Naive Type Theory (Q3499754) (← links)
- Positive recursive type assignment (Q3569027) (← links)
- Strong cut-elimination in sequent calculus using Klop's <i>ι</i>-translation and perpetual reductions (Q3617369) (← links)
- Inhabitation of Low-Rank Intersection Types (Q3637206) (← links)
- (Q3764130) (← links)
- (Q3766818) (← links)
- (Q3769949) (← links)
- (Q3785900) (← links)
- (Q3829053) (← links)
- The unwind property in certain algebras (Q3952091) (← links)
- (Q3966122) (← links)
- (Q3967042) (← links)
- (Q3969853) (← links)
- (Q4027630) (← links)
- (Q4281489) (← links)
- An analysis of ML typability (Q4299012) (← links)
- (Q4332424) (← links)
- Type reconstruction in F<sub>ω</sub> (Q4347376) (← links)
- A simple proof of the undecidability of strong normalisation (Q4405686) (← links)
- (Q4501164) (← links)
- First-order Answer Set Programming as Constructive Proof Search (Q4559822) (← links)
- Bounded Combinatory Logic (Q4649550) (← links)
