Fagin, Ronald The number of finite relational structures. (English) Zbl 0389.05006 Discrete Math. 19, 17-21 (1977). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 16 Documents MSC: 05A15 Exact enumeration problems, generating functions 08A05 Structure theory of algebraic structures 20B99 Permutation groups PDFBibTeX XMLCite \textit{R. Fagin}, Discrete Math. 19, 17--21 (1977; Zbl 0389.05006) Full Text: DOI References: [1] Burnside, W., Theory of Groups of Finite Order (1911), Cambridge University Press: Cambridge University Press Cambridge, Dover Publications, NY, 1955 · JFM 42.0151.02 [2] de Bruijn, N. G., Polya’s theory of counting, (Beckenbach, E. F., Applied Combinatorial Mathematics (1954), Wiley: Wiley NY), 144-184 · Zbl 0144.00601 [3] de Bruijn, N. G.; Klarner, D. A., Enumeration of generalized graphs, Indag. Math., 31, 1-9 (1969) · Zbl 0167.52301 [4] Fagin, R., Probabilities on finite models, J. Symbol. Logic, 41, 50-58 (1976) · Zbl 0341.02044 [5] Ford, G. W.; Uhlenbeck, G. S., Combinatorial problems in the theory of graphs. IV, Proc. Nat. Acad. Sci., 43, 163-167 (1957) [6] Harary, F., Note on Carnap’s relational asymptotic relative frequencies, J. Symbol. Logic, 23, 257-260 (1958) [7] R. McKenzie, private communication.; R. McKenzie, private communication. [8] Oberschelp, W., Strukturzahlen in endlichen Relationssystemen, (Schmidt, H. A., Contributions to Mathematical Logic. Contributions to Mathematical Logic, Proc. of 1966 Logic Colloquium (1968), North-Holland: North-Holland Amsterdam), 199-213 · Zbl 0216.30602 [9] Tarski, A., Contributions to the theory of models I, II, Indag. Math., 16, 572-588 (1954) · Zbl 0058.24702 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.