| Publication | Date of Publication | Type |
|---|
A modular bisimulation characterisation for fragments of hybrid logic
| 2023-12-22 | Paper |
Robinson consistency in many-sorted hybrid first-order logics
| 2023-03-24 | Paper |
Omitting types theorem in hybrid dynamic first-order logic with rigid symbols
Annals of Pure and Applied Logic | 2022-12-23 | Paper |
Lindström’s theorem, both syntax and semantics free
Journal Of Logic And Computation | 2022-09-22 | Paper |
Robinson consistency in many-sorted hybrid first-order logics
| 2022-08-18 | Paper |
Omitting Types Theorem in hybrid-dynamic first-order logic with rigid symbols
| 2022-03-09 | Paper |
Stability of termination and sufficient-completeness under pushouts via amalgamation
Theoretical Computer Science | 2020-12-15 | Paper |
Fraïssé–Hintikka theorem in institutions
Journal Of Logic And Computation | 2020-12-15 | Paper |
Forcing and calculi for hybrid logics
Journal of the ACM | 2020-11-11 | Paper |
Birkhoff completeness for hybrid-dynamic first-order logic
| 2020-05-14 | Paper |
Downward Löwenheim-Skolem theorem and interpolation in logics with constructors
Journal Of Logic And Computation | 2018-02-13 | Paper |
Birkhoff style calculi for hybrid logics
Formal Aspects of Computing | 2017-11-29 | Paper |
Foundations of logic programming in hybrid logics with user-defined sharing
Theoretical Computer Science | 2017-06-15 | Paper |
Constructor-based logics
Journal of Universal Computer Science | 2016-07-08 | Paper |
Foundations of Logic Programming in Hybridised Logics
Recent Trends in Algebraic Development Techniques | 2016-02-25 | Paper |
Initial semantics in logics with constructors
Journal Of Logic And Computation | 2015-02-26 | Paper |
Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally
Logica Universalis | 2015-02-05 | Paper |
On Automation of OTS/CafeOBJ Method
Specification, Algebra, and Software | 2014-03-25 | Paper |
Constructor-Based Inductive Theorem Prover
Algebra and Coalgebra in Computer Science | 2013-09-13 | Paper |
Interpolation in logics with constructors
Theoretical Computer Science | 2013-03-27 | Paper |
Principles of proof scores in CafeOBJ
Theoretical Computer Science | 2013-01-07 | Paper |
Constructor-based institutions
Algebra and Coalgebra in Computer Science | 2012-06-01 | Paper |
Completeness by forcing
Journal Of Logic And Computation | 2011-01-19 | Paper |
Birkhoff completeness in institutions
Logica Universalis | 2009-02-17 | Paper |
An institution-independent proof of the Robinson consistency theorem
Studia Logica | 2007-04-26 | Paper |
An Institution-independent Generalization of Tarski's Elementary Chain Theorem
Journal Of Logic And Computation | 2007-04-13 | Paper |
