Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
22
click to vote
CSL
1999
Springer
favorite
Email
discuss
report
97
views
Automated Reasoning
»
more
CSL 1999
»
A P-Time Completeness Proof for Light Logics
13 years 8 months ago
Download
www.di.unito.it
We explain why the original proofs of P-Time completeness for Light Affine Logic and Light Linear Logic can not work, and we fully develop a working one.
Luca Roversi
Real-time Traffic
Automated Reasoning
|
CSL 1999
|
Light Affine Logic
|
Original Proofs
|
P-Time Completeness
|
claim paper
Related Content
»
A Simple Propositional S5 Tableau System
more »
Post Info
More Details (n/a)
Added
22 Dec 2010
Updated
22 Dec 2010
Type
Journal
Year
1999
Where
CSL
Authors
Luca Roversi
Comments
(0)
Researcher Info
Automated Reasoning Study Group
Computer Vision