• Publications
  • Influence
Constructor-Based Inductive Theorem Prover
TLDR
Constructor-based Theorem Prover (CITP) is a tool for proving inductive properties of software systems specified with constructor-based logics. Expand
  • 15
  • 4
An Institution-Independent Proof of the Robinson Consistency Theorem
TLDR
We prove an institutional version of A. Robinson's Consistency Theorem for many-sorted first-order predicate logic. Expand
  • 28
  • 2
  • PDF
Constructor-based Logics
TLDR
We give an institution-independent definition of reachable model, and we apply it to obtain a new institution by enhancing the syntax of a base institution with constructors and restricting the semantics to reachable models. Expand
  • 19
  • 2
  • PDF
Completeness by Forcing
TLDR
We express and prove the completeness of infinitary firstorder logics in the institution-independent setting by using forcing, a powerful method for constructing models. Expand
  • 17
  • 1
  • PDF
On Automation of OTS/CafeOBJ Method
TLDR
In this paper we propose a methodology that aims at developing automatically proof scores according to the rules of an entailment system. Expand
  • 13
  • 1
  • PDF
An Institution-independent Generalization of Tarski's Elementary Chain Theorem
TLDR
We prove an institutional version of Tarski's elementary chain theorem applicable to a whole plethora of ‘first-orderaccessible’ logics, which are, roughly speaking, logics whose sentences can be constructed from atomic formulae by means of classical first-order connectives and quantifiers. Expand
  • 14
  • 1
  • PDF
Birkhoff style calculi for hybrid logics
  • Daniel Gâinâ
  • Computer Science, Mathematics
  • Formal Aspects of Computing
  • 31 January 2017
TLDR
We develop an abstract proof calculus for hybrid logics whose sentences are (hybrid) Horn clauses, and we prove a Birkhoff completeness theorem in the general setting provided by the institution theory. Expand
  • 11
  • 1
  • PDF
Downward Löwenheim-Skolem Theorem and interpolation in logics with constructors
  • Daniel Gâinâ
  • Mathematics, Computer Science
  • J. Log. Comput.
  • 1 September 2017
TLDR
The present paper describes a method for proving Downward Lowenheim-Skolem Theorem within an arbitrary institution satisfying certain logic properties. Expand
  • 5
  • 1
  • PDF
Forcing, Downward Löwenheim-Skolem and Omitting Types Theorems, Institutionally
TLDR
In the context of proliferation of many logical systems in the area of mathematical logic and computer science, we present a generalization of forcing in institution-independent model theory which is used to prove two abstract results: Downward Löwenheim-Skolem Theorem and Omitting Types Theorem. Expand
  • 6
  • 1
  • PDF
Foundations of logic programming in hybrid logics with user-defined sharing
  • Daniel Gâinâ
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 22 July 2017
TLDR
Abstract The present contribution advances an abstract notion of hybrid logic by supplementing the definition of institution with an additional structure to extract frames. Expand
  • 6
  • 1
  • PDF
...
1
2
3
...