27 search results - page 3 / 6 » A proof of completeness for continuous first-order logic |
JSYML
2010
13 years 4 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) ...
ICTL
1994
13 years 9 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...
ASIAN
2006
Springer
13 years 9 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
13 years 5 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
13 years 5 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'...