Axiomatization of a Denotational Semantics for First-order Logic

Vermeulen, C. F. M.

doi:10.1093/jigpal/12.4.277

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This a clearly an interesting task for future research. As a starting point for such investigations we see [14]. There the axiomatization and decidability of the denotational semantics in Apt's [1] is discussed in a way that allows us to estimate upperbounds for the complexity of the semantics.…”

Section: Proof: [Preservation] Atomsmentioning

confidence: 99%

More Computation Power for a Denotational Semantics for First Order Logic

Vermeulen

2003

Computer Science Logic

View full text Add to dashboard Cite

In this paper we adapt the definitions and results from Apt and Vermeulen in [4] to include important ideas about search and choice into the system. We give motivating examples. Then we set up denotational semantics for first order logic along the lines of Apt [1] and Apt and Vermeulen [4]. The semantic universe includes states that consist of two components: a substitution, which can be seen as the computed answer; and a constraint satisfaction problem, which can be seen as the residue of the original problem, yet to be handled by constraint programming. In the set up the interaction between these components is regulated by an operator called infer. In this paper we regard infer as an operator on sets of states to enable us to analyze ideas about search among states and choice between states.The precise adaptations of definitions and results are able to deal with the examples and we show that given several reasonable conditions, the new definitions ensure soundness of the system with respect to the standard interpretation of first order logic. In this way the 'reasonable conditions' can be read as conditions for sound search. We indicate briefly how to investigate efficiency of search in future research. C 0 = x 2 = 1 ; ǫ

show abstract

Section: Proof: [Preservation] Atomsmentioning

confidence: 99%

More Computation Power for a Denotational Semantics for First Order Logic

Vermeulen

2003

Computer Science Logic

View full text Add to dashboard Cite

show abstract

Axiomatization of a Denotational Semantics for First-order Logic

Cited by 1 publication

References 0 publications

More Computation Power for a Denotational Semantics for First Order Logic

More Computation Power for a Denotational Semantics for First Order Logic

Contact Info

Product

Resources

About