Name
Abstract | ||
|---|---|---|
We develop an abstract proof calculus for hybrid logics whose sentences are (hybrid) Horn clauses, and we prove a Birkhoff completeness theorem for hybrid logics in the general setting provided by the institution theory. This result is then applied to particular cases of hybrid logics with user-defined sharing, where the first-order variables in quantified sentences are interpreted uniformly across worlds. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s00165-016-0414-y | Formal Asp. Comput. |
Keywords | Field | DocType |
Institution, Horn clause, Birkhoff calculus, Hybrid logic, Reconfigurable system | T-norm fuzzy logics,Discrete mathematics,Hybrid logic,Horn clause,Gödel's completeness theorem,Computer science,Proof calculus | Journal |
Volume | Issue | ISSN |
29 | 5 | 1433-299X |
Citations | PageRank | References |
0 | 0.34 | 28 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Găină | 1 | 42 | 5.30 |