The following pages link to Proof strategies in linear logic (Q1340963):
Displaying 15 items.
- Representing scope in intuitionistic deductions (Q1274448) (← links)
- Resolution calculus for the first order linear logic (Q1314284) (← links)
- On proof normalization in linear logic (Q1342248) (← links)
- Completeness of a first-order temporal logic with time-gaps (Q1350524) (← links)
- Connection methods in linear logic and proof nets construction (Q1575926) (← links)
- Efficient resource management for linear logic proof search (Q1575929) (← links)
- Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
- On compatibilities of \(\alpha \)-lock resolution method in linguistic truth-valued lattice-valued logic (Q1933772) (← links)
- From multiple sequent for additive linear logic to decision procedures for free lattices (Q1960422) (← links)
- A new deconstructive logic: linear logic (Q4372906) (← links)
- Strong normalization for all-style LKtq (Q4645240) (← links)
- A resolution theorem prover for intuitionistic logic (Q4647496) (← links)
- (Q5018490) (← links)
- Connection-based proof construction in linear logic (Q5234702) (← links)
- Resource-distribution via Boolean constraints (Q5234703) (← links)
