On the public citation graph
Range and degree of realizability of formulas in the restricted predicate calculus
0 signed · 205 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1090/s0002-9947-1963-0158822-2openalex-snapshot
Classes of predictably computable functions
inferredcites →https://doi.org/10.1090/s0002-9947-1963-0186827-4openalex-snapshot
Semi-Discrete Analytic Functions
inferredcites →https://doi.org/10.1201/b13782-17openalex-snapshot
An Introduction to Mathematical Logic
inferredcites →https://doi.org/10.2307/2266840openalex-snapshot
B. A. Trahténbrot. Névozmožnost' algorifma dlá problémy razréšimosti na konéčnyh klassah (Impossibility of an algorithm for the decision problem in finite classes). Doklady Akademii Nauk SSSR, vol. 70 (1950), pp. 569–572.
inferredcites →https://doi.org/10.2307/2269095openalex-snapshot
Identity, variables, and impredicative definitions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199905)14:3<215::aid-rsa2>3.0.co;2-kopenalex-snapshot
0-1 laws for maps
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199905)14:3<239::aid-rsa3>3.0.co;2-3openalex-snapshot
First order zero-one laws for random graphs on the circle
inferred← citeshttps://doi.org/10.1002/9780470996751.ch23openalex-snapshot
Logic in Finite Structures: Definability, Complexity, and Randomness
inferred← citeshttps://doi.org/10.1002/jcd.20210openalex-snapshot
Graphs with the n‐e.c. adjacency property constructed from resolvable designs
inferred← citeshttps://doi.org/10.1002/rsa.1016openalex-snapshot
On probabilistic elimination of generalized quantifiers
inferred← citeshttps://doi.org/10.1002/rsa.3240020306openalex-snapshot
A zero‐one law for a random subset
inferred← citeshttps://doi.org/10.1002/rsa.3240030105openalex-snapshot
Probabilities of Sentences about Very Sparse Random Graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240040404openalex-snapshot
The logic of ordered random structures
inferred← citeshttps://doi.org/10.1002/rsa.3240060205openalex-snapshot
Probabilities in first—order logic of a unary function and a binary relation
inferred← citeshttps://doi.org/10.1002/rsa.3240060211openalex-snapshot
Random graph orders do not satisfy a 0–1 law
inferred← citeshttps://doi.org/10.1002/rsa.3240060402openalex-snapshot
Convergence in homogeneous random graphs
inferred← citeshttps://doi.org/10.1006/inco.1997.2636openalex-snapshot
The Kolmogorov Expression Complexity of Logics
inferred← citeshttps://doi.org/10.1006/jcss.1996.0069openalex-snapshot
Logical Definability of Counting Functions
inferred← citeshttps://doi.org/10.1007/11549345_51openalex-snapshot
Random Databases and Threshold for Monotone Non-recursive Datalog
inferred← citeshttps://doi.org/10.1007/11965893_11openalex-snapshot
Query Evaluation on a Database Given by a Random Graph
inferred← citeshttps://doi.org/10.1007/3-540-28788-4_12openalex-snapshot
Quantifiers and Logical Reductions
inferred← citeshttps://doi.org/10.1007/3-540-36596-6_11openalex-snapshot
Semantic Classifications of Queries to Relational Databases
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_6openalex-snapshot
0–1 Laws for Fragments of Existential Second-Order Logic: A Survey
inferred← citeshttps://doi.org/10.1007/3-540-46583-9_3openalex-snapshot
A Perspective on Lindström Quantifiers and Oracles
inferred← citeshttps://doi.org/10.1007/3-540-53507-1_67openalex-snapshot
Finite-model theory—a personal perspective
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_96openalex-snapshot
Infinitary logic for computer science
inferred← citeshttps://doi.org/10.1007/3-540-56039-4_37openalex-snapshot
Query languages with counters
inferred← citeshttps://doi.org/10.1007/3-540-56039-4_50openalex-snapshot
A paradox in database theory
inferred← citeshttps://doi.org/10.1007/3-540-68804-8_1openalex-snapshot
Unifying Themes in Finite Model Theory
inferred← citeshttps://doi.org/10.1007/3-540-68804-8_2openalex-snapshot
On the Expressive Power of Logics on Finite Models
inferred← citeshttps://doi.org/10.1007/978-1-4471-0751-4_23openalex-snapshot
Finite and Infinite in Logic
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_10openalex-snapshot
0–1 Laws for Fragments of Second-Order Logic: An Overview
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_23openalex-snapshot
Coloring Distance Graphs and Graphs of Diameters
inferred← citeshttps://doi.org/10.1007/978-3-030-48006-6_9openalex-snapshot
Convergence and Nonconvergence Laws for Random Expansions of Product Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-86319-6_21openalex-snapshot
Provenance Analysis and Semiring Semantics for First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-99536-1_7openalex-snapshot
Convergence Laws for Expansions of Linear Preorders
inferred← citeshttps://doi.org/10.1007/978-3-032-01475-7_15openalex-snapshot
Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words
inferred← citeshttps://doi.org/10.1007/978-3-0348-7915-6_48openalex-snapshot
A Zero-One Law for First-Order Logic on Random Images
inferred← citeshttps://doi.org/10.1007/978-3-0348-8211-8_33openalex-snapshot
Zero-One Law Characterizations of ε 0
inferred← citeshttps://doi.org/10.1007/978-3-0348-8268-2_15openalex-snapshot
The Random Graph Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_12openalex-snapshot
A Framework for Ranking Vacuity Results
inferred← citeshttps://doi.org/10.1007/978-3-319-17142-5_16openalex-snapshot
The First-Order Contiguity of Sparse Random Graphs with Prescribed Degrees
inferred← citeshttps://doi.org/10.1007/978-3-540-30570-5_20openalex-snapshot
Asymptotic Conditional Probabilities for Conjunctive Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-30576-7_5openalex-snapshot
Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13962-8_38openalex-snapshot
A Note on the Least Informative Model of a Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_23openalex-snapshot
Randomisation and Derandomisation in Descriptive Complexity Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_10openalex-snapshot
Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers
inferred← citeshttps://doi.org/10.1007/978-3-662-03182-7_11openalex-snapshot
Quantifiers and Logical Reductions
inferred← citeshttps://doi.org/10.1007/978-3-662-22108-2_9openalex-snapshot
Convergence Laws for Random Graphs
inferred← citeshttps://doi.org/10.1007/978-94-007-0080-2_7openalex-snapshot
Zero-One Laws: Thesauri and Parametric Conditions
inferred← citeshttps://doi.org/10.1007/978-94-009-2639-4_10openalex-snapshot
Laws in Logic and Combinatorics
inferred← citeshttps://doi.org/10.1007/978-94-011-2080-7_27openalex-snapshot
Random Structures and Zero-One Laws
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_2openalex-snapshot
Oligomorphic groups and homogeneous graphs
inferred← citeshttps://doi.org/10.1007/978-94-017-0487-8_6openalex-snapshot
Infinitary Logic in Finite Model Theory
inferred← citeshttps://doi.org/10.1007/978-94-017-0689-6_20openalex-snapshot
Remarks on a Carnapian Extension of S5
inferred← citeshttps://doi.org/10.1007/bf00383450openalex-snapshot
First order properties of random posets
inferred← citeshttps://doi.org/10.1007/bf02007559openalex-snapshot
Application of a Tauberian theorem to finite model theory
inferred← citeshttps://doi.org/10.1007/bfb0015255openalex-snapshot
Towards a theory of recursive structures
inferred← citeshttps://doi.org/10.1007/bfb0021961openalex-snapshot
From Carnap's modal logic to autoepistemic logic
inferred← citeshttps://doi.org/10.1007/bfb0036168openalex-snapshot
The complexity class θp2: Recent results and applications in AI and modal logic
inferred← citeshttps://doi.org/10.1007/bfb0055756openalex-snapshot
Towards a theory of recursive structures
inferred← citeshttps://doi.org/10.1007/bfb0099486openalex-snapshot
Toward logic tailored for computational complexity
inferred← citeshttps://doi.org/10.1007/s001530050125openalex-snapshot
0-1 laws for recursive structures
inferred← citeshttps://doi.org/10.1007/s00224-008-9148-4openalex-snapshot
Query Evaluation on a Database Given by a Random Graph
inferred← citeshttps://doi.org/10.1007/s11229-008-9351-5openalex-snapshot
The many faces of interpolation
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90112-8openalex-snapshot
On random models of finite power and monadic logic
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00201-4openalex-snapshot
A High-Low Kolmogorov Complexity Law equivalent to the 0–1 Law
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00035-xopenalex-snapshot
Finitistic proofs of 0–1 laws for fragments of second-order logic
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90048-2openalex-snapshot
Threshold spectra via the Ehrenfeucht game
inferred← citeshttps://doi.org/10.1016/0168-0072(87)90017-0openalex-snapshot
Nonconvergence, undecidability, and intractability in asymptotic problems
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90084-1openalex-snapshot
Zero-one laws for modal logic
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90218-iopenalex-snapshot
Finite-model theory - a personal perspective
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00026-sopenalex-snapshot
On the expressive power of counting
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90032-6openalex-snapshot
The computational complexity of asymptotic problems I: Partial orders
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90065-popenalex-snapshot
0–1 Laws and decision problems for fragments of second-order logic
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90021-7openalex-snapshot
Infinitary logics and 0–1 laws
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50027-0openalex-snapshot
10.1016/b978-044488002-4/50027-0
inferred← citeshttps://doi.org/10.1016/j.apal.2007.11.010openalex-snapshot
The complexity of random ordered structures
inferred← citeshttps://doi.org/10.1016/j.apal.2018.12.001openalex-snapshot
Existential monadic second order logic of undirected graphs: The Le Bars conjecture is false
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102915openalex-snapshot
A topological zero-one law and elementary equivalence of finitely generated groups
inferred← citeshttps://doi.org/10.1016/j.apal.2025.103665openalex-snapshot
Random expansions of finite structures with bounded degree
inferred← citeshttps://doi.org/10.1016/j.dam.2019.02.032openalex-snapshot
Zero–one laws for k -variable first-order logic of sparse random graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.01.005openalex-snapshot
Bounded quantifier depth spectra for random graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112802openalex-snapshot
γ-variable first-order logic of uniform attachment random graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115149openalex-snapshot
First-order convergence for 321-avoiding permutations
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.08.009openalex-snapshot
On the zero–one k -law extensions
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.103017openalex-snapshot
Existential monadic second order convergence law fails on sparse random graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2013.07.043openalex-snapshot
Extension of the Zero-one k-law
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.05.030openalex-snapshot
The Complexity of Random Ordered Structures
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105441openalex-snapshot
A convergence law for continuous logic and continuous structures with finite domains
inferred← citeshttps://doi.org/10.1016/j.ijar.2019.04.003openalex-snapshot
The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws
inferred← citeshttps://doi.org/10.1016/j.jal.2013.07.006openalex-snapshot
Infinity and verifiability in Carnapʼs inductive logic
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.12.002openalex-snapshot
Logical limit laws for minor-closed classes of graphs
inferred← citeshttps://doi.org/10.1016/j.spl.2021.109061openalex-snapshot
MSO 0-1 law for recursive random trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115201openalex-snapshot
Random expansions of trees with bounded height
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00231-0openalex-snapshot
Random strongly regular graphs?
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00149-6openalex-snapshot
The 0–1 law fails for monadic existential second-order logic on undirected graphs
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80057-1openalex-snapshot
Listing graphs that satisfy first-order sentences
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00183-9openalex-snapshot
Program schemes, arrays, Lindström quantifiers and zero-one laws
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00086-8openalex-snapshot
0–1 laws by preservation
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80008-5openalex-snapshot
5 Model theory of modal logic
inferred← citeshttps://doi.org/10.1016/s1570-8683(03)00012-0openalex-snapshot
The emergence of reasons conjecture
inferred← citeshttps://doi.org/10.1017/9781316716830.012openalex-snapshot
Convergence Laws for Random Graphs
inferred← citeshttps://doi.org/10.1017/cbo9781316339831openalex-snapshot
Introduction to Random Graphs
inferred← citeshttps://doi.org/10.1017/jsl.2024.46openalex-snapshot
ASYMPTOTIC TRUTH-VALUE LAWS IN MANY-VALUED LOGICS
inferred← citeshttps://doi.org/10.1023/a:1024691507511openalex-snapshot
An Introduction to Random Trees
inferred← citeshttps://doi.org/10.1070/im2008v072n03abeh002412openalex-snapshot
A game on the universe of sets
inferred← citeshttps://doi.org/10.1090/memo/1272openalex-snapshot
A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth
inferred← citeshttps://doi.org/10.1090/s0002-9939-1986-0854036-xopenalex-snapshot
Probabilities on Models of Universal Sentences
inferred← citeshttps://doi.org/10.1090/s0002-9947-1985-0768725-2openalex-snapshot
Probabilities of First-Order Sentences about Unary Functions
inferred← citeshttps://doi.org/10.1090/s0894-0347-1988-0924703-8openalex-snapshot
Zero-One Laws for Sparse Random Graphs
inferred← citeshttps://doi.org/10.1090/s0894-0347-1991-1102581-4openalex-snapshot
When does the zero-one law hold?
inferred← citeshttps://doi.org/10.1093/jigpal/6.4.601openalex-snapshot
Computational model theory: an overview
inferred← citeshttps://doi.org/10.1093/logcom/6.1.137openalex-snapshot
On the Very Weak 0–1 Law for Random Graphs with Orders
inferred← citeshttps://doi.org/10.1093/logcom/exaa061openalex-snapshot
Probabilities of first-order sentences on sparse random relational structures: An application to definability on random CNF formulas
inferred← citeshttps://doi.org/10.1109/focs.2008.61openalex-snapshot
k-Wise Independent Random Graphs
inferred← citeshttps://doi.org/10.1109/fscs.1990.89591openalex-snapshot
Probabilities of sentences about very sparse random graphs
inferred← citeshttps://doi.org/10.1109/lics.1990.113742openalex-snapshot
0-1 laws for infinitary logics
inferred← citeshttps://doi.org/10.1109/lics.1991.151652openalex-snapshot
On the 0-1 law for the class of existential second order minimal Godel sentences with equality
inferred← citeshttps://doi.org/10.1109/lics.1992.185516openalex-snapshot
Random worlds and maximum entropy
inferred← citeshttps://doi.org/10.1109/lics.1992.185549openalex-snapshot
Zero-one laws for modal logic
inferred← citeshttps://doi.org/10.1109/lics.1993.287587openalex-snapshot
Asymptotic probabilities of languages with generalized quantifiers
inferred← citeshttps://doi.org/10.1109/lics.1995.523243openalex-snapshot
The infinitary logic of sparse random graphs
inferred← citeshttps://doi.org/10.1109/lics.1995.523244openalex-snapshot
Generalized quantifiers and 0-1 laws
inferred← citeshttps://doi.org/10.1109/lics.1996.561361openalex-snapshot
More about recursive structures: descriptive complexity and zero-one laws
inferred← citeshttps://doi.org/10.1109/lics.1996.561448openalex-snapshot
Zero-one laws for Gilbert random graphs
inferred← citeshttps://doi.org/10.1109/lics.1998.705642openalex-snapshot
Convergence results for relational Bayesian networks
inferred← citeshttps://doi.org/10.1109/lics.1998.705685openalex-snapshot
Fragments of existential second-order logic without 0-1 laws
inferred← citeshttps://doi.org/10.1109/lics.2002.1029831openalex-snapshot
The 0-1 law fails for frame satisfiability of propositional modal logic
inferred← citeshttps://doi.org/10.1109/lics.2005.14openalex-snapshot
Definability on a Random 3-CNF Formula
inferred← citeshttps://doi.org/10.1109/lics.2007.39openalex-snapshot
Reflections on Finite Model Theory
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470666openalex-snapshot
Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all frames
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00067openalex-snapshot
Convergence Laws for Extensions of First-Order Logic with Averaging
inferred← citeshttps://doi.org/10.1109/sct.1990.113967openalex-snapshot
Bounded arithmetic and computational complexity
inferred← citeshttps://doi.org/10.1109/tfuzz.2021.3131200openalex-snapshot
A 0-1 Law in Mathematical Fuzzy Logic
inferred← citeshttps://doi.org/10.1111/rati.70034openalex-snapshot
On the Limits of Intransitive Coordination
inferred← citeshttps://doi.org/10.1134/s1064562410010151openalex-snapshot
The weak zero-one laws for the random distance graphs
inferred← citeshttps://doi.org/10.1134/s1064562414010062openalex-snapshot
Extension of the zero-one k-law
inferred← citeshttps://doi.org/10.1134/s1064562419030098openalex-snapshot
Zero–One Laws for Sentences with k Variables
inferred← citeshttps://doi.org/10.1137/21m1429655openalex-snapshot
EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs
inferred← citeshttps://doi.org/10.1137/s0040585x97984802openalex-snapshot
The Weak Zero-One Law for the Random Distance Graphs
inferred← citeshttps://doi.org/10.1137/s0097539793257034openalex-snapshot
Asymptotic Conditional Probabilities: The Unary Case
inferred← citeshttps://doi.org/10.1142/s0219061320500075openalex-snapshot
Logical laws for short existential monadic second-order sentences about graphs
inferred← citeshttps://doi.org/10.1145/129712.129741openalex-snapshot
Asymptomatic conditional probabilities for first-order logic
inferred← citeshttps://doi.org/10.1145/1459010.1459017openalex-snapshot
A logical characterization of the counting hierarchy
inferred← citeshttps://doi.org/10.1145/1536414.1536510openalex-snapshot
Random graphs and the parity quantifier
inferred← citeshttps://doi.org/10.1145/167088.167160openalex-snapshot
Polynomial space polynomial delay algorithms for listing families of graphs
inferred← citeshttps://doi.org/10.1145/2528402openalex-snapshot
Random graphs and the parity quantifier
inferred← citeshttps://doi.org/10.1145/2559948openalex-snapshot
Degree lower bounds of tower-type for approximating formulas with parity quantifiers
inferred← citeshttps://doi.org/10.1145/28395.28441openalex-snapshot
The decision problem for the probabilities of higher-order properties
inferred← citeshttps://doi.org/10.1145/3489466openalex-snapshot
Zero-One Laws for Existential First-Order Sentences of Bounded Quantifier Depth
inferred← citeshttps://doi.org/10.1145/3531130.3533358openalex-snapshot
Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics
inferred← citeshttps://doi.org/10.1145/3641547openalex-snapshot
Spectrum of FO Logic with Quantifier Depth 4 is Finite
inferred← citeshttps://doi.org/10.1145/3661814.3662117openalex-snapshot
First order distinguishability of sparse random graphs
inferred← citeshttps://doi.org/10.1145/3661814.3662127openalex-snapshot
First order complexity of finite random structures
inferred← citeshttps://doi.org/10.1214/25-ejp1419openalex-snapshot
Logical convergence laws via stochastic approximation and Markov processes
inferred← citeshttps://doi.org/10.2140/cnt.2025.14.49openalex-snapshot
Modal logics of almost-sure validities in some classes of Euclidean and transitive frames
inferred← citeshttps://doi.org/10.2168/lmcs-7(3:14)2011openalex-snapshot
Randomisation and Derandomisation in Descriptive Complexity Theory
inferred← citeshttps://doi.org/10.2178/jsl/1045861507openalex-snapshot
Strong extension axioms and Shelah's zero-one law for choiceless polynomial time
inferred← citeshttps://doi.org/10.2178/jsl/1190150151openalex-snapshot
Strong convergence in finite model theory
inferred← citeshttps://doi.org/10.2178/jsl/1254748683openalex-snapshot
Almost everywhere elimination of probability quantifiers
inferred← citeshttps://doi.org/10.2307/2274691openalex-snapshot
Asymptotic probabilities of existential second-order Gödel sentences
inferred← citeshttps://doi.org/10.2307/2275609openalex-snapshot
Asymptotic conditional probabilities: The non-unary case
inferred← citeshttps://doi.org/10.2307/2695069openalex-snapshot
Strong 0-1 laws in finite model theory
inferred← citeshttps://doi.org/10.2307/421076openalex-snapshot
Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview
inferred← citeshttps://doi.org/10.2307/421173openalex-snapshot
Almost Everywhere Equivalence of Logics in Finite Model Theory
inferred← citeshttps://doi.org/10.23638/lmcs-15(3:4)2019openalex-snapshot
Logical properties of random graphs from small addable classes
inferred← citeshttps://doi.org/10.3103/s1055134417010035openalex-snapshot
Zero-one laws for random graphs with vertices in a Boolean cube
inferred← citeshttps://doi.org/10.31857/s0869-56524862156-158openalex-snapshot
Zeroone laws for sentences with k variables
inferred← citeshttps://doi.org/10.3233/fi-1994-2041openalex-snapshot
A NOTE ON ASYMPTOTIC PROBABILITIES OF EXISTENTIAL SECOND-ORDER MINIMAL CLASSES – THE LAST STEP
inferred← citeshttps://doi.org/10.3233/fi-2010-232openalex-snapshot
Properties of Almost All Graphs and Generalized Quantifiers
inferred← citeshttps://doi.org/10.37236/1647openalex-snapshot
A Prolific Construction of Strongly Regular Graphs with the $n$-e.c. Property
inferred← citeshttps://doi.org/10.4064/-46-1-93-117openalex-snapshot
Finite models and finitely many variables
inferred← citeshttps://doi.org/10.4230/lipics.csl.2011.218openalex-snapshot
Non-Definability Results for Randomised First-Order Logic
inferred← citeshttps://doi.org/10.4230/lipics.esa.2020.40openalex-snapshot
First-Order Model-Checking in Random Graphs and Complex Networks
inferred← citeshttps://doi.org/10.4310/joc.2010.v1.n4.a3openalex-snapshot
The logic of random regular graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1304.0896openalex-snapshot
On the convergence of probabilities of the random graphs' properties expressed by first-order formulae with a bounded quantifier depth
inferred← citeshttps://doi.org/10.48550/arxiv.1308.5517openalex-snapshot
The infinite random simplicial complex
inferred← citeshttps://doi.org/10.48550/arxiv.1310.6439openalex-snapshot
Reasoning Under the Principle of Maximum Entropy for Modal Logics K45, KD45, and S5
inferred← citeshttps://doi.org/10.48550/arxiv.1411.5290openalex-snapshot
Some examples of asymptotic combinatorial behavior, zero-one and convergence results on random hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1501.07429openalex-snapshot
Convergence law for hyper-graphs with prescribed degree sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1510.06574openalex-snapshot
Random graphs and Lindstrom quantifiers for natural graph properties
inferred← citeshttps://doi.org/10.48550/arxiv.1602.06537openalex-snapshot
Spaces of completions of elementary theories and convergence laws for random hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1609.01115openalex-snapshot
On infinite spectra of first order properties of random graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1807.01794openalex-snapshot
Existential monadic second order logic of undirected graphs: a disproof of the Le Bars conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.math/0605502openalex-snapshot
Zero-one laws for binary random fields
inferred← citeshttps://doi.org/10.48550/arxiv.math/9501221openalex-snapshot
Convergence in homogeneous random graphs
inferred← citeshttps://doi.org/10.5441/002/icdt.2014.21openalex-snapshot
The Theory of Zeta Graphs with an Application to Random Networks
inferred← citeshttps://doi.org/10.54550/eca2022v2s4pp2openalex-snapshot
Logical limit laws for layered permutations and related structures
inferred← citeshttps://doi.org/10.5821/dissertation-2117-398034openalex-snapshot
First order logic of random sparse structures
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.