139 search results - page 3 / 28 » Models of set theory with definable ordinals |
CIE
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Infinite time register machines (ITRMs) are register machines which act on natural numbers and which are allowed to run for arbitrarily many ordinal steps. Successor step...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We develop a purely ordinal model for aggregation functionals for lattice valued functions, comprising as special cases quantiles, the Ky Fan metric and the Sugeno integral. For m...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
AGI
2011
12 years 11 months ago
2011
Under Legg’s and Hutter’s formal measure [1], performance in easy environments counts more toward an agent’s intelligence than does performance in difficult environments. An ...