Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

108

AIML
2008

215views Logical Reasoning» more AIML 2008»

Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents

15 years 5 months ago

Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents

Download users.cecs.anu.edu.au

Rajeev Goré, Linda Postniece, Alwen Tiu

Real-time Traffic

AIML 2008 | Logical Reasoning |

claim paper

Related Content

» CutElimination and Proof Search for BiIntuitionistic Tense Logic

» Taming Displayed Tense Logics Using Nested Sequents with Deep Inference

» Structural Cut Elimination

» Deep Sequent Systems for Modal Logic

» Cut Elimination for a Logic with Induction and Coinduction

» The duality of computation

» Deep Inference in Biintuitionistic Logic

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	AIML
Authors	Rajeev Goré, Linda Postniece, Alwen Tiu

Comments (0)