Labelled theorem proving for substructural logics

Claudia M G M Oliveira*

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

    Abstract

    In this paper we will present an implementation of a theorem prover for substructural logics, as they are presented in the framework of Labelled Deductive Systems [3]. This implementation is an instance of a general theorem proving environment described in [4].

    Original languageEnglish
    Title of host publicationAdvances in Artificial Intelligence - 12th Brazilian Symposium on Artificial Intelligence, SBIA 1995, Proceedings
    PublisherSpringer, Springer Nature
    Pages79-90
    Number of pages12
    Volume991
    ISBN (Print)3540604367, 9783540604365
    DOIs
    Publication statusPublished - 1995
    Event12th Brazilian Symposium on Artificial Intelligence, SBIA 1995 - Campinas, Brazil
    Duration: 10 Oct 199512 Oct 1995

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume991
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other12th Brazilian Symposium on Artificial Intelligence, SBIA 1995
    CountryBrazil
    CityCampinas
    Period10/10/9512/10/95

    Keywords

    • Automated reasoning
    • Substructural logics
    • Theorem proving

    Fingerprint Dive into the research topics of 'Labelled theorem proving for substructural logics'. Together they form a unique fingerprint.

    Cite this