Find a copy online
Links to this item
Find a copy in the library
Finding libraries that hold this item...
|Genre/Form:||Conference papers and proceedings
Arcata (Calif., 1985)
|Material Type:||Conference publication, Internet resource|
|Document Type:||Book, Internet Resource|
|All Authors / Contributors:||
Stephen G Simpson; American Mathematical Society.; Institute of Mathematical Statistics.; Society for Industrial and Applied Mathematics.
|Description:||xi, 394 pages : illustrations ; 26 cm.|
|Contents:||Dilators, generalized Goodstein sequences, independence results: A survey by V. M. Abrusci Some uses of dilators in combinatorial problems, part I by V. M. Abrusci, J.-Y. Girard, and J. Van de Wiele Cross products of Souslin trees by B. Ackman and J. Owings Ergodic Ramsey theory by V. Bergelson Ultrafilters related to Hindman's finite unions theorem and its extensions by A. Blass Logical analysis of some theorems of combinatorics and topological dynamics by A. R. Blass, J. L. Hirst, and S. G. Simpson A remark on partition relations for infinite ordinals, with an application to finite combinatorics by J. E. Baumgartner and A. Hajnal A summary of "On Ramsey-type Theorems and Their Provability in Weak Formal Systems" by S. H. Brackin Provably computable functions and the fast growing hierarchy by W. Buchholz and S. Wainer Rigid Borel sets and better quasiorder theory by F. van Engelen, A. W. Miller, and J. Steel Some problems on finite and infinite graphs by P. Erdos The metamathematics of the graph minor theorem by H. Friedman, N. Robertson, and P. D. Seymour Summable ultrafilters and finite sums by N. Hindman On undecidability of the weakened Kruskal theorem by M. Loebl and J. Matousek Well quasi orderings, long games, and a combinatorial study of undecidability by J. Nesetril and R. Thomas On the theory of quasi ordinal diagrams by M. Okada and G. Takeuti Improved bounds to the length of proofs of finitistic consistency statements by P. Pudlak Non standard universes with strong embeddings, and their finite approximations by J.-P. Ressayre Unprovable theorems and fast-growing functions by S. G. Simpson.|
|Series Title:||Contemporary mathematics (American Mathematical Society), v. 65.|
|Responsibility:||Stephen G. Simpson, editor.|
- Logic, Symbolic and mathematical -- Congresses.
- Combinatorial analysis -- Congresses.
- analyse combinatoire.
- logique mathématique.
- Logique symbolique et mathématique -- Congrès.
- Analyse combinatoire -- Congrès.
- Combinatorial analysis.
- Logic, Symbolic and mathematical.
- Mathematische Logik.