A logical approach to asymptotic combinatorics I. First order properties

DOI10.1016/0001-8708(87)90019-3zbMath0646.60012MaRDI QIDQ1103939

Kevin J. Compton

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0001-8708(87)90019-3

zbMATH Keywords

examples; asymptotic combinatorics; finite structure; component-bounded sentences; existence of asymptotic probabilities

Mathematics Subject Classification ID

60C05: Combinatorial probability

05A16: Asymptotic enumeration

03C13: Model theory of finite structures

Related Items

Counting finite models, Asymptotics for logical limit laws: When the growth of the components is in an RT class, ABSTRACT NUMBER SYSTEMS AND LOGICAL LIMIT LAWS, Probabilities in first—order logic of a unary function and a binary relation, General combinatorial schemas: Gaussian limit distributions and exponential tails, Finite-model theory -- A personal perspective, On random models of finite power and monadic logic, Counting unlabeled structures, Some methods for computing component distribution probabilities in relational structures, Automatic average-case analysis of algorithms, Submaps of maps. I: General 0-1 laws, A logical approach to asymptotic combinatorics. II: Monadic second-order properties, Strong 0-1 laws in finite model theory, Sufficient conditions for zero-one laws, Probabilities of First-Order Sentences about Unary Functions, A geometric zero-one law, Asymptotic enumeration and a 0-1 law for $m$-clique free graphs, Application of a Tauberian theorem to finite model theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The umbral calculus
• The number of finite relational structures
• Model theory
• The number of trees
• Probabilities of First-Order Sentences about Unary Functions
• Enumeration Of Labelled Graphs
• A Generalisation of Stirling's Formula.
• Monotonicity of partition functions
• Complexity of the first-order theory of almost all finite structures
• Some useful preservation theorems
• An undecidable problem in finite combinatorics
• Probabilities on Models of Universal Sentences
• Almost sure theories
• Asymptotic Methods in Enumeration
• Asymptotic Enumeration of Partial Orders on a Finite Set
• Probabilities on finite models
• A Deductive System for Existential Least Fixpoint Logic
• Ordered Cycle Lengths in a Random Permutation
• Forests of labeled trees
• Postulational Bases for the Umbral Calculus
• Probability of Indecomposability of a Random Mapping Function