Sciweavers

160 search results - page 12 / 32
» Homomorphism preservation theorems
Sort
View
ESOP
2012
Springer
12 years 3 months ago
Generate, Test, and Aggregate - A Calculation-based Framework for Systematic Parallel Programming with MapReduce
Abstract. MapReduce, being inspired by the map and reduce primitives available in many functional languages, is the de facto standard for large scale data-intensive parallel progra...
Kento Emoto, Sebastian Fischer, Zhenjiang Hu
JSYML
2007
51views more  JSYML 2007»
13 years 7 months ago
Forcing indestructibility of set-theoretic axioms
Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the L´evy collapse. These show in particul...
Bernhard König
CADE
1998
Springer
13 years 11 months ago
Automated Theorem Proving in a Simple Meta-Logic for LF
Abstract. Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally i...
Carsten Schürmann, Frank Pfenning
CADE
2000
Springer
13 years 12 months ago
System Description: ARA - An Automatic Theorem Prover for Relation Algebras
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
Carsten Sinz
APAL
2008
83views more  APAL 2008»
13 years 7 months ago
Easton's theorem and large cardinals
The continuum function F on regular cardinals is known to have great freedom; if , are regular cardinals, then F needs only obey the following two restrictions: (1) cf(F()) > ...
Sy D. Friedman, Radek Honzik