AbstractWe introduce the new concept of weak expressivity of models for Hoare logic. It turns out that complete models are weakly expressive. Using the new concept, we prove that a model is expressive iff the domain of every program is definable
In this paper a generalization of a certain theorem of Lipton (“Proc. 18th IEEE Sympos. Found. of Co...
AbstractWe study the expressive of two semantics far deductive databases and logic programming: the ...
This paper completes an investigation of the logical expressibility of finite, locally stratified, g...
Three theorems are proven which reconsider the completeness of Hoare's logic for the partial correct...
AbstractA well-known result of Cook asserts the completeness of Hoare's logic for while-programs rel...
Abstract. We investigate the completeness of Hoare Logic on the propositional level. In particular, ...
AbstractThree theorems are proven which reconsider the completeness of Hoare's logic for the partial...
We investigate the completeness of Hoare Logic on the propositional level. In particular, the expre...
We consider the completeness of Hoare’s logic with a first-order assertion language applied to whil...
AbstractWe consider the completeness of Hoare's logic with a first-order assertion language applied ...
We analyze the relative expressiveness of the two-valued semantics of abstract argumentation framewo...
We study two notions of expressiveness, which have appeared in abstraction theory for model checking...
Abstract This paper investigates the question “when is a logic more expressive than another?” In ord...
How can we prove that some fragment of a given logic has the power to define precisely all structura...
AbstractIn this note two issues concerning completeness of Hoare-like proof systems which seem unrel...
In this paper a generalization of a certain theorem of Lipton (“Proc. 18th IEEE Sympos. Found. of Co...
AbstractWe study the expressive of two semantics far deductive databases and logic programming: the ...
This paper completes an investigation of the logical expressibility of finite, locally stratified, g...
Three theorems are proven which reconsider the completeness of Hoare's logic for the partial correct...
AbstractA well-known result of Cook asserts the completeness of Hoare's logic for while-programs rel...
Abstract. We investigate the completeness of Hoare Logic on the propositional level. In particular, ...
AbstractThree theorems are proven which reconsider the completeness of Hoare's logic for the partial...
We investigate the completeness of Hoare Logic on the propositional level. In particular, the expre...
We consider the completeness of Hoare’s logic with a first-order assertion language applied to whil...
AbstractWe consider the completeness of Hoare's logic with a first-order assertion language applied ...
We analyze the relative expressiveness of the two-valued semantics of abstract argumentation framewo...
We study two notions of expressiveness, which have appeared in abstraction theory for model checking...
Abstract This paper investigates the question “when is a logic more expressive than another?” In ord...
How can we prove that some fragment of a given logic has the power to define precisely all structura...
AbstractIn this note two issues concerning completeness of Hoare-like proof systems which seem unrel...
In this paper a generalization of a certain theorem of Lipton (“Proc. 18th IEEE Sympos. Found. of Co...
AbstractWe study the expressive of two semantics far deductive databases and logic programming: the ...
This paper completes an investigation of the logical expressibility of finite, locally stratified, g...
DOI
Add to ORKG