3571 search results - page 209 / 715 » Cohen and Set Theory |
174
click to vote
APLAS
2007
ACM
15 years 10 months ago
2007
ACM
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
161
click to vote
ASIAN
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A type-theoretic framework for formal reasoning with different logical foundations is introduced and studied. With logic-enriched type theories formulated in a logical fr...
175
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
173
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
163
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
: Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper shows how to reconstruct a ranking f...