Results 1 
6 of
6
A New ZeroOne Law and Strong Extension Axioms
 BULLETIN OF EATCS
, 2000
"... One of the previous articles in this column was devoted to the zeroone laws for a number of logics playing prominent role in finite model theory: firstorder logic FO, the extension FO+LFP of firstorder logic with the least fixedpoint operator, and the infinitary logic L # #,# . Recently Shela ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
One of the previous articles in this column was devoted to the zeroone laws for a number of logics playing prominent role in finite model theory: firstorder logic FO, the extension FO+LFP of firstorder logic with the least fixedpoint operator, and the infinitary logic L # #,# . Recently Shelah proved a new, powerful, and surprising zeroone law. His proof uses socalled strong extension axioms. Here we formulate Shelah's zeroone law and prove a few facts about these axioms. In the process we give a simple proof for a "large deviation" inequality a la Chernoff.
Why sets?
 PILLARS OF COMPUTER SCIENCE: ESSAYS DEDICATED TO BORIS (BOAZ) TRAKHTENBROT ON THE OCCASION OF HIS 85TH BIRTHDAY, VOLUME 4800 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2008
"... Sets play a key role in foundations of mathematics. Why? To what extent is it an accident of history? Imagine that you have a chance to talk to mathematicians from a faraway planet. Would their mathematics be setbased? What are the alternatives to the settheoretic foundation of mathematics? Besi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Sets play a key role in foundations of mathematics. Why? To what extent is it an accident of history? Imagine that you have a chance to talk to mathematicians from a faraway planet. Would their mathematics be setbased? What are the alternatives to the settheoretic foundation of mathematics? Besides, set theory seems to play a significant role in computer science; is there a good justification for that? We discuss these and some related issues.
Relational Transducers for . . . [Extended Abstract]
, 2011
"... Motivated by a recent conjecture concerning the expressiveness of declarative networking, we propose a formal computation model for “eventually consistent” distributed querying, based on relational transducers. A tight link has been conjectured between coordinationfreeness of computations, and mono ..."
Abstract
 Add to MetaCart
Motivated by a recent conjecture concerning the expressiveness of declarative networking, we propose a formal computation model for “eventually consistent” distributed querying, based on relational transducers. A tight link has been conjectured between coordinationfreeness of computations, and monotonicity of the queries expressed by such computations. Indeed, we propose a formal definition of coordinationfreeness and confirm that the class of monotone queries is captured by coordinationfree transducer networks. Coordinationfreeness is a semantic property, but the syntactic class of “oblivious” transducers we define also captures the same class of monotone queries. Transducer networks that are not coordinationfree are much more powerful.