Sciweavers

3172 search results - page 375 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
NJC
2006
86views more  NJC 2006»
15 years 6 months ago
Axiomatizing Binding Bigraphs
We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove tha...
Troels Christoffer Damgaard, Lars Birkedal
SYNTHESE
2008
81views more  SYNTHESE 2008»
15 years 6 months ago
Decision framing in judgment aggregation
Judgment aggregation problems are language dependent in that they may be framed in different yet equivalent ways. We formalize this dependence via the notion of translation invari...
Fabrizio Cariani, Marc Pauly, Josh Snyder
ALIFE
2004
15 years 6 months ago
Avida: A Software Platform for Research in Computational Evolutionary Biology
The Avida digital evolution platform is a software tool used to perform experimental evolution research with self-replicating computer programs ("digital organisms"). Av...
Charles Ofria, Claus O. Wilke
CG
2004
Springer
15 years 6 months ago
A stratification approach for modeling two-dimensional cell complexes
This work presents a stratification approach for modeling two-dimensional cell complexes. It introduces the concept of combinatorial stratification and uses the Handlebody theory ...
Sinésio Pesco, Geovan Tavares, Hélio...
JSYML
2008
63views more  JSYML 2008»
15 years 6 months ago
Classifying model-theoretic properties
In 2004 Csima, Hirschfeldt, Knight, and Soare [1] showed that a set A T 0 is nonlow2 if and only if A is prime bounding, i.e. for every complete atomic decidable theory T , there i...
Chris J. Conidis