3552 search results - page 141 / 711 » Proof theory in the abstract |
169
click to vote
BIRTHDAY
2005
Springer
15 years 12 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...
163
click to vote
VLDB
1989
ACM
15 years 10 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...
157
click to vote
ENTCS
2007
15 years 6 months ago
2007
We develop a sound and complete equational theory for the functional quantum programming language QML. The soundness and completeness of the theory are with respect to the previou...
117
click to vote
MLQ
2008
15 years 6 months ago
2008
Abstract. We give an elementary theory of Henselian local rings and construct the Henselization of a local ring. All our theorems have an algorithmic content.
JSYML
2006
15 years 6 months ago
2006
Abstract. Using the Friedman-Koepke Hyperfine Structure Theory of [2], we provide a short construction of a gap 1 morass in the constructible universe.