Sciweavers

119 search results - page 12 / 24
» A First-Order Isomorphism Theorem
Sort
View
AML
2005
53views more  AML 2005»
13 years 7 months ago
Models of set theory with definable ordinals
A DO model (here also referred to a Paris model) is a model M of set theory all of whose ordinals are first order definable in M. Jeffrey Paris (1973) initiated the study of DO mo...
Ali Enayat
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
13 years 11 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
LICS
2010
IEEE
13 years 5 months ago
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
Martin Grohe
CADE
2004
Springer
14 years 7 months ago
Automatic Generation of Classification Theorems for Finite Algebras
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
Simon Colton, Andreas Meier, Volker Sorge, Roy L. ...
AML
2002
36views more  AML 2002»
13 years 7 months ago
Shelah's stability spectrum and homogeneity spectrum in finite diagrams
We present Saharon Shelah's Stability Spectrum and Homogeneity Spectrum theorems, as well as the equivalence between the order property and instability in the framework of Fin...
Rami P. Grossberg, Olivier Lessmann