| Publication | Date of Publication | Type |
|---|
| A dialectic contra-classical logic | 2023-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6041918 | 2023-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5039102 | 2022-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5039109 | 2022-10-12 | Paper |
| Poly-connexivity: connexive conjunction and disjunction | 2022-10-10 | Paper |
| A Generalization of Falsity in Finitely-many Valued Logics | 2022-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5869575 | 2022-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5869601 | 2022-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5007127 | 2021-08-25 | Paper |
| A Poly-Connexive Logic | 2021-08-17 | Paper |
| Calculi for many-valued logics | 2021-08-11 | Paper |
| Toward a generalization of the logic of grounding | 2021-08-02 | Paper |
| DE MORGAN INTERPRETATION OF THE LAMBEK–GRISHIN CALCULUS | 2021-05-11 | Paper |
| Connexive restricted quantification | 2021-03-10 | Paper |
| Relevant Connexive Logic | 2021-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140119 | 2020-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5212086 | 2020-01-24 | Paper |
| Program composition via unification | 2019-12-04 | Paper |
| Another plan for negation | 2019-10-07 | Paper |
| Bilateralism, trilateralism, multilateralism and poly-sequents | 2019-06-17 | Paper |
| Structural rules for multi-valued logics | 2019-05-31 | Paper |
| Does the Implication Elimination Rule Need a Minor Premise? | 2019-03-20 | Paper |
| On Beall's new interpretation of \(WK_{3}\) | 2019-03-04 | Paper |
| Diversification of object-languages for propositional logics | 2019-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608312 | 2018-03-16 | Paper |
| A proof-theoretic semantics for adjectival modification | 2018-02-08 | Paper |
| A proof-theoretic semantics for exclusion | 2018-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4599215 | 2017-12-18 | Paper |
| On harmony and permuting conversions | 2017-03-30 | Paper |
| The Lambek calculus extended with intuitionistic propositional logic | 2016-10-27 | Paper |
| Views of proof-theoretic semantics: reified proof-theoretic meanings | 2016-07-07 | Paper |
| Relevant harmony | 2016-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3467536 | 2016-02-02 | Paper |
| A proof-theoretic universal property of determiners | 2015-11-19 | Paper |
| ON THE NOTION OF CANONICAL DERIVATIONS FROM OPEN ASSUMPTIONS AND ITS ROLE IN PROOF-THEORETIC SEMANTICS | 2015-06-29 | Paper |
| On a distinction of two facets of meaning and its role in proof-theoretic semantics | 2015-04-29 | Paper |
| Harmony in multiple-conclusion natural-deduction | 2015-02-05 | Paper |
| BILATERAL RELEVANT LOGIC | 2015-01-21 | Paper |
| Bilateralism in proof-theoretic semantics | 2014-12-18 | Paper |
| A logic inspired by natural language: quantifiers as subnectors | 2014-12-18 | Paper |
| Relational semantics of the Lambek calculus extended with classical propositional logic | 2014-09-26 | Paper |
| The Granularity of Meaning in Proof-Theoretic Semantics | 2014-06-24 | Paper |
| A note on harmony | 2012-09-20 | Paper |
| When are different type-logical semantic definitions defining equivalent meanings? | 2012-08-17 | Paper |
| Unification Grammars | 2012-06-15 | Paper |
| PROOF-THEORETIC SEMANTIC VALUES FOR LOGICAL OPERATORS | 2011-11-14 | Paper |
| Extending free pregroups with lower bounds | 2010-09-20 | Paper |
| Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars | 2010-09-07 | Paper |
| Proof-Theoretic Semantics for a Natural Language Fragment | 2010-08-31 | Paper |
| Proof-theoretic semantics for subsentential phrases | 2010-05-07 | Paper |
| Game semantics for the Lambek-calculus: Capturing directionality and the absence of structural rules | 2009-03-17 | Paper |
| Commutation-augmented pregroup grammars and push-down automata with cancellation | 2008-10-08 | Paper |
| Commutation-augmented pregroup grammars and mildly context-sensitive languages | 2008-01-21 | Paper |
| A Lambek Automaton | 2007-02-15 | Paper |
| A `natural logic' inference system using the Lambek calculus | 2006-11-17 | Paper |
| Logical Aspects of Computational Linguistics | 2005-11-23 | Paper |
| Unification grammars and off-line parsability | 2005-05-13 | Paper |
| An algebraic characterization of deterministic regular languages over infinite alphabets. | 2004-03-14 | Paper |
| Order-Based Inference in Natural Logic | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762868 | 2002-01-13 | Paper |
| The algebraic semantics of interrogative NPs | 2001-08-19 | Paper |
| Finite-memory automata | 2000-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952321 | 2000-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263083 | 2000-04-25 | Paper |
| Similarity preservation in default logic | 2000-01-12 | Paper |
| Off-line parsability and the well-foundedness of subsumption | 1999-05-02 | Paper |
| A logic-based approach to program flow analysis | 1998-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4866981 | 1996-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4864236 | 1996-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4860649 | 1996-01-16 | Paper |
| Finite-state unification automata and relational languages | 1995-01-11 | Paper |
| Program composition via unification | 1994-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4287514 | 1994-04-12 | Paper |
| Fairness and hyperfairness in multi-party interactions | 1993-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036556 | 1993-05-18 | Paper |
| On equivalence-completions of fairness assumptions | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4003356 | 1993-01-23 | Paper |
| Corrigenda:Cooperating proofs for distributed programs with multiparty interactions | 1992-06-25 | Paper |
| Fairness in context-free grammars under every choice-strategy | 1989-01-01 | Paper |
| Infinite trees, markings, and well-foundedness | 1988-01-01 | Paper |
| Appraising fairness in languages for distributed programming | 1988-01-01 | Paper |
| Fairness and the axioms of control predicates | 1987-01-01 | Paper |
| Script: A communication abstraction mechanism and its verification | 1986-01-01 | Paper |
| A complete rule for equifair termination | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3709859 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3725535 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3738540 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783524 | 1986-01-01 | Paper |
| Symmetric intertask communication | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3696524 | 1985-01-01 | Paper |
| A proof rule for fair termination of guarded commands | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3698285 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3698325 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3700822 | 1985-01-01 | Paper |
| A weakest precondition semantics for communicating processes | 1984-01-01 | Paper |
| A linear-history semantics for languages for distributed programming | 1984-01-01 | Paper |
| Modeling the distributed termination convention of CSP | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3343421 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3347265 | 1984-01-01 | Paper |
| Can message buffers be axiomatized in linear temporal logic? | 1984-01-01 | Paper |
| Product properties and their direct verification | 1983-01-01 | Paper |
| Extended naming conventions for communicating processes | 1983-01-01 | Paper |
| Decomposition of distributed programs into communication-closed layers | 1982-01-01 | Paper |
| Fair derivations in context-free grammars | 1982-01-01 | Paper |
| Achieving Distributed Termination without Freezing | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3940823 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929024 | 1981-01-01 | Paper |
| Distributed Termination | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4187303 | 1979-01-01 | Paper |
| A proof method for cyclic programs | 1978-01-01 | Paper |
| An Application of a Method for Analysis of Cyclic Prog rams | 1978-01-01 | Paper |
| Backtracking in recursive computations | 1977-01-01 | Paper |
| A case for a forward predicate transformer | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4122772 | 1977-01-01 | Paper |
| On the non-compactness of the class of program schemas | 1973-01-01 | Paper |
