default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLutz Straßburger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Wendlasida Ouedraogo, Gabriel Scherer
, Lutz Straßburger:
Coqlex: Generating Formally Verified Lexers. Art Sci. Eng. Program. 8(1) (2024)- [c47]Marianna Girlando, Roman Kuznets, Sonia Marin, Marianela Morales, Lutz Straßburger:
A Simple Loopcheck for Intuitionistic K. WoLLIC 2024: 47-63 - [c46]Mehrnoosh Sadrzadeh, Lutz Straßburger:
Lambek Calculus with Banged Atoms for Parasitic Gaps. WoLLIC 2024: 193-209 - 2023
- [j18]Lê Thành Dung Nguyên, Lutz Straßburger:
A System of Interaction and Structure III: The Complexity of BV and Pomset Logic. Log. Methods Comput. Sci. 19(4) (2023) - [c45]Marianna Girlando, Roman Kuznets, Sonia Marin, Marianela Morales, Lutz Straßburger:
Intuitionistic S4 is decidable. LICS 2023: 1-13 - [i12]Marianna Girlando, Roman Kuznets, Sonia Marin, Marianela Morales, Lutz Straßburger:
Intuitionistic S4 is decidable. CoRR abs/2304.12094 (2023) - [i11]Wendlasida Ouedraogo, Gabriel Scherer, Lutz Straßburger:
Coqlex: Generating Formally Verified Lexers. CoRR abs/2306.12411 (2023) - 2022
- [j17]Matteo Acclavio, Ross Horne, Lutz Straßburger:
An Analytic Propositional Proof System on Graphs. Log. Methods Comput. Sci. 18(4) (2022) - [c44]Matteo Acclavio, Lutz Straßburger:
Combinatorial Proofs for Constructive Modal Logic. AiML 2022: 15-36 - [c43]Lutz Straßburger, Matteo Tesi, Agata Ciabattoni:
Taming Bounded Depth with Nested Sequents. AiML 2022: 199-216 - [c42]Lê Thành Dung Nguyên, Lutz Straßburger:
BV and Pomset Logic Are Not the Same. CSL 2022: 32:1-32:17 - [c41]Willem B. Heijltjes, Dominic J. D. Hughes, Lutz Straßburger:
Normalization Without Syntax. FSCD 2022: 19:1-19:19 - [c40]Matteo Acclavio, Ross Horne, Sjouke Mauw, Lutz Straßburger:
A Graphical Proof Theory of Logical Time. FSCD 2022: 22:1-22:25 - [c39]Giti Omidvar, Lutz Straßburger:
Combinatorial Flows as Bicolored Atomic Flows. WoLLIC 2022: 141-157 - [i10]Lê Thành Dung Nguyên, Lutz Straßburger:
A System of Interaction and Structure III: The Complexity of BV and Pomset Logic. CoRR abs/2209.07825 (2022) - 2021
- [j16]Roman Kuznets, Sonia Marin, Lutz Straßburger:
Justification Logic for Constructive Modal Logic. FLAP 8(8): 2313-2332 (2021) - [j15]Sonia Marin, Marianela Morales, Lutz Straßburger:
A fully labelled proof system for intuitionistic modal logics. J. Log. Comput. 31(3): 998-1022 (2021) - [c38]Dominic J. D. Hughes, Lutz Straßburger, Jui-Hsuan Wu:
Combinatorial Proofs and Decomposition Theorems for First-order Logic. LICS 2021: 1-13 - [c37]Matteo Acclavio, Davide Catta, Lutz Straßburger:
Game Semantics for Constructive Modal Logic. TABLEAUX 2021: 428-445 - [i9]Matteo Acclavio, Davide Catta, Lutz Straßburger:
Towards a Denotational Semantics for Proofs in Constructive Modal Logic. CoRR abs/2104.09115 (2021) - [i8]Dominic J. D. Hughes, Lutz Straßburger, Jui-Hsuan Wu:
Combinatorial Proofs and Decomposition Theorems for First-order Logic. CoRR abs/2104.13124 (2021) - 2020
- [c36]Marianna Girlando, Lutz Straßburger:
MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description). IJCAR (2) 2020: 398-407 - [c35]Matteo Acclavio, Ross Horne, Lutz Straßburger:
Logic Beyond Formulas: A Proof System on Graphs. LICS 2020: 38-52 - [i7]Matteo Acclavio, Ross Horne, Lutz Straßburger:
An Analytic Propositional Proof System on Graphs. CoRR abs/2012.01102 (2020)
2010 – 2019
- 2019
- [j14]Roman Kuznets, Lutz Straßburger:
Maehara-style modal nested calculi. Arch. Math. Log. 58(3-4): 359-385 (2019) - [j13]Lutz Straßburger:
Deep inference and expansion trees for second-order multiplicative linear logic. Math. Struct. Comput. Sci. 29(8): 1030-1060 (2019) - [j12]Lutz Straßburger:
On the decision problem for MELL. Theor. Comput. Sci. 768: 91-98 (2019) - [c34]Willem B. Heijltjes, Dominic J. D. Hughes, Lutz Straßburger:
Intuitionistic proofs without syntax. LICS 2019: 1-13 - [c33]Willem Heijltjes, Dominic J. D. Hughes, Lutz Straßburger:
Proof Nets for First-Order Additive Linear Logic. FSCD 2019: 22:1-22:22 - [c32]Matteo Acclavio, Lutz Straßburger:
On Combinatorial Proofs for Modal Logic. TABLEAUX 2019: 223-240 - [c31]Benjamin Ralph, Lutz Straßburger:
Towards a Combinatorial Proof Theory. TABLEAUX 2019: 259-276 - [c30]Matteo Acclavio, Lutz Straßburger:
On Combinatorial Proofs for Logics of Relevance and Entailment. WoLLIC 2019: 1-16 - 2018
- [c29]Matteo Acclavio, Lutz Straßburger:
From Syntactic Proofs to Combinatorial Proofs. IJCAR 2018: 481-497 - 2017
- [c28]Lutz Straßburger:
Combinatorial Flows and Their Normalisation. FSCD 2017: 31:1-31:17 - [c27]Sonia Marin, Lutz Straßburger:
Proof Theory for Indexed Nested Sequents. TABLEAUX 2017: 81-97 - [c26]Paola Bruscoli, Lutz Straßburger:
On the Length of Medial-Switch-Mix Derivations. WoLLIC 2017: 68-79 - 2016
- [j11]Anupam Das, Lutz Straßburger:
On linear rewriting systems for Boolean logic and some applications to proof theory. Log. Methods Comput. Sci. 12(4) (2016) - [j10]Willem Heijltjes, Lutz Straßburger:
Proof nets and semi-star-autonomous categories. Math. Struct. Comput. Sci. 26(5): 789-828 (2016) - [c25]Kaustuv Chaudhuri, Sonia Marin, Lutz Straßburger:
Focused and Synthetic Nested Sequents. FoSSaCS 2016: 390-407 - [c24]Laurent Méhats, Lutz Straßburger:
Non-crossing Tree Realizations of Ordered Degree Sequences. LACL 2016: 211-227 - [c23]Kaustuv Chaudhuri, Sonia Marin, Lutz Straßburger:
Modular Focused Proof Systems for Intuitionistic Modal Logics. FSCD 2016: 16:1-16:18 - 2015
- [j9]Ryuta Arisaka, Anupam Das, Lutz Straßburger:
On Nested Sequents for Constructive Modal Logics. Log. Methods Comput. Sci. 11(3) (2015) - [j8]Novak Novakovic, Lutz Straßburger:
On the Power of Substitution in the Calculus of Structures. ACM Trans. Comput. Log. 16(3): 19:1-19:20 (2015) - [c22]Anupam Das, Lutz Straßburger:
No complete linear term rewriting system for propositional logic. RTA 2015: 127-142 - 2014
- [c21]Sonia Marin, Lutz Straßburger:
Label-free Modular Systems for Classical and Intuitionistic Modal Logics. Advances in Modal Logic 2014: 387-406 - [c20]Richard Blute, Alessio Guglielmi, Ivan T. Ivanov, Prakash Panangaden, Lutz Straßburger:
A Logical Basis for Quantum Evolution and Entanglement. Categories and Types in Logic, Language, and Physics 2014: 90-107 - [c19]Nicolas Guenot, Lutz Straßburger:
Symmetric normalisation for intuitionistic logic. CSL-LICS 2014: 45:1-45:10 - [c18]Stefan Mehner, Daniel Seidel, Lutz Straßburger, Janis Voigtländer:
Parametricity and Proving Free Theorems for Functional-Logic Languages. PPDP 2014: 19-30 - 2013
- [j7]Stefan Hetzl, Lutz Straßburger:
Herbrand-Confluence. Log. Methods Comput. Sci. 9(4) (2013) - [c17]Lutz Straßburger:
Cut Elimination in Nested Sequents for Intuitionistic Modal Logics. FoSSaCS 2013: 209-224 - 2012
- [j6]Lutz Straßburger:
Extension without cut. Ann. Pure Appl. Log. 163(12): 1995-2007 (2012) - [c16]Stefan Hetzl, Lutz Straßburger:
Herbrand-Confluence for Cut Elimination in Classical First Order Logic. CSL 2012: 320-334 - 2011
- [b2]Lutz Straßburger:
Towards a Theory of Proofs of Classical Logic. Paris Diderot University, France, 2011 - [j5]Lutz Straßburger:
From Deep Inference to Proof Nets via Cut Elimination. J. Log. Comput. 21(4): 589-624 (2011) - [j4]Alessio Guglielmi, Lutz Straßburger:
A system of interaction and structure V: the exponentials and splitting. Math. Struct. Comput. Sci. 21(3): 563-584 (2011) - [j3]Lutz Straßburger, Alessio Guglielmi:
A system of interaction and structure IV: The exponentials and decomposition. ACM Trans. Comput. Log. 12(4): 23:1-23:39 (2011) - [c15]Kaustuv Chaudhuri, Nicolas Guenot, Lutz Straßburger:
The Focused Calculus of Structures. CSL 2011: 159-173 - [i6]Lutz Straßburger:
Some Remarks on Nested Sequent Systems for Modal Logics. TABLEAUX (Workshops, Tutorials, and Short Papers) 2011: 75 - [i5]Lutz Straßburger:
Introduction to Proof Nets. TABLEAUX (Workshops, Tutorials, and Short Papers) 2011: 79 - 2010
- [c14]Lutz Straßburger:
What Is the Problem with Proof Nets for Classical Logic? CiE 2010: 406-416 - [c13]Alessio Guglielmi, Tom Gundersen, Lutz Straßburger:
Breaking Paths in Atomic Flows for Classical Logic. LICS 2010: 284-293
2000 – 2009
- 2009
- [c12]Agata Ciabattoni, Lutz Straßburger, Kazushige Terui:
Expanding the Realm of Systematic Proof Theory. CSL 2009: 163-178 - [c11]Lutz Straßburger:
A Kleene Theorem for Forest Languages. LATA 2009: 715-727 - [c10]Kai Brünnler, Lutz Straßburger:
Modular Sequent Systems for Modal Logic. TABLEAUX 2009: 152-166 - [c9]Lutz Straßburger:
Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic. TLCA 2009: 309-324 - [i4]Lutz Straßburger, Alessio Guglielmi:
A System of Interaction and Structure IV: The Exponentials and Decomposition. CoRR abs/0903.5259 (2009) - 2007
- [c8]Lutz Straßburger:
A Characterization of Medial as Rewriting Rule. RTA 2007: 344-358 - 2006
- [j2]François Lamarche, Lutz Straßburger:
From Proof Nets to the Free *-Autonomous Category. Log. Methods Comput. Sci. 2(4) (2006) - [i3]François Lamarche, Lutz Straßburger:
From Proof Nets to the Free *-Autonomous Category. CoRR abs/cs/0605054 (2006) - [i2]Lutz Straßburger:
Proof Nets and the Identity of Proofs. CoRR abs/cs/0610123 (2006) - 2005
- [c7]François Lamarche, Lutz Straßburger:
Constructing Free Boolean Categories. LICS 2005: 209-218 - [c6]François Lamarche, Lutz Straßburger:
Naming Proofs in Classical Propositional Logic. TLCA 2005: 246-261 - [i1]Lutz Straßburger:
On the Axiomatisation of Boolean Categories with and without Medial. CoRR abs/cs/0512086 (2005) - 2004
- [c5]Lutz Straßburger, François Lamarche:
On Proof Nets for Multiplicative Linear Logic with Units. CSL 2004: 145-159 - 2003
- [b1]Lutz Straßburger:
Linear logic and noncommutativity in the calculus of structures. Dresden University of Technology, Germany, 2003, pp. 1-268 - [j1]Lutz Straßburger:
MELL in the calculus of structures. Theor. Comput. Sci. 309(1-3): 213-285 (2003) - [c4]Lutz Straßburger:
System NEL is Undecidable. WoLLIC 2003: 166-177 - 2002
- [c3]Alessio Guglielmi, Lutz Straßburger:
A Non-commutative Extension of MELL. LPAR 2002: 231-246 - [c2]Lutz Straßburger:
A Local System for Linear Logic. LPAR 2002: 388-402 - 2001
- [c1]Alessio Guglielmi, Lutz Straßburger:
Non-commutativity and MELL in the Calculus of Structures. CSL 2001: 54-68
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
