( en | de | ru )

 

Disambiguation of "Lellmann, Björn"

Author of the publication

copydeleteadd this publication to your clipboard
Interpolation for Intermediate Logics via Hyper- and Linear Nested Sequents.

, and . Advances in Modal Logic, page 473-492. College Publications, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Björn Lellmann

Saskia Björn

Bolli Björnsson

Ulf Björner

Erik Björnemo

 

Other publications of authors with the same name

Hypersequent calculi for non-normal modal and deontic logics: Countermodels and optimal complexity., , , and . CoRR, (2020)Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (Extended version)., and . CoRR, (2019)Sequent Rules for Reasoning and Conflict Resolution in Conditional Norms., and . DEON, page 94-113. College Publications, (2021)Mīmāmsā deontic logic: proof theory and applications., , , and . CoRR, (2017)Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics., , , and . LFCS, volume 11972 of Lecture Notes in Computer Science, page 27-46. Springer, (2020)Hypersequent calculi for non-normal modal and deontic logics: countermodels and optimal complexity., , , and . J. Log. Comput., 31 (1): 67-111 (2021)Theorem Proving for Lewis Logics of Counterfactual Reasoning., , , , and . CILC, volume 2710 of CEUR Workshop Proceedings, page 199-213. CEUR-WS.org, (2020)From Input/Output Logics to Conditional Logics via Sequents - with Provers.. TABLEAUX, volume 12842 of Lecture Notes in Computer Science, page 147-164. Springer, (2021)Interpolation for intermediate logics via injective nested sequents., and . J. Log. Comput., 31 (3): 797-831 (2021)Calculi, countermodel generation and theorem prover for strong logics of counterfactual reasoning., , , , and . J. Log. Comput., 32 (2): 233-280 (2022)