On random models of finite power and monadic logic

From MaRDI portal
Revision as of 00:01, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1066878

DOI10.1016/0012-365X(85)90112-8zbMath0579.03006MaRDI QIDQ1066878

Matt Kaufmann, Saharon Shelah

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)



Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (25)

Nonconvergence, undecidability, and intractability in asymptotic problemsAsymptotic probabilities of existential second-order Gödel sentencesEuropean Summer Meeting of the Association for Symbolic LogicThe computational complexity of asymptotic problems. I: Partial ordersApplication of a Tauberian theorem to finite model theoryConvergence in homogeneous random graphsEMSO(FO$^2$) 0-1 Law Fails for All Dense Random GraphsDisproof of the zero-one law for existential monadic properties of a sparse binomial random graphLogical laws for short existential monadic second-order sentences about graphsLogical laws for existential monadic second-order sentences with infinite first-order partsA uniform method for proving lower bounds on the computational complexity of logical theoriesExistential monadic second order logic of undirected graphs: the Le Bars conjecture is false0-1 laws and decision problems for fragments of second-order logicA disproof the Le Bars conjecture about the zero-one law for existential monadic second-order sentencesCounting finite modelsLogical limit laws for minor-closed classes of graphsInfinitary logics and 0-1 lawsMSO 0-1 law for recursive random treesFinite-model theory -- A personal perspectiveExistential monadic second order convergence law fails on sparse random graphsCounterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an OverviewProbabilities in first—order logic of a unary function and a binary relationZero-One Laws for Sparse Random GraphsAlmost Everywhere Equivalence of Logics in Finite Model TheoryThe 0-1 law fails for monadic existential second-order logic on undirected graphs



Cites Work


This page was built for publication: On random models of finite power and monadic logic