A decidable CLDS for some propositional resource logics

DOI10.1007/3-540-45632-5_6MaRDI QIDQ4707763zbMATH OpenFDO

Authors Krysia Broda

Publication date 11 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2408/24080135.htm

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Recommendations

• CLDS for propositional intuitionistic logic
• A modal view on resource-bounded propositional logics
• Decidability by resolution for propositional modal logics
• Decidability of circumscribed description logics revisited
• scientific article; zbMATH DE number 887303
• A Decidable Constructive Description Logic
• Decidability and implementation of parametrized logic programs
• Decidable model-checking for a resource logic with production of resources
• Partial proof trees, resource sensitive logics and syntactic constraints
• An application of clasp in the study of logics

Cited in

(3)

• Compiled labelled deductive systems for access control
• CLDS for propositional intuitionistic logic
• scientific article; zbMATH DE number 1790421 (Why is no real title available?)

Describes a project that uses

Uses Software

• OTTER

This page was built for publication: A decidable CLDS for some propositional resource logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4707763)