Follow
Daniel GAINA
Daniel GAINA
Institute of Mathematics for Industry, Kyushu University
Verified email at imi.kyushu-u.ac.jp - Homepage
Title
Cited by
Cited by
Year
An institution-independent proof of the Robinson consistency theorem
D Gaina, A Popescu
Studia Logica 85 (1), 41-73, 2007
462007
Principles of proof scores in CafeOBJ
K Futatsugi, D Găină, K Ogata
Theoretical Computer Science 464, 90-112, 2012
442012
Birkhoff Completeness in Institutions
M Codescu, D Gaina
Logica Universalis 2 (2), 277-309, 2008
322008
Completeness by forcing
D Găină, M Petria
Journal of Logic and Computation 20 (6), 1165-1186, 2010
302010
Constructor-based Logics.
D Găină, K Futatsugi, K Ogata
J. UCS 18 (16), 2204-2233, 2012
26*2012
An institution-independent generalization of Tarski's Elementary Chain Theorem
D Găină, A Popescu
Journal of Logic and Computation 16 (6), 713-735, 2006
242006
Constructor-based inductive theorem prover
D Găină, M Zhang, Y Chiba, Y Arimoto
Algebra and Coalgebra in Computer Science: 5th International Conference …, 2013
212013
Birkhoff style calculi for hybrid logics
D Găină
Formal Aspects of Computing 29, 805-832, 2017
192017
Initial semantics in logics with constructors
D Găină, K Futatsugi
Journal of Logic and Computation 25 (1), 95-116, 2015
172015
Forcing and Calculi for Hybrid Logics
D Găină
Journal of the ACM (JACM) 67 (4), 1-55, 2020
162020
Downward Löwenheim–Skolem Theorem and interpolation in logics with constructors
D Găină
Journal of Logic and Computation 27 (6), 1717-1752, 2017
162017
Foundations of logic programming in hybrid logics with user-defined sharing
D Găină
Theoretical Computer Science 686, 1-24, 2017
152017
On automation of OTS/CafeOBJ method
D Găină, D Lucanu, K Ogata, K Futatsugi
Specification, Algebra, and Software, 578-602, 2014
142014
Specification and verification of invariant properties of transition systems
D Gaina, I Tutu, A Riesco
2018 25th Asia-Pacific Software Engineering Conference (APSEC), 99-108, 2018
122018
Interpolation in logics with constructors
D Găină
Theoretical Computer Science 474, 46-59, 2013
122013
Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally
D Găină
Logica Universalis 8 (3), 469-498, 2014
102014
Constructor-based institutions
D Găină, K Futatsugi, K Ogata
International Conference on Algebra and Coalgebra in Computer Science, 398-412, 2009
92009
Foundations of logic programming in hybridised logics
D Găină
Recent Trends in Algebraic Development Techniques: 22nd International …, 2015
82015
Birkhoff completeness for hybrid-dynamic first-order logic
D Găină, I Ţuţu
Automated Reasoning with Analytic Tableaux and Related Methods: 28th …, 2019
62019
Stability of termination and sufficient-completeness under pushouts via amalgamation
D Găină, M Nakamura, K Ogata, K Futatsugi
Theoretical Computer Science, 1-24, 2020
22020
The system can't perform the operation now. Try again later.
Articles 1–20