Sciweavers

11063 search results - page 63 / 2213
» On the existence of universal models
Sort
View
SODA
2012
ACM
213views Algorithms» more  SODA 2012»
12 years 15 days ago
Expanders are universal for the class of all spanning trees
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
Daniel Johannsen, Michael Krivelevich, Wojciech Sa...
APAL
2005
83views more  APAL 2005»
13 years 10 months ago
Reflections on reflections in explicit mathematics
We give a broad discussion of reflection principles in explicit mathematics, thereby addressing various kinds of universe existence principles. The proof-theoretic strength of the...
Gerhard Jäger, Thomas Strahm
JAC
2008
13 years 11 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard
TPHOL
2007
IEEE
14 years 4 months ago
HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...
Norbert Völker
JTAER
2008
175views more  JTAER 2008»
13 years 10 months ago
A Core Component-based Modelling Approach for Achieving e-Business Semantics Interoperability
The adoption of advanced integration technologies that enable private and public organizations to seamlessly execute their business transactions electronically is still relatively...
Till Janner, Fenareti Lampathaki, Volker Hoyer, Sp...