Probabilities of first-order sentences on sparse random relational structures: An application to definability on random CNF formulas

DOI10.1093/LOGCOM/EXAA061OpenAlexW3097820754MaRDI QIDQ5858130

Lázaro Alberto Larrauri

Publication date: 9 April 2021

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.06099

zbMATH Keywords

random hypergraphsrandom SATasymptotic probabilityconvergence lawunsatisfiability certificate

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Related Items (1)

Limiting probabilities of first order properties of random sparse graphs and hypergraphs

This page was built for publication: Probabilities of first-order sentences on sparse random relational structures: An application to definability on random CNF formulas