Proof-theoretic Analysis of Modal Logics

Project Information

PAnaMoL

Grant agreement ID: 660047

DOI

10.3030/660047

Project closed

EC signature date 11 March 2015

Start date 1 May 2015

End date 30 April 2017

Funded under

• EXCELLENT SCIENCE - Marie Skłodowska-Curie Actions

Total cost

€ 178 156,80

EU contribution

€ 178 156,80

Coordinated by

TECHNISCHE UNIVERSITAET WIEN
Austria

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Book chapters (3)

Linear Nested Sequents, 2-Sequents and Hypersequents

Author(s): Björn Lellmann
Published in: Automated Reasoning with Analytic Tableaux and Related Methods, 2015, Page(s) 135-150, ISBN 978-3-319-24312-2
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-24312-2_10

Proof Search in Nested Sequent Calculi

Author(s): Björn Lellmann, Elaine Pimentel
Published in: Logic for Programming, Artificial Intelligence, and Reasoning, 2015, Page(s) 558-574, ISBN 978-3-662-48899-7
Publisher: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-48899-7_39

Mīmāṃsā Deontic Logic: Proof Theory and Applications

Author(s): Agata Ciabattoni, Elisa Freschi, Francesco A. Genco, Björn Lellmann
Published in: Automated Reasoning with Analytic Tableaux and Related Methods, 2015, Page(s) 323-338, ISBN 978-3-319-24312-2
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-24312-2_22

Peer reviewed articles (4)

Hypersequent rules with restricted contexts for propositional modal logics

Author(s): Bj?rn Lellmann
Published in: Theoretical Computer Science, Issue 656, 2016, Page(s) 76-105, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2016.10.004

From Cut-free Calculi to Automated Deduction: The Case of Bounded Contraction

Author(s): Agata Ciabattoni, Bj?rn Lellmann, Carlos Olarte, Elaine Pimentel
Published in: Electronic Notes in Theoretical Computer Science, Issue 332, 2017, Page(s) 75-93, ISSN 1571-0661
Publisher: Elsevier BV
DOI: 10.1016/j.entcs.2017.04.006

Grafting hypersequents onto nested sequents

Author(s): Roman Kuznets, Bj?rn Lellmann
Published in: Logic Journal of IGPL, Issue 24/3, 2016, Page(s) 375-423, ISSN 1367-0751
Publisher: Oxford University Press
DOI: 10.1093/jigpal/jzw005

Understanding prescriptive texts: Rules and logic as elaborated by the Mimamsa school

Author(s): Elisa Freschi, Agata Ciabattoni, Francesco A. Genco, Bjoern Lellmann
Published in: Journal of World Philosophies, Issue 2, 2017, Page(s) 47-66, ISSN 2474-1795
Publisher: Indiana University Press
DOI: 10.2979/jourworlphil.2.1.05

Conference proceedings (2)

A uniform framework for substructural logics with modalities

Author(s): Bjoern Lellmann, Carlos Olarte and Elaine Pimentel
Published in: LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 2017, Page(s) 435-455, ISSN 2398-7340
Publisher: Easychair

Standard Sequent Calculi for Lewis’ Logics of Counterfactuals

Author(s): Marianna Girlando, Bj?rn Lellmann, Nicola Olivetti, Gian Luca Pozzato
Published in: 2016, Page(s) 272-287
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-48758-8_18