An undecidable problem in finite combinatorics

DOI10.2307/2274138zbMath0591.03020OpenAlexW2013122733MaRDI QIDQ3718693

Kevin J. Compton

Publication date: 1984

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

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

zbMATH Keywords

finitely axiomatizable classasymptotic probability of a sentenceundecidable set of sentences

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35)

Related Items

Zero-one laws with variable probability, Nonconvergence, undecidability, and intractability in asymptotic problems, A logical approach to asymptotic combinatorics. II: Monadic second-order properties, Probabilities of First-Order Sentences about Unary Functions, A logical approach to asymptotic combinatorics I. First order properties, On the effective content of asymptotic verifications of Edgeworth's Conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of finite relational structures
• Monotonicity of partition functions
• Almost sure theories
• Asymptotic Methods in Enumeration