3047 search results - page 105 / 610 » On the Meaning of Logical Completeness |
ENTCS
2010
13 years 11 months ago
2010
We formulate a unified display calculus proof theory for the four principal varieties of bunched logic by combining display calculi for their component logics. Our calculi satisfy...
MLQ
2000
13 years 10 months ago
2000
: Each information system (or data table) leads to a hierarchy of binary relations on the object set in a natural way; these relational systems can serve as frames for the semantic...
TCS
2002
13 years 10 months ago
2002
We study proof systems for reasoning about logical consequences and refinement of structured specifications, based on similar systems proposed earlier in the literature [ST 88, Wi...
LATIN
2004
Springer
14 years 4 months ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
FSTTCS
1999
Springer
14 years 3 months ago
1999
Springer
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...