Sciweavers

7988 search results - page 312 / 1598
» A Useful Undecidable Theory
Sort
View
APLAS
2007
ACM
15 years 9 months ago
Complete Lattices and Up-To Techniques
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...
Damien Pous
ASIAN
2006
Springer
91views Algorithms» more  ASIAN 2006»
15 years 9 months ago
A Type-Theoretic Framework for Formal Reasoning with Different Logical Foundations
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...
Zhaohui Luo
CIE
2008
Springer
15 years 7 months ago
Many Facets of Complexity in Logic
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...
Antonina Kolokolova
WOB
2004
15 years 6 months ago
Mutual Information Content of Homologous DNA Sequences
The necessary information to reproduce and keep an organism is codified in acid nucleic molecules. Deepening the knowledge about how the information is stored in these bio-sequence...
Luciana Pessoa, Helena Cristina da Gama Leit&atild...
IWFM
1998
15 years 6 months ago
Motivation for a New Semantics for Vagueness
Vagueness is the phenomenon that natural language predicates have borderline regions of applicability and that the boundaries of the borderline region are not determinable. A theo...
Mark Changizi