Pages that link to "Item:Q1044841"
From MaRDI portal
The following pages link to Linear logic by levels and bounded time complexity (Q1044841):
Displaying 23 items.
- Bounded combinatory logic and lower complexity (Q276270) (← links)
- Light linear logics with controlled weakening: expressibility, confluent strong normalization (Q408540) (← links)
- A semantic measure of the execution time in linear logic (Q534698) (← links)
- Bounded linear logic: A modular approach to polynomial-time computability (Q1193854) (← links)
- Linear logic and elementary time (Q1401946) (← links)
- Paths-based criteria and application to linear logic subsystems characterizing polynomial time (Q1640980) (← links)
- Proof theory for functional modal logic (Q1708100) (← links)
- Combining linear logic and size types for implicit complexity (Q1989323) (← links)
- Polynomial time in untyped elementary linear logic (Q1989326) (← links)
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (Q2343123) (← links)
- An abstract approach to stratification in linear logic (Q2343125) (← links)
- Elementary complexity and geometry of interaction (Q2708316) (← links)
- Unary Resolution: Characterizing Ptime (Q2811353) (← links)
- Soft linear logic and polynomial complexity classes (Q2866738) (← 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)
- Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets (Q4635793) (← 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)
