Probabilities of first-order sentences on sparse random relational structures: An application to definability on random CNF formulas
Work
Year: 2020
Type: article
Abstract: We extend the convergence law for sparse random graphs proven by Lynch to arbitrary relational languages. We consider a finite relational vocabulary $\sigma $ and a first-order theory $T$ for $\sigma... more
Source: Journal of Logic and Computation
Author Lázaro Alberto Larrauri
Institution Universitat Politècnica de Catalunya
Cites: 15
Cited by: 3
Related to: 10
FWCI: 0.236
Citation percentile (by year/subfield): 68.23
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Peace, justice, and strong institutions
Open Access status: hybrid
APC paid (est): $4,151