An institution-independent proof of the Robinson consistency theorem D Gaina, A Popescu Studia Logica 85 (1), 41-73, 2007 | 46 | 2007 |

Principles of proof scores in CafeOBJ K Futatsugi, D Găină, K Ogata Theoretical Computer Science 464, 90-112, 2012 | 44 | 2012 |

Birkhoff Completeness in Institutions M Codescu, D Gaina Logica Universalis 2 (2), 277-309, 2008 | 32 | 2008 |

Completeness by forcing D Găină, M Petria Journal of Logic and Computation 20 (6), 1165-1186, 2010 | 30 | 2010 |

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 | 24 | 2006 |

Constructor-based inductive theorem prover D Găină, M Zhang, Y Chiba, Y Arimoto Algebra and Coalgebra in Computer Science: 5th International Conference …, 2013 | 21 | 2013 |

Birkhoff style calculi for hybrid logics D Găină Formal Aspects of Computing 29, 805-832, 2017 | 19 | 2017 |

Initial semantics in logics with constructors D Găină, K Futatsugi Journal of Logic and Computation 25 (1), 95-116, 2015 | 17 | 2015 |

Forcing and Calculi for Hybrid Logics D Găină Journal of the ACM (JACM) 67 (4), 1-55, 2020 | 16 | 2020 |

Downward Löwenheim–Skolem Theorem and interpolation in logics with constructors D Găină Journal of Logic and Computation 27 (6), 1717-1752, 2017 | 16 | 2017 |

Foundations of logic programming in hybrid logics with user-defined sharing D Găină Theoretical Computer Science 686, 1-24, 2017 | 15 | 2017 |

On automation of OTS/CafeOBJ method D Găină, D Lucanu, K Ogata, K Futatsugi Specification, Algebra, and Software, 578-602, 2014 | 14 | 2014 |

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 | 12 | 2018 |

Interpolation in logics with constructors D Găină Theoretical Computer Science 474, 46-59, 2013 | 12 | 2013 |

Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally D Găină Logica Universalis 8 (3), 469-498, 2014 | 10 | 2014 |

Constructor-based institutions D Găină, K Futatsugi, K Ogata International Conference on Algebra and Coalgebra in Computer Science, 398-412, 2009 | 9 | 2009 |

Foundations of logic programming in hybridised logics D Găină Recent Trends in Algebraic Development Techniques: 22nd International …, 2015 | 8 | 2015 |

Birkhoff completeness for hybrid-dynamic first-order logic D Găină, I Ţuţu Automated Reasoning with Analytic Tableaux and Related Methods: 28th …, 2019 | 6 | 2019 |

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 | 2 | 2020 |