27 search results - page 3 / 6 » A proof of completeness for continuous first-order logic |
93
Voted
JSYML
2010
14 years 10 months ago
2010
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
114
click to vote
ICTL
1994
15 years 3 months ago
1994
We introduce a temporal logic TAL and prove that it has several nice features. The formalism is a two-dimensional modal system in the sense that formulas of the language are evalua...
114
click to vote
ASIAN
2006
Springer
15 years 3 months ago
2006
Springer
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
AML
2006
14 years 11 months ago
2006
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...