Hiroakira Ono

According to our database1, Hiroakira Ono authored at least 39 papers between 1979 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Analytic Cut and Mints - Symmetric Interpolation Method for Bi-intuitionistic Tense Logic.
Proceedings of the Advances in Modal Logic, AiML 2022, Rennes, France, 2022

2020
A cut-free labelled sequent calculus for dynamic epistemic logic.
J. Log. Comput., 2020

2017
Analytic Cut and interpolation for bi-intuitionistic Logic.
Rev. Symb. Log., 2017

2014
Uniform interpolation in Substructural Logics.
Rev. Symb. Log., 2014

Modal twist-structures over residuated lattices.
Log. J. IGPL, 2014

2012
Crawley Completions of Residuated Lattices and Algebraic Completeness of Substructural Predicate Logics.
Stud Logica, 2012

Preface.
Stud Logica, 2012

On involutive FL e -monoids.
Arch. Math. Log., 2012

Glivenko theorems and negative translations in substructural predicate logics.
Arch. Math. Log., 2012

2011
Preface.
Fundam. Informaticae, 2011

2010
Interpolation Properties, Beth Definability Properties and Amalgamation Properties for Substructural Logics.
J. Log. Comput., 2010

Fuzzy logics from substructural perspective.
Fuzzy Sets Syst., 2010

Cut elimination and strong separation for substructural logics: An algebraic approach.
Ann. Pure Appl. Log., 2010

2009
Glivenko theorems revisited.
Ann. Pure Appl. Log., 2009

2008
An Algebraic Approach to Substructural Logics - An Overview.
Proceedings of the Interval / Probabilistic Uncertainty and Non-Classical Logics, 2008

Algebraic characterizations of variable separation properties.
Reports Math. Log., 2008

2006
Algebraization, Parametrized Local Deduction Theorem and Interpolation for Substructural Logics over FL.
Stud Logica, 2006

Glivenko theorems for substructural logics over FL.
J. Symb. Log., 2006

2004
Algebraic Aspects of Cut Elimination.
Stud Logica, 2004

2003
Closure Operators and Complete Embeddings of Residuated Lattices.
Stud Logica, 2003

2002
Kripke Semantics, Undecidability and Standard Completeness for Esteva and Godo's Logic MTL[forall].
Stud Logica, 2002

Completions of Algebras and Completeness of Modal and Substructural Logics.
Proceedings of the Advances in Modal Logic 4, papers from the fourth conference on "Advances in Modal logic," held in Toulouse, France, 30 September, 2002

2000
Remarks on Splittings in the Variety of Residuated Lattices.
Reports Math. Log., 2000

The Variety of Residuated Lattices is Generated by its Finite Simple Members.
Reports Math. Log., 2000

1998
A Syntactic Approach to Maksimova's Principle of Variable Separation for some Substructural Logics.
Notre Dame J. Formal Log., 1998

Rasiowa-Sikorski Lemma, Kripke Completeness of Predicte and Infinitary Modal Logics.
Proceedings of the Advances in Modal Logic 2, 1998

1997
Foreword: Non-standard Logics and Logical Aspects of Computer Science.
Theor. Comput. Sci., 1997

1996
Cut Elimination in Noncommutative Substructural Logics.
Reports Math. Log., 1996

1994
The finite model property for BCK arid BCIW.
Stud Logica, 1994

Extending Intuitionistic Linear Logic with Knotted Structural Rules.
Notre Dame J. Formal Log., 1994

1990
Intermediate Predicate Logics Determined by Ordinals.
J. Symb. Log., 1990

1988
On finite linear intermediate predicate logics.
Stud Logica, 1988

1987
Reflection Principles in Fragments of Peano Arithmetic.
Math. Log. Q., 1987

1986
Craig's interpolation theorem for the intuitionistic logic and its extensions - A semantical approach.
Stud Logica, 1986

1985
Semantical analysis of predicate logics without the contraction rule.
Stud Logica, 1985

Logics Without the Contraction Rule.
J. Symb. Log., 1985

1983
Pictures of Functions and Their Acceptability by Automata.
Theor. Comput. Sci., 1983

1980
Decidability Results on a Query Language for Data Bases with Incomplete Informations.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1979
Undecidability of the First-Order Arithmetic A[P(x), 2x, x+1].
J. Comput. Syst. Sci., 1979


  Loading...