Sciweavers

1969 search results - page 99 / 394
» Financial Theory 1
Sort
View
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
14 years 10 months ago
Random graphs and the parity quantifier
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
Phokion G. Kolaitis, Swastik Kopparty
SIGACT
2008
103views more  SIGACT 2008»
13 years 10 months ago
Computational geometry column 50
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
Joseph O'Rourke
SOCO
2008
Springer
13 years 10 months ago
Strong non-standard completeness for fuzzy logics
In this paper we are going to introduce the notion of strong non-standard completeness (SNSC) for fuzzy logics. This notion naturally arises from the well known construction by ul...
Tommaso Flaminio
JSYML
2007
62views more  JSYML 2007»
13 years 10 months ago
A reduction of the NF consistency problem
We give a necessary and sufficient condition in order that a typeshifting automorphism be constructed on a model of the Theory of Simple Types (TST) by forcing. Namely it is prove...
Athanassios Tzouvaras
APPML
2011
13 years 5 months ago
An operator theoretical approach to a class of fractional order differential equations
We propose a general method to obtain the representation of solutions for linear fractional order differential equations based on the theory of (a, k)-regularized families of oper...
Carlos Lizama