The following pages link to Aleksy Schubert (Q276262):
Displayed 29 items.
- The role of polymorphism in the characterisation of complexity by soft types (Q276263) (← links)
- Existential type systems between Church and Curry style (type-free style) (Q402117) (← links)
- The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types (Q690505) (← links)
- Answer set programming in intuitionistic logic (Q1688962) (← links)
- On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note) (Q2326386) (← links)
- A note on subject reduction in \((\to, \exists)\)-Curry with respect to complete developments (Q2350605) (← links)
- Automata theory approach to predicate intuitionistic logic (Q2409748) (← links)
- (Q2778836) (← links)
- Relational Abstract Domain of Weighted Hexagons (Q2814105) (← links)
- (Q2958384) (← links)
- The Role of Polymorphism in the Characterisation of Complexity by Soft Types (Q3088041) (← links)
- On the building of affine retractions (Q3520151) (← links)
- The Existential Fragment of the One-Step Parallel Rewriting Theory (Q3636820) (← links)
- Existential Type Systems with No Types in Terms (Q3637189) (← links)
- (Q4508310) (← links)
- (Q4536445) (← links)
- First-order Answer Set Programming as Constructive Proof Search (Q4559822) (← links)
- (Q4649547) (← links)
- Automata theory approach to predicate intuitionistic logic (Q5103712) (← links)
- (Q5277980) (← links)
- How Hard Is Positive Quantification? (Q5278190) (← links)
- Computer Science Logic (Q5311257) (← links)
- (Q5351954) (← links)
- (Q5369477) (← links)
- (Q5389138) (← links)
- Fundamentals of Computation Theory (Q5492941) (← links)
- On the Mints Hierarchy in First-Order Intuitionistic Logic (Q5892211) (← links)
- On the Mints Hierarchy in First-Order Intuitionistic Logic (Q5892381) (← links)
- The existential fragment of second-order propositional intuitionistic logic is undecidable (Q6117326) (← links)