Sciweavers

7988 search results - page 173 / 1598
» A Useful Undecidable Theory
Sort
View
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 11 months ago
The finite model theory toolbox of a database theoretician
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...
Leonid Libkin
LANMR
2007
13 years 11 months ago
Dialetheic truth theory: inconsistency, non-triviality, soundness, incompleteness
The best-known application of dialetheism is to semantic paradoxes such as the Liar. In particular, Graham Priest has advocated the adoption of an axiomatic truth theory in which c...
Federico Marulanda Rey
AMAI
2007
Springer
13 years 10 months ago
Decision procedures for extensions of the theory of arrays
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alo...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
CORR
2004
Springer
100views Education» more  CORR 2004»
13 years 10 months ago
On the Theory of Structural Subtyping
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
Viktor Kuncak, Martin C. Rinard
CSL
2004
Springer
14 years 3 months ago
A Dependent Type Theory with Names and Binding
We consider the problem of providing formal support for working tract syntax involving variable binders. Gabbay and Pitts have shown in their work on Fraenkel-Mostowski (FM) set th...
Ulrich Schöpp, Ian Stark