| Publication | Date of Publication | Type |
|---|
A Simplified Application of Howard’s Vector Notation System to Termination Proofs for Typed Lambda-Calculus Systems
1517.68168 | 2022-12-22 | Paper |
scientific article; zbMATH DE number 7450013 (Why is no real title available?)
| 2021-12-20 | Paper |
A small remark on Hilbert's finitist view of divisibility and Kanovich-Okada-Scedrov's logical analysis of real-time systems
| 2021-07-08 | Paper |
Following a rule: Waismann's variation
Philosophy of Logic and Mathematics | 2020-08-21 | Paper |
Corrigendum to: ``Inductive-data-type systems
Theoretical Computer Science | 2020-04-01 | Paper |
Verification methods for the computationally complete symbolic attacker based on indistinguishability
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
A Note on Switching Conditions for the Generalized Logical Connectives in Multiplicative Linear Logic
| 2018-04-07 | Paper |
Semantics for ``enough-certainty and Fitting's embedding of classical logic in S4
| 2017-07-19 | Paper |
Syntactic reduction in Husserl's early phenomenology of arithmetic
Synthese | 2017-03-14 | Paper |
Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk)
| 2017-02-01 | Paper |
A diagrammatic inference system with Euler circles
Journal of Logic, Language and Information | 2015-02-09 | Paper |
Completeness and counter-example generations of a basic protocol logic (extended abstract)
| 2013-12-04 | Paper |
A generalized syllogistic inference system based on inclusion and exclusion relations
Studia Logica | 2012-12-04 | Paper |
Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
Formal to Practical Security | 2009-06-09 | Paper |
Remarks on Semantic Completeness for Proof-Terms with Laird’s Dual Affine/Intuitionistic λ-Calculus
Rewriting, Computation and Proof | 2009-03-06 | Paper |
Some Remarks on a Difference between Gentzen's Finitist and Heyting's Intuitionist Approaches toward Intuitionistic Logic and Arithmetic
Annals of the Japan Association for Philosophy of Science | 2008-12-01 | Paper |
Drug Interaction Ontology (DIO) and the Resource-Sensitive Logical Inferences
Algebra, Meaning, and Computation | 2007-09-07 | Paper |
Intuitionistic phase semantics is almost classical
Mathematical Structures in Computer Science | 2006-05-22 | Paper |
scientific article; zbMATH DE number 2086322 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 1962760 (Why is no real title available?)
| 2003-08-11 | Paper |
scientific article; zbMATH DE number 1962761 (Why is no real title available?)
| 2003-08-11 | Paper |
Phase semantics for light linear logic
Theoretical Computer Science | 2003-07-29 | Paper |
A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic
Theoretical Computer Science | 2003-07-29 | Paper |
A new correctness criterion for the proof nets of non-commutative multiplicative linear logics
Journal of Symbolic Logic | 2002-10-08 | Paper |
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
Theoretical Computer Science | 2002-07-15 | Paper |
Inductive-data-type systems
Theoretical Computer Science | 2002-03-03 | Paper |
scientific article; zbMATH DE number 1405632 (Why is no real title available?)
| 2000-09-13 | Paper |
Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic
Theoretical Computer Science | 2000-08-23 | Paper |
The finite model property for various fragments of intuitionistic linear logic
Journal of Symbolic Logic | 2000-02-09 | Paper |
scientific article; zbMATH DE number 1377618 (Why is no real title available?)
| 1999-12-14 | Paper |
scientific article; zbMATH DE number 1361538 (Why is no real title available?)
| 1999-11-10 | Paper |
scientific article; zbMATH DE number 1305935 (Why is no real title available?)
| 1999-11-08 | Paper |
scientific article; zbMATH DE number 1305936 (Why is no real title available?)
| 1999-11-08 | Paper |
scientific article; zbMATH DE number 1305943 (Why is no real title available?)
| 1999-11-08 | Paper |
A direct independence proof of Buchholz's Hydra Game on finite labeled trees
Archive for Mathematical Logic | 1999-03-18 | Paper |
scientific article; zbMATH DE number 1231574 (Why is no real title available?)
| 1998-12-20 | Paper |
scientific article; zbMATH DE number 1231526 (Why is no real title available?)
| 1998-12-14 | Paper |
scientific article; zbMATH DE number 1231525 (Why is no real title available?)
| 1998-12-14 | Paper |
Abstract data type systems
Theoretical Computer Science | 1998-07-22 | Paper |
A Relationship Among Gentzen's Proof-Reduction, Kirby-Paris' Hydra Game and Buchholz's Hydra Game
Mathematical Logic Quarterly | 1997-04-08 | Paper |
scientific article; zbMATH DE number 517014 (Why is no real title available?)
| 1994-10-30 | Paper |
scientific article; zbMATH DE number 176755 (Why is no real title available?)
| 1993-05-18 | Paper |
A rationale for conditional equational programming
Theoretical Computer Science | 1990-01-01 | Paper |
Weak Logical Constants and Second Order Definability of the Full-Strength Logical Constants
Annals of the Japan Association for Philosophy of Science | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4090848 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4092758 (Why is no real title available?)
| 1988-01-01 | Paper |
On a theory of weak implications
Journal of Symbolic Logic | 1988-01-01 | Paper |
Note on a proof of the extended Kirby-Paris theorem on labelled finite trees
European Journal of Combinatorics | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4092821 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4049637 (Why is no real title available?)
| 1987-01-01 | Paper |
A weak intuitionistic propositional logic with purely constructive implication
Studia Logica | 1987-01-01 | Paper |
A simple relationship between Buchholz's new system of ordinal notations and Takeuti's system of ordinal diagrams
Journal of Symbolic Logic | 1987-01-01 | Paper |
