000			04228nam a22004813i 4500
001			EBC3113159
003			MiAaPQ
005			20240729124534.0
006			m o d |
007			cr cnu||||||||
008			240724s2011 xx o ||||0 eng d
020			_a9780821882375 _q(electronic bk.)
020			_z9780821849439
035			_a(MiAaPQ)EBC3113159
035			_a(Au-PeEL)EBL3113159
035			_a(CaPaEBR)ebr10878614
035			_a(OCoLC)922980761
040			_aMiAaPQ _beng _erda _epn _cMiAaPQ _dMiAaPQ
050		4	_aQA9.7 -- .M583 2011eb
082	0		_a519.2
100	1		_aGrohe, Martin.
245	1	0	_aModel Theoretic Methods in Finite Combinatorics.
250			_a1st ed.
264		1	_aProvidence : _bAmerican Mathematical Society, _c2011.
264		4	_c©2011.
300			_a1 online resource (529 pages)
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aContemporary Mathematics ; _vv.558
505	0		_aIntro -- Contents -- Preface -- Application of Logic to Combinatorial Sequences and Their Recurrence Relations -- Part 1. Introduction and Synopsis -- 1. Sequences of integers and their combinatorial interpretations -- 2. Linear recurrences -- 3. Logical formalisms -- 4. Finiteness conditions -- 5. Logical interpretations of integer sequences -- Part 2. Guiding Examples -- 6. The classical recurrence relations -- 7. Functions, permutations and partitions -- 8. Trees and forests -- 9. Graph properties -- 10. Latin squares -- Part 3. C-Finite and Holonomic Sequences -- 11. C-Finite sequences -- 12. Holonomic sequences -- Part 4. Modular Recurrence Relations -- 13. DU-index and Specker index -- 14. The rôle of logic -- 15. Structures of bounded degree -- 16. Structures of unbounded degree -- References -- Spectra and Systems of Equations -- Compton's Method for Proving Logical Limit Laws -- Logical Complexity of Graphs: A Survey -- 1. Introduction -- 1.1. Basic notions and examples -- 1.2. Variations of logic -- 1.3. Outline of the survey -- 1.4. Other structures -- 2. Preliminaries -- 2.1. Notation: Arithmetic and graphs -- 2.2. A length-depth relation -- 2.3. Distinguishability vs. definability -- 3. Ehrenfeucht games -- 4. The Weisfeiler-Lehman algorithm -- 5. Worst case bounds -- 5.1. Classes of graphs -- 5.2. General case -- 6. Average case bounds -- Methods for Algorithmic Meta Theorems -- On Counting Generalized Colorings -- 1. Introduction -- 2. Prelude: two typical graph polynomials -- 3. Counting generalized colorings -- 4. SOL-polynomials and subset expansion -- 5. Standard vs FF vs Newton SOL-polynomials -- 6. Equivalence of counting φ-colorings and SOL-polynomials -- 7. MSOL-polynomials -- 8. Enter categoricity -- 9. Conclusions -- References -- Counting Homomorphisms and Partition Functions.
505	8		_aSome Examples of Universal and Generic Partial Orders -- Two Problems on Homogeneous Structures, Revisited -- On Symmetric Indivisibility of Countable Structures -- Partitions and Permutation Groups -- (Un)countable and (Non)effective Versions of Ramsey's Theorem -- Reducts of Ramsey Structures -- 1. Introduction -- 2. Reducts -- 3. Ramsey Classes -- 4. Topological Dynamics -- 5. Minimal Functions -- 6. Decidability of Definability -- 7. Interpretability -- 8. Complexity of Constraint Satisfaction -- 9. Concluding Remarks and Further Directions -- References.
588			_aDescription based on publisher supplied metadata and other sources.
590			_aElectronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.
650		0	_aFinite model theory -- Congresses.
650		0	_aCombinatorial probabilities -- Congresses.
655		4	_aElectronic books.
700	1		_aMakowsky, Johann A.
776	0	8	_iPrint version: _aGrohe, Martin _tModel Theoretic Methods in Finite Combinatorics _dProvidence : American Mathematical Society,c2011 _z9780821849439
797	2		_aProQuest (Firm)
830		0	_aContemporary Mathematics
856	4	0	_uhttps://ebookcentral.proquest.com/lib/orpp/detail.action?docID=3113159 _zClick to View
999			_c68693 _d68693