Counting finite models

DOI10.2307/2275580zbMath0897.03032MaRDI QIDQ4372920

Alan R. Woods

Publication date: 17 December 1997

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275580

zbMATH Keywords

generating series; unary function; unary predicate; labelled asymptotic probability; monadic second-order sentences

Mathematics Subject Classification ID

03C13: Model theory of finite structures

Related Items

Arithmetical semigroups related to trees and polyhedra, Asymptotic density in quasi-logarithmic additive number systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the two kinds of probability in algebra
• The number of functional digraphs
• A note on the number of functional digraphs
• On random mapping patterns
• On random models of finite power and monadic logic
• Some asymptotic results useful in enumeration problems
• Nonconvergence, undecidability, and intractability in asymptotic problems
• A logical approach to asymptotic combinatorics I. First order properties
• Some methods for computing component distribution probabilities in relational structures
• Computer science logic. 5th workshop, CSL '91, Berne, Switzerland, October 7--11, 1991. Proceedings
• The monadic theory of order
• A logical approach to asymptotic combinatorics. II: Monadic second-order properties
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• The number of trees
• A zero-one law for logic with a fixed-point operator
• Application of a Tauberian theorem to finite model theory
• Asymptotic Methods in Enumeration
• An extension of 0‐1 laws
• Infinitary queries and their asymptotic probabilities. II. Properties definable in least fixed point logic
• Probabilities in first—order logic of a unary function and a binary relation
• Probability of Indecomposability of a Random Mapping Function