default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Gâinâ
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Daniel Gaina:
Birkhoff Style Proof Systems for Hybrid-Dynamic Quantum Logic. AiML 2024: 357-378- [c9]Hashimoto Go, Daniel Gaina, Ionut Tutu:
Forcing, Transition Algebras, and Calculi. ICALP 2024: 143:1-143:17 - [i5]Hashimoto Go, Daniel Gaina, Ionut Tutu:
Forcing, Transition Algebras, and Calculi. CoRR abs/2404.16111 (2024) - [i4]Daniel Gaina:
Foundations of logic programming in hybrid-dynamic quantum logic. CoRR abs/2406.02085 (2024) - [i3]Guillermo Badia, Daniel Gaina, Alexander Knapp, Tomasz Kowalski
, Martin Wirsing:
Hybrid-Dynamic Ehrenfeucht-Fraïssé Games. CoRR abs/2406.02094 (2024) - [i2]Daniel Gaina:
Birkhoff style proof systems for hybrid-dynamic quantum logic. CoRR abs/2406.13360 (2024) - 2023
- [j17]Daniel Gaina, Guillermo Badia, Tomasz Kowalski:
Omitting types theorem in hybrid dynamic first-order logic with rigid symbols. Ann. Pure Appl. Log. 174(3): 103212 (2023) - 2022
- [j16]Daniel Gaina, Tomasz Kowalski:
Lindström's theorem, both syntax and semantics free. J. Log. Comput. 32(5): 942-975 (2022) - [c8]Guillermo Badia, Tomasz Kowalski, Daniel Gaina:
Robinson consistency in many-sorted hybrid first-order logics. AiML 2022: 407-428 - 2020
- [j15]Daniel Gaina:
Forcing and Calculi for Hybrid Logics. J. ACM 67(4): 25:1-25:55 (2020) - [j14]Daniel Gaina, Tomasz Kowalski:
Fraïssé-Hintikka theorem in institutions. J. Log. Comput. 30(7): 1377-1399 (2020) - [j13]Daniel Gaina, Masaki Nakamura, Kazuhiro Ogata, Kokichi Futatsugi:
Stability of termination and sufficient-completeness under pushouts via amalgamation. Theor. Comput. Sci. 848: 82-105 (2020)
2010 – 2019
- 2019
- [c7]Daniel Gâinâ, Ionut Tutu:
Birkhoff Completeness for Hybrid-Dynamic First-Order Logic. TABLEAUX 2019: 277-293 - [i1]Daniel Gâinâ, Ionut Tutu:
Horn Clauses in Hybrid-Dynamic First-Order Logic. CoRR abs/1905.04146 (2019) - 2018
- [c6]Daniel Gâinâ, Ionut Tutu, Adrián Riesco:
Specification and Verification of Invariant Properties of Transition Systems. APSEC 2018: 99-108 - 2017
- [j12]Daniel Gâinâ:
Birkhoff style calculi for hybrid logics. Formal Aspects Comput. 29(5): 805-832 (2017) - [j11]Daniel Gâinâ:
Downward Löwenheim-Skolem Theorem and interpolation in logics with constructors. J. Log. Comput. 27(6): 1717-1752 (2017) - [j10]Daniel Gâinâ:
Foundations of logic programming in hybrid logics with user-defined sharing. Theor. Comput. Sci. 686: 1-24 (2017) - 2015
- [j9]Daniel Gâinâ, Kokichi Futatsugi:
Initial semantics in logics with constructors. J. Log. Comput. 25(1): 95-116 (2015) - [c5]Masaki Nakamura, Daniel Gâinâ, Kazuhiro Ogata, Kokichi Futatsugi:
Proving Sufficient Completeness of Constructor-Based Algebraic Specifications. CSA/CUTE 2015: 15-21 - 2014
- [j8]Daniel Gâinâ:
Forcing, Downward Löwenheim-Skolem and Omitting Types Theorems, Institutionally. Logica Universalis 8(3-4): 469-498 (2014) - [c4]Daniel Gâinâ, Dorel Lucanu, Kazuhiro Ogata, Kokichi Futatsugi:
On Automation of OTS/CafeOBJ Method. Specification, Algebra, and Software 2014: 578-602 - [c3]Daniel Gâinâ:
Foundations of Logic Programming in Hybridised Logics. WADT 2014: 69-89 - 2013
- [j7]Daniel Gâinâ:
Interpolation in logics with constructors. Theor. Comput. Sci. 474: 46-59 (2013) - [c2]Daniel Gâinâ, Min Zhang, Yuki Chiba, Yasuhito Arimoto:
Constructor-Based Inductive Theorem Prover. CALCO 2013: 328-333 - 2012
- [j6]Daniel Gâinâ, Kokichi Futatsugi, Kazuhiro Ogata:
Constructor-based Logics. J. Univers. Comput. Sci. 18(16): 2204-2233 (2012) - [j5]Kokichi Futatsugi, Daniel Gâinâ, Kazuhiro Ogata:
Principles of proof scores in CafeOBJ. Theor. Comput. Sci. 464: 90-112 (2012) - 2010
- [j4]Daniel Gâinâ, Marius Petria:
Completeness by Forcing. J. Log. Comput. 20(6): 1165-1186 (2010)
2000 – 2009
- 2009
- [c1]Daniel Gâinâ, Kokichi Futatsugi, Kazuhiro Ogata:
Constructor-Based Institutions. CALCO 2009: 398-412 - 2008
- [j3]Mihai Codescu, Daniel Gâinâ:
Birkhoff Completeness in Institutions. Logica Universalis 2(2): 277-309 (2008) - 2007
- [j2]Daniel Gâinâ, Andrei Popescu:
An Institution-Independent Proof of the Robinson Consistency Theorem. Stud Logica 85(1): 41-73 (2007) - 2006
- [j1]Daniel Gâinâ, Andrei Popescu:
An Institution-independent Generalization of Tarski's Elementary Chain Theorem. J. Log. Comput. 16(6): 713-735 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
