Pages that link to "Item:Q1044841"
From MaRDI portal
The following pages link to Linear logic by levels and bounded time complexity (Q1044841):
Displaying 13 items.
- Paths-based criteria and application to linear logic subsystems characterizing polynomial time (Q1640980) (← links)
- Proof theory for functional modal logic (Q1708100) (← links)
- An abstract approach to stratification in linear logic (Q2343125) (← links)
- (Q2708316) (← links)
- Unary Resolution: Characterizing Ptime (Q2811353) (← links)
- On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets (Q3460508) (← links)
- Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets (Q3638260) (← links)
- (Q4580325) (← links)
- (Q4681363) (← links)
- (Q5094117) (← links)
- Proof-Theoretic Semantics and Feasibility (Q5250217) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- Super exponentials in linear logic (Q6657784) (← links)
