|
" Finite and Infinite Combinatorics in Sets and Logic "
edited by N.W. Sauer, R.E. Woodrow, B. Sands.
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
774995
|
| Doc. No
|
:
|
b594990
|
| Main Entry
|
:
|
edited by N.W. Sauer, R.E. Woodrow, B. Sands.
|
| Title & Author
|
:
|
Finite and Infinite Combinatorics in Sets and Logic\ edited by N.W. Sauer, R.E. Woodrow, B. Sands.
|
| Publication Statement
|
:
|
Dordrecht : Springer Netherlands : Imprint : Springer, 1993
|
| Series Statement
|
:
|
NATO ASI series., Series C,, Mathematical and physical sciences ;, 411.
|
| Page. NO
|
:
|
(476 pages)
|
| ISBN
|
:
|
9401049238
|
|
|
:
|
: 9401120803
|
|
|
:
|
: 9789401049238
|
|
|
:
|
: 9789401120807
|
| Contents
|
:
|
Extensions of the Erd?s-Rado Theorem --; Zero Sum Trees: A Survey of Results and Open Problems --; On Superatomic Boolean Algebras --; Representing Rings Using Continuous Function --; Homogeneous Directed Graphs --; Ordinal Partition Behavior of Finite Powers of Cardinals --; Some Subdirect Products of Finite Nilpotent Groups --; Three Remarks on End-Faithfulness --; True Embedding Partition Relations --; Lattices Related to Separation in Graphs --; Ramsey Numbers for Sets of Five Vertex Graphs With Fixed Number of Edges --; Finite Structures With Few Types --; Recognition Problem in Reconstruction for Decomposable Relations --; The Average Size of Nonsingular Sets in a Graph --; Some Canonical Partition Ordinals --; The Group of Automorphisms of a Relational Saturated Structure --; On Canonical Ramsey Numbers for Coloring Three-Element Sets --; Large Subgroups of Infinite Symmetric Groups --; Homogeneous Partially Ordered Sets --; Cardinal Representations --; A Vertex-to-Vertex Pursuit Game Played With Disjoint Sets of Edges --; Graphs and Posets With no Infinite Independent Set --; Problems About Planar Orders --; Superstable and Unstable Theories of Order --; Advances in Cardinal Arithmetic --; Conjectures of Rado and Chang and Cardinal Arithmetic --; Random Structures and Zero-One Laws --; Isotone Maps: Enumeration and Structure --; Problem Sessions.
|
| Abstract
|
:
|
This book highlights the newly emerging connections between problems in finite combinatorics and graph theory on the one hand and the more foundational subjects of logic and set theory on the other.<br/> One of the more obvious routes for such a connection is the straightforward generalization of certain definitions and problems from the finite to the infinite, and sometimes the other way around. Another one is to generalize some definitions and find the appropriate new concepts for the new setting, for example the discussion of ends of graphs.<br/> The realization of the importance of homogeneous structures and their connection with logic, as well as with finite structure theory, is a good example of the connection between finite and infinite structures. Almost all of the articles in the present book touch in one way or another on homogeneous structures. The discussion of the 0--1 law, of Ramsey theory for finite and infinite structures, and of divisibility theory highlight this.<br/>
|
| Subject
|
:
|
Combinatorial analysis.
|
| Subject
|
:
|
Computational complexity.
|
| Subject
|
:
|
Mathematics.
|
| Added Entry
|
:
|
B Sands
|
|
|
:
|
N W Sauer
|
|
|
:
|
R E Woodrow
|
| Parallel Title
|
:
|
Proceedings of the NATO Advanced Study Institute, Banff, Alberta, Canada, April 21-May 4, 1991
|
| |