The number of finite relational structures

DOI10.1016/0012-365X(77)90116-9zbMath0389.05006OpenAlexW1974159979MaRDI QIDQ1250814

Ronald Fagin

Publication date: 1977

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(77)90116-9

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Structure theory of algebraic structures (08A05) Permutation groups (20B99)

Related Items (16)

Counting unlabeled structures ⋮ An undecidable problem in finite combinatorics ⋮ Mathematical problems and games ⋮ A logical approach to asymptotic combinatorics I. First order properties ⋮ The computational complexity of asymptotic problems. I: Partial orders ⋮ How to define a linear order on finite models ⋮ FINITE RELATION ALGEBRAS ⋮ The visually distinct configurations of k sets ⋮ Asymptotic conditional probabilities: The non-unary case ⋮ The hierarchy theorem for generalized quantifiers ⋮ Binary Linear Codes with Near-Extremal Maximum Distance ⋮ Typical automorphism groups of finite nonrigid structures ⋮ On the two kinds of probability in algebra ⋮ The hierarchy theorem for second order generalized quantifiers ⋮ Extremal solutions of an inequality concerning supports of permutation groups and punctured Hadamard codes ⋮ Limit laws and automorphism groups of random nonrigid structures

Cites Work

• Probabilities on finite models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of finite relational structures