| Publication | Date of Publication | Type |
|---|
Proof-theoretic semantics for natural language
Topoi | 2024-12-13 | Paper |
Truth-value constants in multi-valued logics
| 2024-10-01 | Paper |
A dialectic contra-classical logic
Logica Universalis | 2023-07-11 | Paper |
A glimpse into higher-order connexive logics
| 2023-05-15 | Paper |
Bilateralism based on corrective denial
| 2022-10-12 | Paper |
On the role of Aristotle's connexive axioms in non-connexive logics
| 2022-10-12 | Paper |
Poly-connexivity: connexive conjunction and disjunction
Notre Dame Journal of Formal Logic | 2022-10-10 | Paper |
A Generalization of Falsity in Finitely-many Valued Logics
Fundamenta Informaticae | 2022-10-07 | Paper |
On poly-logistic natural-deduction for finitely-valued propositional logics
| 2022-09-28 | Paper |
scientific article; zbMATH DE number 7594147 (Why is no real title available?)
| 2022-09-28 | Paper |
scientific article; zbMATH DE number 7385380 (Why is no real title available?)
| 2021-08-25 | Paper |
A poly-connexive logic
Logic and Logical Philosophy | 2021-08-17 | Paper |
Calculi for many-valued logics
Logica Universalis | 2021-08-11 | Paper |
Toward a generalization of the logic of grounding
THEORIA. An International Journal for Theory, History and Foundations of Science | 2021-08-02 | Paper |
De Morgan interpretation of the Lambek-Grishin calculus
The Review of Symbolic Logic | 2021-05-11 | Paper |
Connexive restricted quantification
Notre Dame Journal of Formal Logic | 2021-03-10 | Paper |
Relevant connexive logic
Logic and Logical Philosophy | 2021-01-08 | Paper |
A proof-theoretic semantics for parametric logical constants
| 2020-12-14 | Paper |
Transparent truth-value predicates in multi-valued logics
| 2020-01-24 | Paper |
Program composition via unification
Automata, Languages and Programming | 2019-12-04 | Paper |
Another plan for negation
The Australasian Journal of Logic | 2019-10-07 | Paper |
Bilateralism, trilateralism, multilateralism and poly-sequents
Journal of Philosophical Logic | 2019-06-17 | Paper |
Structural rules for multi-valued logics
Logica Universalis | 2019-05-31 | Paper |
Does the implication elimination rule need a minor premise?
Logic and Logical Philosophy | 2019-03-20 | Paper |
On Beall's new interpretation of \(WK_{3}\)
Journal of Logic, Language and Information | 2019-03-04 | Paper |
Diversification of object-languages for propositional logics
Journal of Logic, Language and Information | 2019-01-18 | Paper |
scientific article; zbMATH DE number 6851054 (Why is no real title available?)
| 2018-03-16 | Paper |
A proof-theoretic semantics for adjectival modification
Journal of Logic, Language and Information | 2018-02-08 | Paper |
A proof-theoretic semantics for exclusion
Logica Universalis | 2018-01-12 | Paper |
scientific article; zbMATH DE number 6819811 (Why is no real title available?)
| 2017-12-18 | Paper |
On harmony and permuting conversions
Journal of Applied Logic | 2017-03-30 | Paper |
The Lambek calculus extended with intuitionistic propositional logic
Studia Logica | 2016-10-27 | Paper |
Views of proof-theoretic semantics: reified proof-theoretic meanings
Journal Of Logic And Computation | 2016-07-07 | Paper |
Relevant harmony
Journal of Logic and Computation | 2016-04-28 | Paper |
Proof-theoretic semantics
| 2016-02-02 | Paper |
A proof-theoretic universal property of determiners
Journal of Applied Logic | 2015-11-19 | Paper |
On the notion of canonical derivations from open assumptions and its role in proof-theoretic semantics
The Review of Symbolic Logic | 2015-06-29 | Paper |
On a distinction of two facets of meaning and its role in proof-theoretic semantics
Logica Universalis | 2015-04-29 | Paper |
Harmony in multiple-conclusion natural-deduction
Logica Universalis | 2015-02-05 | Paper |
Bilateral relevant logic
The Review of Symbolic Logic | 2015-01-21 | Paper |
Bilateralism in proof-theoretic semantics
Journal of Philosophical Logic | 2014-12-18 | Paper |
A logic inspired by natural language: quantifiers as subnectors
Journal of Philosophical Logic | 2014-12-18 | Paper |
Relational semantics of the Lambek calculus extended with classical propositional logic
Studia Logica | 2014-09-26 | Paper |
The granularity of meaning in proof-theoretic semantics
Logical Aspects of Computational Linguistics | 2014-06-24 | Paper |
A note on harmony
Journal of Philosophical Logic | 2012-09-20 | Paper |
When are different type-logical semantic definitions defining equivalent meanings?
Journal of Computer and System Sciences | 2012-08-17 | Paper |
Unification grammars.
| 2012-06-15 | Paper |
Proof-theoretic semantic values for logical operators
The Review of Symbolic Logic | 2011-11-14 | Paper |
Extending free pregroups with lower bounds
Studia Logica | 2010-09-20 | Paper |
Mildly context-sensitive languages via buffer augmented pregroup grammars
Time for Verification | 2010-09-07 | Paper |
Proof-theoretic semantics for a natural language fragment
Lecture Notes in Computer Science | 2010-08-31 | Paper |
Proof-theoretic semantics for subsentential phrases
Studia Logica | 2010-05-07 | Paper |
Game semantics for the Lambek-calculus: Capturing directionality and the absence of structural rules
Studia Logica | 2009-03-17 | Paper |
Commutation-augmented pregroup grammars and push-down automata with cancellation
Information and Computation | 2008-10-08 | Paper |
Commutation-augmented pregroup grammars and mildly context-sensitive languages
Studia Logica | 2008-01-21 | Paper |
A Lambek Automaton
Logic Journal of the IGPL | 2007-02-15 | Paper |
A `natural logic' inference system using the Lambek calculus
Journal of Logic, Language and Information | 2006-11-17 | Paper |
Logical Aspects of Computational Linguistics
Lecture Notes in Computer Science | 2005-11-23 | Paper |
Unification grammars and off-line parsability
Journal of Logic, Language and Information | 2005-05-13 | Paper |
An algebraic characterization of deterministic regular languages over infinite alphabets.
Theoretical Computer Science | 2004-03-14 | Paper |
Order-Based Inference in Natural Logic
Logic Journal of the IGPL | 2004-03-07 | Paper |
scientific article; zbMATH DE number 1689577 (Why is no real title available?)
| 2002-01-13 | Paper |
The algebraic semantics of interrogative NPs
Grammars | 2001-08-19 | Paper |
Finite-memory automata
Theoretical Computer Science | 2000-06-15 | Paper |
scientific article; zbMATH DE number 1444740 (Why is no real title available?)
| 2000-05-09 | Paper |
scientific article; zbMATH DE number 1341541 (Why is no real title available?)
| 2000-04-25 | Paper |
Similarity preservation in default logic
Annals of Mathematics and Artificial Intelligence | 2000-01-12 | Paper |
Off-line parsability and the well-foundedness of subsumption
Journal of Logic, Language and Information | 1999-05-02 | Paper |
A logic-based approach to program flow analysis
Acta Informatica | 1998-11-08 | Paper |
scientific article; zbMATH DE number 847936 (Why is no real title available?)
| 1996-03-19 | Paper |
scientific article; zbMATH DE number 839543 (Why is no real title available?)
| 1996-01-30 | Paper |
scientific article; zbMATH DE number 834563 (Why is no real title available?)
| 1996-01-16 | Paper |
Finite-state unification automata and relational languages
Information and Computation | 1995-01-11 | Paper |
Program composition via unification
Theoretical Computer Science | 1994-08-29 | Paper |
scientific article; zbMATH DE number 549994 (Why is no real title available?)
| 1994-04-12 | Paper |
Fairness and hyperfairness in multi-party interactions
Distributed Computing | 1993-09-16 | Paper |
scientific article; zbMATH DE number 176727 (Why is no real title available?)
| 1993-05-18 | Paper |
On equivalence-completions of fairness assumptions
Formal Aspects of Computing | 1993-04-01 | Paper |
scientific article; zbMATH DE number 53100 (Why is no real title available?)
| 1993-01-23 | Paper |
Corrigenda:Cooperating proofs for distributed programs with multiparty interactions
Information Processing Letters | 1992-06-25 | Paper |
Fairness in context-free grammars under every choice-strategy
Information and Computation | 1989-01-01 | Paper |
Appraising fairness in languages for distributed programming
Distributed Computing | 1988-01-01 | Paper |
Infinite trees, markings, and well-foundedness
Information and Computation | 1988-01-01 | Paper |
Fairness and the axioms of control predicates
International Journal of Parallel Programming | 1987-01-01 | Paper |
scientific article; zbMATH DE number 3938533 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3972158 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3956427 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 4047068 (Why is no real title available?)
| 1986-01-01 | Paper |
Script: A communication abstraction mechanism and its verification
Science of Computer Programming | 1986-01-01 | Paper |
A complete rule for equifair termination
Journal of Computer and System Sciences | 1986-01-01 | Paper |
A proof rule for fair termination of guarded commands
Information and Control | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3924108 (Why is no real title available?)
| 1985-01-01 | Paper |
Symmetric intertask communication
ACM Transactions on Programming Languages and Systems | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3921985 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3924158 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3926229 (Why is no real title available?)
| 1985-01-01 | Paper |
Can message buffers be axiomatized in linear temporal logic?
Information and Control | 1984-01-01 | Paper |
Modeling the distributed termination convention of CSP
ACM Transactions on Programming Languages and Systems | 1984-01-01 | Paper |
A linear-history semantics for languages for distributed programming
Theoretical Computer Science | 1984-01-01 | Paper |
A weakest precondition semantics for communicating processes
Theoretical Computer Science | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3890705 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3878340 (Why is no real title available?)
| 1984-01-01 | Paper |
Product properties and their direct verification
Acta Informatica | 1983-01-01 | Paper |
Extended naming conventions for communicating processes
Science of Computer Programming | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3757682 (Why is no real title available?)
| 1982-01-01 | Paper |
Decomposition of distributed programs into communication-closed layers
Science of Computer Programming | 1982-01-01 | Paper |
Achieving Distributed Termination without Freezing
IEEE Transactions on Software Engineering | 1982-01-01 | Paper |
Fair derivations in context-free grammars
Information and Control | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3744520 (Why is no real title available?)
| 1981-01-01 | Paper |
Distributed Termination
ACM Transactions on Programming Languages and Systems | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3624779 (Why is no real title available?)
| 1979-01-01 | Paper |
An Application of a Method for Analysis of Cyclic Prog rams
IEEE Transactions on Software Engineering | 1978-01-01 | Paper |
A proof method for cyclic programs
Acta Informatica | 1978-01-01 | Paper |
scientific article; zbMATH DE number 3548403 (Why is no real title available?)
| 1977-01-01 | Paper |
Backtracking in recursive computations
Acta Informatica | 1977-01-01 | Paper |
A case for a forward predicate transformer
Information Processing Letters | 1977-01-01 | Paper |
On the non-compactness of the class of program schemas
Information Processing Letters | 1973-01-01 | Paper |
