Sciweavers

148 search results - page 1 / 30
» On the extender algebra being complete
Sort
View
MLQ
2006
93views more  MLQ 2006»
13 years 5 months ago
On the extender algebra being complete
We show that a Woodin cardinal is necessary for the Extender Algebra to be complete. Our proof is relatively simple and does not use fine structure.
Richard Ketchersid, Stuart Zoble
LICS
1996
IEEE
13 years 9 months ago
Completing Partial Combinatory Algebras With Unique Head-Normal Forms
In this note, we prove that having unique head-normal forms is a sufficient condition on partial combinatory algebras to be completable. As application,we show that the pca of str...
Inge Bethke, Jan Willem Klop, Roel C. de Vrijer
DLT
1993
13 years 6 months ago
Rewriting Extended Regular Expressions
We concider an extened algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotoni...
Valentin M. Antimirov, Peter D. Mosses
DBPL
2007
Springer
91views Database» more  DBPL 2007»
13 years 11 months ago
Relational Completeness of Query Languages for Annotated Databases
Annotated relational databases can be queried either by simply making the annotations explicitly available along the ordinary data, or by adapting the standard query operators so ...
Floris Geerts, Jan Van den Bussche
JSYML
2010
107views more  JSYML 2010»
13 years 3 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov