Go home now Header Background Image
Search
Submission Procedure
share: |
 
Follow us
 
 
 
 
Volume 18 / Issue 16

available in:   PDF (167 kB) PS (158 kB)
 
get:  
Similar Docs BibTeX   Write a comment
  
get:  
Links into Future
 
DOI:   10.3217/jucs-018-16-2204

 

Constructor-based Logics

Daniel Găină (Japan Advanced Institute of Science and Technology, Japan)

Kokichi Futatsugi (Japan Advanced Institute of Science and Technology, Japan)

Kazuhiro Ogata (Japan Advanced Institute of Science and Technology, Japan)

Abstract: Many computer science applications concern properties that are true for a restricted class of models. In this paper, a couple of constructor-based institutions are presented. These institutions are defined on top of some base institutions, roughly speaking, by enhancing the syntax with constructor symbols and restricting the semantics to models with elements that are reachable by constructors. The proof rules for the constructor-based Horn logics, formalized asinstitutions, are defined in this paper, and a proof of completeness is provided in the abstract framework of institutions..

Keywords: Horn logic, completeness, constructor, induction, institution, proof theory

Categories: F.3, F.4