A logical approach to asymptotic combinatorics I. First order properties

DOI10.1016/0001-8708(87)90019-3zbMath0646.60012OpenAlexW2076048718MaRDI 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

examplesasymptotic combinatoricsfinite structurecomponent-bounded sentencesexistence of asymptotic probabilities

Mathematics Subject Classification ID

Combinatorial probability (60C05) Asymptotic enumeration (05A16) Model theory of finite structures (03C13)

Related Items (24)

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

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

This page was built for publication: A logical approach to asymptotic combinatorics I. First order properties