181 search results - page 19 / 37 » On Quantification with A Finite Universe |
APAL
2006
13 years 7 months ago
2006
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence c...
BMCBI
2010
13 years 8 months ago
2010
Background: The importance of stochasticity in cellular processes having low number of molecules has resulted in the development of stochastic models such as chemical master equat...
SIAMREV
2010
13 years 2 months ago
2010
In this paper we propose and analyze a Stochastic-Collocation method to solve elliptic Partial Differential Equations with random coefficients and forcing terms (input data of the...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
TARK
2005
Springer
14 years 1 months ago
2005
Springer
s for Multi-Agent Only Knowing (extended abstract) Arild Waaler1,2 and Bjørnar Solhaug3,4 1 Finnmark College, Norway 2 Dep. of Informatics, University of Oslo, Norway 3 SINTEF ICT...