Counting finite models

DOI10.2307/2275580MaRDI QIDQ4372920zbMATH OpenOpenAlexFDO

Authors 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 serieslabelled asymptotic probabilitymonadic second-order sentencesunary functionunary predicate

Mathematics Subject Classification ID

Model theory of finite structures (03C13)

Recommendations

• scientific article; zbMATH DE number 515748
• A logical approach to asymptotic combinatorics. II: Monadic second-order properties
• An undecidable problem in finite combinatorics
• On random models of finite power and monadic logic
• Probabilities on Models of Universal Sentences

Cites work

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

Cited in

(9)

• On random models of finite power and monadic logic
• Arithmetical semigroups related to trees and polyhedra
• Enumerating lambda terms by weighted length of their de Bruijn representation
• Asymptotic density in quasi-logarithmic additive number systems
• Application of a Tauberian theorem to finite model theory
• scientific article; zbMATH DE number 515748 (Why is no real title available?)
• Coloring rules for finite trees, and probabilities of monadic second order sentences
• Counting models of set theory
• Complexity ranks of countable models

This page was built for publication: Counting finite models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4372920)