Pages that link to "Item:Q5941199"
From MaRDI portal
The following pages link to Proofs as computations in linear logic (Q5941199):
Displaying 11 items.
- Correctness of linear logic proof structures is NL-complete (Q534703) (← links)
- The number of proof lines and the size of proofs in first order logic (Q1102280) (← links)
- Linear logic as a logic of computations (Q1326780) (← links)
- On proof normalization in linear logic (Q1342248) (← links)
- New uses of linear arithmetic in automated theorem proving by induction (Q1915133) (← links)
- An even closer integration of linear arithmetic into inductive theorem proving (Q2852038) (← links)
- From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing (Q3612618) (← links)
- (Q4282602) (← links)
- Some Properties of Linear Logic Proved by Semantic Methods (Q4323009) (← links)
- (Q5014808) (← links)
- (Q5020970) (← links)