Random unary predicates: Almost sure theories and countable models

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199810/12)13:3/4<229::AID-RSA3>3.0.CO;2-X" /><229::AID-RSA3>3.0.CO;2-X 10.1002/(SICI)1098-2418(199810/12)13:3/4<229::AID-RSA3>3.0.CO;2-XzbMath0957.03041OpenAlexW2010397351MaRDI QIDQ4705332

Katherine St. John, J. H. Spencer

Publication date: 19 December 1999

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199810/12)13:3/4<229::aid-rsa3>3.0.co;2-x

zbMATH Keywords

axiomatizationalmost sure first-order theoryrandom unary predicate

Mathematics Subject Classification ID

Zero-one laws (60F20) Model theory of denumerable and separable structures (03C15)

Related Items (1)

Unnamed Item

This page was built for publication: Random unary predicates: Almost sure theories and countable models