Sciweavers

159 search results - page 22 / 32
» Weak Equivalences in Psi-Calculi
Sort
View
112
Voted
ORDER
2006
99views more  ORDER 2006»
15 years 18 days ago
Countably Complementable Linear Orderings
We say that a countable linear ordering L is countably complementable if there exists a linear ordering L, possibly uncountable, such that for any countable linear ordering B, L do...
Antonio Montalbán
109
Voted
PODS
2010
ACM
197views Database» more  PODS 2010»
15 years 26 days ago
When data dependencies over SQL tables meet the logics of paradox and S-3
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
Sven Hartmann, Sebastian Link
82
Voted
IANDC
2006
113views more  IANDC 2006»
15 years 20 days ago
Automata and fixed point logic: A coalgebraic perspective
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
Yde Venema
85
Voted
ANOR
2005
83views more  ANOR 2005»
15 years 17 days ago
Optimal Consumption Portfolio and No-Arbitrage with Nonproportional Transaction Costs
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...
Xiuli Chao, K. K. Lai, Shouyang Wang, Mei Yu
86
Voted
MLQ
2007
65views more  MLQ 2007»
15 years 5 days ago
Non-standard analysis in ACA0 and Riemann mapping theorem
Abstract. This research is motivated by the program of Reverse Mathematics and non-standard arguments in second-order arithmetic. Within a weak subsystem of second order arithmetic...
Keita Yokoyama