2018
DOI: 10.1016/j.tcs.2017.11.005
|View full text |Cite
|
Sign up to set email alerts
|

Kripke semantics for higher-order type theory applied to constraint logic programming languages

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 43 publications
0
2
0
Order By: Relevance
“…However, as LDL is a richer language, we may no longer rely on this method. For a typed FOL, one could define a Kripke-style semantics [35,26] for characterising the set of all true formulae, or take provable FOL formulae to characterise the set of true FOL formulae. We take the latter approach.…”
Section: Soundness and Completeness Of Dlsmentioning
confidence: 99%
“…However, as LDL is a richer language, we may no longer rely on this method. For a typed FOL, one could define a Kripke-style semantics [35,26] for characterising the set of all true formulae, or take provable FOL formulae to characterise the set of true FOL formulae. We take the latter approach.…”
Section: Soundness and Completeness Of Dlsmentioning
confidence: 99%
“…However, as LDL is equipped with quantifiers such a procedure is no longer decidable, we may no longer rely on this method. For a typed FOL, one could define a Kripke-style semantics [36,27] for characterising the set of all true formulae, or take provable FOL formulae to characterise the set of true FOL formulae. In this section we take the latter approach.…”
Section: Soundness and Completeness Of Dlsmentioning
confidence: 99%