1101 search results - page 73 / 221 » Forcing in proof theory |
162
Voted
AISC
2010
Springer
15 years 6 months ago
2010
Springer
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
142
Voted
KI
1990
Springer
15 years 7 months ago
1990
Springer
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
139
click to vote
AI
2007
Springer
15 years 3 months ago
2007
Springer
In this paper a theory for the synthesis of geometric concepts is presented. The theory is focused on a constructive process that synthesizes a function in the geometric domain re...
124
Voted
BIRTHDAY
2005
Springer
15 years 9 months ago
2005
Springer
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Ano...
130
Voted
VLDB
1989
ACM
15 years 7 months ago
1989
ACM
In this paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi se...