41 search results - page 8 / 9 » A Unified Completeness Theorem for Quantified Modal Logics |
CORR
2006
Springer
13 years 6 months ago
2006
Springer
In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general m...
CADE
2005
Springer
14 years 6 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
CADE
2005
Springer
14 years 6 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
JLP
2006
13 years 6 months ago
2006
We introduce CoCasl as a light-weight but expressive coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatype...
KI
2010
Springer
13 years 24 days ago
2010
Springer
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equa...