First-order logic with equicardinality in random graphs
From MaRDI portal
Cites work
- Almost everywhere elimination of probability quantifiers
- Convergence Laws for Very Sparse Random Structures with Generalized Quantifiers
- Finite Model Theory
- scientific article; zbMATH DE number 6003856 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 887782 (Why is no real title available?)
- scientific article; zbMATH DE number 6157246 (Why is no real title available?)
- scientific article; zbMATH DE number 3247153 (Why is no real title available?)
- On Almost Sure Elimination of Numerical Quantifiers
- On Extensions of Elementary Logic
- On probabilistic elimination of generalized quantifiers
- On random models of finite power and monadic logic
- Probabilities on finite models
- Properties of almost all graphs and complexes
- Properties of Almost All Graphs and Generalized Quantifiers
- Random graphs and the parity quantifier
- Random graphs.
- The Härtig quantifier: a survey
- The probabilistic method
This page was built for publication: First-order logic with equicardinality in random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7261418)