An Institution-independent Generalization of Tarski's Elementary Chain Theorem. - Daniel Gâinâ; Andrei Popescu 001 (J. Log. Comput., 2006)

An Institution-Independent Proof of the Robinson Consistency Theorem. - Daniel Gâinâ; Andrei Popescu 001 (Stud Logica, 2007)

Birkhoff Completeness in Institutions. - Mihai Codescu; Daniel Gâinâ (Logica Universalis, 2008)

Constructor-Based Institutions. - Daniel Gâinâ; Kokichi Futatsugi; Kazuhiro Ogata 001 (CALCO, 2009)

Completeness by Forcing. - Daniel Gâinâ; Marius Petria (J. Log. Comput., 2010)

Constructor-based Logics. - Daniel Gâinâ; Kokichi Futatsugi; Kazuhiro Ogata 001 (J. Univers. Comput. Sci., 2012)

Principles of proof scores in CafeOBJ. - Kokichi Futatsugi; Daniel Gâinâ; Kazuhiro Ogata 001 (Theor. Comput. Sci., 2012)

Constructor-Based Inductive Theorem Prover. - Daniel Gâinâ; Min Zhang 002; Yuki Chiba; Yasuhito Arimoto (CALCO, 2013)

Interpolation in logics with constructors. - Daniel Gâinâ (Theor. Comput. Sci., 2013)

On Automation of OTS/CafeOBJ Method. - Daniel Gâinâ; Dorel Lucanu; Kazuhiro Ogata 001; Kokichi Futatsugi (Specification, Algebra, and Software, 2014)

Foundations of Logic Programming in Hybridised Logics. - Daniel Gâinâ (WADT, 2014)

Forcing, Downward Löwenheim-Skolem and Omitting Types Theorems, Institutionally. - Daniel Gâinâ (Logica Universalis, 2014)

Proving Sufficient Completeness of Constructor-Based Algebraic Specifications. - Masaki Nakamura 001; Daniel Gâinâ; Kazuhiro Ogata 001; Kokichi Futatsugi (CSA/CUTE, 2015)

Initial semantics in logics with constructors. - Daniel Gâinâ; Kokichi Futatsugi (J. Log. Comput., 2015)

Birkhoff style calculi for hybrid logics. - Daniel Gâinâ (Formal Aspects Comput., 2017)

Downward Löwenheim-Skolem Theorem and interpolation in logics with constructors. - Daniel Gâinâ (J. Log. Comput., 2017)

Foundations of logic programming in hybrid logics with user-defined sharing. - Daniel Gâinâ (Theor. Comput. Sci., 2017)

Specification and Verification of Invariant Properties of Transition Systems. - Daniel Gâinâ; Ionut Tutu; Adrián Riesco 001 (APSEC, 2018)

Birkhoff Completeness for Hybrid-Dynamic First-Order Logic. - Daniel Gâinâ; Ionut Tutu (TABLEAUX, 2019)

Horn Clauses in Hybrid-Dynamic First-Order Logic. - Daniel Gâinâ; Ionut Tutu (CoRR, 2019)

Forcing and Calculi for Hybrid Logics. - Daniel Gaina (J. ACM, 2020)

Fraïssé-Hintikka theorem in institutions. - Daniel Gaina; Tomasz Kowalski (J. Log. Comput., 2020)

Stability of termination and sufficient-completeness under pushouts via amalgamation. - Daniel Gaina; Masaki Nakamura 001; Kazuhiro Ogata 001; Kokichi Futatsugi (Theor. Comput. Sci., 2020)

Robinson consistency in many-sorted hybrid first-order logics. - Guillermo Badia; Tomasz Kowalski; Daniel Gaina (AiML, 2022)

Lindström's theorem, both syntax and semantics free. - Daniel Gaina; Tomasz Kowalski (J. Log. Comput., 2022)

Omitting types theorem in hybrid dynamic first-order logic with rigid symbols. - Daniel Gaina; Guillermo Badia; Tomasz Kowalski (Ann. Pure Appl. Log., 2023)

Birkhoff Style Proof Systems for Hybrid-Dynamic Quantum Logic. - Daniel Gaina (AiML, 2024)

Forcing, Transition Algebras, and Calculi. - Hashimoto Go; Daniel Gaina; Ionut Tutu (ICALP, 2024)

Foundations of logic programming in hybrid-dynamic quantum logic. - Daniel Gaina (CoRR, 2024)

Hybrid-Dynamic Ehrenfeucht-Fraïssé Games. - Guillermo Badia; Daniel Gaina; Alexander Knapp; Tomasz Kowalski; Martin Wirsing (CoRR, 2024)

Model-Theoretic Forcing in Transition Algebra. - Hashimoto Go; Daniel Gaina (MFCS, 2025)

Proof Scores: A Survey (full version). - Adrián Riesco 001; Kazuhiro Ogata 001; Masaki Nakamura 001; Daniel Gaina; Duong Dinh Tran; Kokichi Futatsugi (CoRR, 2025)

Proof Scores: A Survey. - Adrián Riesco 001; Kazuhiro Ogata 001; Masaki Nakamura 001; Daniel Gaina; Duong Dinh Tran; Kokichi Futatsugi (ACM Comput. Surv., 2025)