Sciweavers

    2 search results - page 1 / 1
    » A P-Time Completeness Proof for Light Logics
    Sort
    View
    CSL
    1999
    Springer
    97views Automated Reasoning» more  CSL 1999»
    A P-Time Completeness Proof for Light Logics
    13 years 10 months ago
    A P-Time Completeness Proof for Light Logics
    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
    claim paper
    Read More »
    APAL
    1999
    88views more  APAL 1999»
    A Simple Propositional S5 Tableau System
    13 years 10 months ago
    A Simple Propositional S5 Tableau System
    Download  comet.lehman.cuny.edu
    We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
    Melvin Fitting
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.