Daniel Gâinâ

CoRR, 2024

Forcing, Transition Algebras, and Calculi.

[BibT_eX]

[DOI]

Hashimoto Go

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Birkhoff Style Proof Systems for Hybrid-Dynamic Quantum Logic.

[BibT_eX]

Proceedings of the Advances in Modal Logic, AiML 2024, Prague, Czech Republic, 2024

2023

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

[BibT_eX]

[DOI]

Guillermo Badia

Ann. Pure Appl. Log., 2023

2022

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

[BibT_eX]

[DOI]

J. Log. Comput., 2022

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

[BibT_eX]

[DOI]

Guillermo Badia

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

2020

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Fraïssé-Hintikka theorem in institutions.

[BibT_eX]

[DOI]

J. Log. Comput., 2020

Forcing and Calculi for Hybrid Logics.

[BibT_eX]

[DOI]

J. ACM, 2020

2019

Horn Clauses in Hybrid-Dynamic First-Order Logic.

[BibT_eX]

[DOI]

CoRR, 2019

Birkhoff Completeness for Hybrid-Dynamic First-Order Logic.

[BibT_eX]

[DOI]

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

2018

Specification and Verification of Invariant Properties of Transition Systems.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

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

[BibT_eX]

[DOI]

J. Log. Comput., 2017

Birkhoff style calculi for hybrid logics.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2017

2015

Initial semantics in logics with constructors.

[BibT_eX]

[DOI]

J. Log. Comput., 2015

Proving Sufficient Completeness of Constructor-Based Algebraic Specifications.

[BibT_eX]

[DOI]

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

2014

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

[BibT_eX]

[DOI]

Logica Universalis, 2014

Foundations of Logic Programming in Hybridised Logics.

[BibT_eX]

[DOI]

Proceedings of the Recent Trends in Algebraic Development Techniques, 2014

On Automation of OTS/CafeOBJ Method.

[BibT_eX]

[DOI]

Proceedings of the Specification, Algebra, and Software, 2014

2013

Interpolation in logics with constructors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Constructor-Based Inductive Theorem Prover.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Coalgebra in Computer Science, 2013

2012

Principles of proof scores in CafeOBJ.

[BibT_eX]

[DOI]

Kazuhiro Ogata

Theor. Comput. Sci., 2012

Constructor-based Logics.

[BibT_eX]

[DOI]

Kazuhiro Ogata

J. Univers. Comput. Sci., 2012

2010

Completeness by Forcing.

[BibT_eX]

[DOI]

Marius Petria

J. Log. Comput., 2010

2009

Constructor-Based Institutions.

[BibT_eX]

[DOI]

Kazuhiro Ogata

Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008

Birkhoff Completeness in Institutions.

[BibT_eX]

[DOI]

Mihai Codescu

Logica Universalis, 2008

2007

An Institution-Independent Proof of the Robinson Consistency Theorem.

[BibT_eX]

[DOI]

Andrei Popescu

Stud Logica, 2007

2006

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

[BibT_eX]

[DOI]