3047 search results - page 11 / 610 » On the Meaning of Logical Completeness |
146
click to vote
CSL
1999
Springer
15 years 5 months ago
1999
Springer
We explain why the original proofs of P-Time completeness for Light Affine Logic and Light Linear Logic can not work, and we fully develop a working one.
167
click to vote
FASE
2008
Springer
15 years 7 months ago
2008
Springer
For a number of programming languages, among them Eiffel, C, Java and Ruby, Hoare-style logics and dynamic logics have been developed. In these logics, pre- and postconditions are ...
150
click to vote
IGPL
2002
15 years 5 months ago
2002
Fibring is defined as a mechanism for combining logics with a firstorder base, at both the semantic and deductive levels. A completeness theorem is established for a wide class of...
247
click to vote
CADE
2002
Springer
16 years 6 months ago
2002
Springer
Abstract. Description Logics are a family of class based knowledge representation formalisms characterised by the use of various constructors to build complex classes from simpler ...
169
click to vote
FSEN
2009
Springer
16 years 17 days ago
2009
Springer
We introduce a Hoare logic for higher-order functional languages with control operators such as callcc. The key idea is to build the assertion language and proof rules around an e...