Daniel Gâinâ

According to our database, Daniel Gâinâ authored at least 26 papers between 2006 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Omitting types theorem in hybrid dynamic first-order logic with rigid symbols.

Daniel Gaina, Guillermo Badia, Tomasz Kowalski

Ann. Pure Appl. Log., 2023

2022

Lindström's theorem, both syntax and semantics free.

Daniel Gaina, Tomasz Kowalski

J. Log. Comput., 2022

Robinson consistency in many-sorted hybrid first-order logics.

Guillermo Badia, Tomasz Kowalski, Daniel Gaina

Proceedings of the Advances in Modal Logic, AiML 2022, Rennes, France, 2022

2020

Stability of termination and sufficient-completeness under pushouts via amalgamation.

Daniel Gaina, Masaki Nakamura, Kazuhiro Ogata, Kokichi Futatsugi

Theor. Comput. Sci., 2020

Fraïssé-Hintikka theorem in institutions.

Daniel Gaina, Tomasz Kowalski

J. Log. Comput., 2020

Forcing and Calculi for Hybrid Logics.

Daniel Gaina

J. ACM, 2020

2019

Horn Clauses in Hybrid-Dynamic First-Order Logic.

Daniel Gâinâ, Ionut Tutu

CoRR, 2019

Birkhoff Completeness for Hybrid-Dynamic First-Order Logic.

Daniel Gâinâ, Ionut Tutu

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019

2018

Specification and Verification of Invariant Properties of Transition Systems.

Daniel Gâinâ, Ionut Tutu, Adrián Riesco

Proceedings of the 25th Asia-Pacific Software Engineering Conference, 2018

2017

Foundations of logic programming in hybrid logics with user-defined sharing.

Daniel Gâinâ

Theor. Comput. Sci., 2017

Downward Löwenheim-Skolem Theorem and interpolation in logics with constructors.

Daniel Gâinâ

J. Log. Comput., 2017

Birkhoff style calculi for hybrid logics.

Daniel Gâinâ

Formal Aspects Comput., 2017

2015

Initial semantics in logics with constructors.

Daniel Gâinâ, Kokichi Futatsugi

J. Log. Comput., 2015

Proving Sufficient Completeness of Constructor-Based Algebraic Specifications.

Masaki Nakamura, Daniel Gâinâ, Kazuhiro Ogata, Kokichi Futatsugi

Proceedings of the Advances in Computer Science and Ubiquitous Computing, 2015

2014

Forcing, Downward Löwenheim-Skolem and Omitting Types Theorems, Institutionally.

Daniel Gâinâ

Logica Universalis, 2014

Foundations of Logic Programming in Hybridised Logics.

Daniel Gâinâ

Proceedings of the Recent Trends in Algebraic Development Techniques, 2014

On Automation of OTS/CafeOBJ Method.

Daniel Gâinâ, Dorel Lucanu, Kazuhiro Ogata, Kokichi Futatsugi

Proceedings of the Specification, Algebra, and Software, 2014

2013

Interpolation in logics with constructors.

Daniel Gâinâ

Theor. Comput. Sci., 2013

Constructor-Based Inductive Theorem Prover.

Daniel Gâinâ, Min Zhang, Yuki Chiba, Yasuhito Arimoto

Proceedings of the Algebra and Coalgebra in Computer Science, 2013

2012

Principles of proof scores in CafeOBJ.

Kokichi Futatsugi, Daniel Gâinâ, Kazuhiro Ogata

Theor. Comput. Sci., 2012

Constructor-based Logics.

Daniel Gâinâ, Kokichi Futatsugi, Kazuhiro Ogata

J. Univers. Comput. Sci., 2012

2010

Completeness by Forcing.

Daniel Gâinâ, Marius Petria

J. Log. Comput., 2010

2009

Constructor-Based Institutions.

Daniel Gâinâ, Kokichi Futatsugi, Kazuhiro Ogata

Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008

Birkhoff Completeness in Institutions.

Mihai Codescu, Daniel Gâinâ

Logica Universalis, 2008

2007

An Institution-Independent Proof of the Robinson Consistency Theorem.

Daniel Gâinâ, Andrei Popescu

Stud Logica, 2007

2006

An Institution-independent Generalization of Tarski's Elementary Chain Theorem.

Daniel Gâinâ, Andrei Popescu

J. Log. Comput., 2006