The Consistency and Complexity of Multiplicative Additive System Virtual
This paper investigates the proof theory of multiplicative additive system virtual (MAV). MAV combines two established proof calculi: multiplicative additive linear logic (MALL) and basic system virtual (BV). Due to the presence of the self-dual non-commutative operator from BV, the calculus MAV is...
Saved in:
Main Author: | Horne, Ross |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Article |
Language: | English |
Published: |
2016
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/81581 http://hdl.handle.net/10220/40261 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Enhancing Total Correctness Proofs in Program Verification
by: LE TON CHANH
Published: (2015) -
Mind change complexity of learning logic programs
by: Jain, S., et al.
Published: (2013) -
Verifying pointer safety for programs with unknown calls
by: Luo, C., et al.
Published: (2013) -
A Hoare calculus for graph programs
by: POSKITT, Christopher M., et al.
Published: (2010) -
Studies in Models of Quantum Proof Systems
by: ATTILA PERESZLENYI
Published: (2015)