1679 search results - page 44 / 336 » Strong order equivalence |
143
click to vote
JSYML
2002
15 years 4 months ago
2002
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
137
click to vote
RTA
2000
Springer
15 years 8 months ago
2000
Springer
Linear Second-Order Unification and Context Unification are closely related problems. However, their equivalence was never formally proved. Context unification is a restriction of ...
136
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
119
click to vote
ANOR
2005
15 years 4 months ago
2005
In this paper we consider a finite-state financial market with non-proportional transaction cost and bid-ask spreads. The transaction cost consists of two parts: a fixed cost and a...
109
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We construct a canonical extension for strong proximity lattices in order to give an algebraic, point-free description of a finitary duality for stably compact spaces.