AMS eContent Search Results
Matches for: msc=(03C13) AND publication=(all)
Sort order: Date
Format: Standard display

  
Results: 1 to 30 of 44 found      Go to page: 1 2

[1] A. S. Kechris, M. Sokić and S. Todorcevic. Ramsey properties of finite measure algebras and topological dynamics of the group of measure preserving automorphisms: Some results and an open problem. Contemporary Mathematics 690 (2017) 69-85.
Book volume table of contents   
View Article: PDF

[2] Dugald Macpherson and Charles Steinhorn. One-dimensional asymptotic classes of finite structures. Trans. Amer. Math. Soc. 360 (2008) 411-448. MR 2342010.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[3] Joel Berman and PawełM. Idziak. Generative complexity in algebra. Memoirs of the AMS 175 (2005) MR 2130585.
Book volume table of contents   

[4] Csaba Szabó and Vera Vértesi. The complexity of the word-problem for finite matrix rings. Proc. Amer. Math. Soc. 132 (2004) 3689-3695. MR 2084092.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[5] Jason P. Bell and Stanley N. Burris. Asymptotics for logical limit laws: When the growth of the components is in an RT class. Trans. Amer. Math. Soc. 355 (2003) 3777-3794. MR 1990173.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[6] Stanley N. Burris. The case $\alpha = 0$. Math. Surveys Monogr. 86 (2000) 195-199.
Book volume table of contents
View Article: PDF

[7] Stanley N. Burris. First-order limit laws. Math. Surveys Monogr. 86 (2000) 217-231.
Book volume table of contents
View Article: PDF

[8] Stanley N. Burris. Background from analysis. Math. Surveys Monogr. 86 (2000) 127-141.
Book volume table of contents
View Article: PDF

[9] Stanley N. Burris. The case $0 < \alpha < \infty $. Math. Surveys Monogr. 86 (2000) 201-216.
Book volume table of contents
View Article: PDF

[10] Stanley N. Burris. Density and partition sets. Math. Surveys Monogr. 86 (2000) 45-73.
Book volume table of contents
View Article: PDF

[11] Stanley N. Burris. Background from analysis. Math. Surveys Monogr. 86 (2000) 3-16.
Book volume table of contents
View Article: PDF

[12] Stanley N. Burris. Counting functions and fundamental identities. Math. Surveys Monogr. 86 (2000) 17-43.
Book volume table of contents
View Article: PDF

[13] Stanley N. Burris. The case $0 < \rho < 1$. Math. Surveys Monogr. 86 (2000) 87-102.
Book volume table of contents
View Article: PDF

[14] Stanley N. Burris. Density and partition sets. Math. Surveys Monogr. 86 (2000) 159-194.
Book volume table of contents
View Article: PDF

[15] Stanley N. Burris. The case $\rho = 1$. Math. Surveys Monogr. 86 (2000) 75-86.
Book volume table of contents
View Article: PDF

[16] Stanley N. Burris. Monadic second-order limit laws. Math. Surveys Monogr. 86 (2000) 103-123.
Book volume table of contents
View Article: PDF

[17] Stanley N. Burris. Counting functions and fundamental identities. Math. Surveys Monogr. 86 (2000) 143-157.
Book volume table of contents
View Article: PDF

[18] Stanley N. Burris. Number Theoretic Density and Logical Limit Laws. Math. Surveys Monogr. 86 (2000) MR MR1800435.
Book volume table of contents   

[19] Alan Woods. Approximating the structures accepted by a constant depth circuit or satisfying a sentence - a nonstandard approach. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 33 (1997) 109-130.
Book volume table of contents
View Article: PDF

[20] Stanley Burris. Spectrally determined first-order limit laws. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 33 (1997) 33-52.
Book volume table of contents
View Article: PDF

[21] John Baldwin. Near model completeness and 0-1 laws. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 33 (1997) 1-13.
Book volume table of contents
View Article: PDF

[22] Ravi Boppana and Joel Spencer. Smoothness laws for random ordered graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 33 (1997) 15-32.
Book volume table of contents
View Article: PDF

[23] Ravi B. Boppana and James F. Lynch (Editors). Logic and Random Structures. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 33 (1997) MR MR1465464.
Book volume table of contents

[24] Eric Rosen, Saharon Shelah and Scott Weinstein. $k$-universal finite graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 33 (1997) 65-77.
Book volume table of contents
View Article: PDF

[25] Monica McArthur. The asymptotic behavior of ${L^k_{\infty ,\omega }}$ on sparse random graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 33 (1997) 53-63.
Book volume table of contents
View Article: PDF

[26] Pawel Idziak and Jerzy Tyszkiewicz. Monadic second order probabilities in algebra. Directly representable varieties and groups. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 33 (1997) 79-107.
Book volume table of contents
View Article: PDF

[27] Toniann Pitassi. Algebraic propositional proof systems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 31 (1997) 215-244.
Book volume table of contents
View Article: PDF

[28] Howard Straubing. Finite models, automata, and circuit complexity. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 31 (1997) 63-96.
Book volume table of contents
View Article: PDF

[29] Ronald Fagin. Easier ways to win logical games. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 31 (1997) 1-32.
Book volume table of contents
View Article: PDF

[30] Bruno Courcelle. On the expression of graph properties in some fragments of monadic second-order logic. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 31 (1997) 33-62.
Book volume table of contents
View Article: PDF


Results: 1 to 30 of 44 found      Go to page: 1 2

American Mathematical Society