Probabilities on finite models

Cited in

(only showing first 100 items - show all)

The many faces of interpolation
Random orders
On random models of finite power and monadic logic
Counting unlabeled structures
Nonconvergence, undecidability, and intractability in asymptotic problems
A logical approach to asymptotic combinatorics I. First order properties
The computational complexity of asymptotic problems. I: Partial orders
Graph theoretic models
Number of quantifiers is better than number of tape cells
Upper and lower bounds for first order expressibility
On the effective content of asymptotic verifications of Edgeworth's Conjecture
First order properties of random posets
Universal elements and the complexity of certain classes of infinite graphs
Distanced graphs
Infinitary logics and 0-1 laws
Submaps of maps. I: General 0-1 laws
The number of finite relational structures
Listing graphs that satisfy first-order sentences
Finitistic proofs of 0-1 laws for fragments of second-order logic
How to define a linear order on finite models
Finitely representable databases
The Kolmogorov expressive power of Boolean query languages
0-1 laws by preservation
Queries with arithmetical constraints
The emergence of reasons conjecture.
Local properties of query languages
Program schemes, arrays, Lindström quantifiers and zero-one laws
The 0-1 law fails for monadic existential second-order logic on undirected graphs
Limits of schema mappings
Logical laws for existential monadic second-order sentences with infinite first-order parts
Existential monadic second order logic of undirected graphs: the Le Bars conjecture is false
A disproof the Le Bars conjecture about the zero-one law for existential monadic second-order sentences
Logical limit laws for minor-closed classes of graphs
Existential monadic second order convergence law fails on sparse random graphs
Zero-one laws for random \(k\)-partite graphs
\(\gamma\)-variable first-order logic of uniform attachment random graphs
Ample simplicial complexes
On the 4-spectrum of first-order properties of random graphs
Quantifier alternation in first-order formulas with infinite spectra
Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination
A topological zero-one law and elementary equivalence of finitely generated groups
Some thoughts on knowledge-enhanced machine learning
On the convergence of probabilities of first-order sentences for recursive random graph models
MSO 0-1 law for recursive random trees
Zero-one laws for random distance graphs with vertices in \(\{0,1\}^n\)
Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\)
Query evaluation on a database given by a random graph
A survey of homogeneous structures
The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws
Zero-one laws for \(k\)-variable first-order logic of sparse random graphs
Zero-one laws for sentences with \(k\) variables
Spectra of short monadic sentences about sparse random graphs
The finite submodel property and \(\omega\)-categorical expansions of pregeometries
Spectra of first-order formulas with a low quantifier depth and a small number of quantifier alternations
The metamathematics of random graphs
An efficiently computable subgraph pattern support measure: counting independent observations
Infinity and verifiability in Carnap's inductive logic
Determined theories and limit laws
Simple structures axiomatized by almost sure theories
Finite tournaments with a nonempty diamonds' support
A logical approach to asymptotic combinatorics. II: Monadic second-order properties
Bounded quantifier depth spectra for random graphs
A note on the Kolmogorov data complexity and nonuniform logical definitions
On failure of 0-1 laws
The first-order contiguity of sparse random graphs with prescribed degrees
Probabilities of First-Order Sentences about Unary Functions
Almost Everywhere Equivalence of Logics in Finite Model Theory
When does the zero-one k-law fail?
On the zero-one k-law extensions
Graphs with the \(n\)-e.c. adjacency property constructed from resolvable designs
Asymptotic enumeration and a 0-1 law for m-clique free graphs
Application of a Tauberian theorem to finite model theory
Probabilities on Models of Universal Sentences
Zero-One Laws for Sparse Random Graphs
A zero‐one law for a random subset
Probabilities of Sentences about Very Sparse Random Graphs
Zero-one law for an extension of first-order predicate language
Extension of the zero-one \(k\)-law
Zero-one \(k\)-law
Subtournaments isomorphic to W₅ in a indecomposable tournament
A Theorem on Reconstruction of Random Graphs
Properties of Classes of Random Graphs
Lower complexity bounds for lifted inference
Probabilities in first—order logic of a unary function and a binary relation
Random graph orders do not satisfy a 0–1 law
Quasi-Random Set Systems
Convergence in homogeneous random graphs
Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview
scientific article; zbMATH DE number 7438576 (Why is no real title available?)
Convergence and Nonconvergence Laws for Random Expansions of Product Structures
The complexity class θp2: Recent results and applications in AI and modal logic
EMSO(FO^2) 0-1 Law Fails for All Dense Random Graphs
A unified approach to structural limits and limits of graphs with bounded tree-depth
Logical laws for short existential monadic second-order sentences about graphs
First-order zero-one law for the uniform model of the random graph
SMT-based verification of data-aware processes: a model-theoretic approach
Infinitary logic for computer science
Discrete metric spaces: structure, enumeration, and 0-1 laws
Logical properties of random graphs from small addable classes
The theory of spectrum exchangeability

This page was built for publication: Probabilities on finite models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4108321)