371 search results - page 16 / 75 » Partition Theorems and Computability Theory |
118
click to vote
FOSSACS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In parti...
LOGCOM
2010
14 years 10 months ago
2010
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
84
Voted
JMLR
2010
14 years 6 months ago
2010
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
FOSSACS
2010
Springer
15 years 6 months ago
2010
Springer
Every algebraic theory gives rise to a monad, and monads allow a meta-language which is a basic programming language with sideeffects. Equations in the algebraic theory give rise ...