scientific article; zbMATH DE number 2090535

MaRDI QIDQ4812967zbMATH OpenFDO

Authors Paola Bruscoli

Publication date 12 August 2004

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

Mathematics Subject Classification ID

Logic programming (68N17) Logic in computer science (03B70)

Recommendations

• Issues in the analysis of proof-search strategies in sequential presentations of logics
• A logic of sequentiality
• scientific article; zbMATH DE number 1348467
• Proof search in nested sequent calculi
• scientific article; zbMATH DE number 1390270
• More efficient proof-search for sequents of temporal logic
• Automated Reasoning with Analytic Tableaux and Related Methods
• Sequentially composable rational proofs
• Proof nets sequentialisation in multiplicative linear logic
• Proof search algorithm in pure logical framework

Cited in

(10)

• A System of Interaction and Structure III: The Complexity of BV and Pomset Logic
• System NEL is undecidable
• System BV is NP-complete
• Linear lambda calculus and deep inference
• scientific article; zbMATH DE number 7559468 (Why is no real title available?)
• scientific article; zbMATH DE number 7559289 (Why is no real title available?)
• Constructing weak simulations from linear implications for processes with private names
• MELL in the calculus of structures
• An Analytic Propositional Proof System on Graphs
• On structuring proof search for first order linear logic

This page was built for publication:

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