On the public citation graph
And/or tree probabilities of Boolean functions
0 signed · 26 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.1002/(sici)1098-2418(199705)10:3<337::aid-rsa4>3.0.co;2-xopenalex-snapshot
Some typical properties of large AND/OR Boolean formulas
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199707)10:4<453::aid-rsa3>3.0.co;2-topenalex-snapshot
Coloring rules for finite trees, and probabilities of monadic second order sentences
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199810/12)13:3/4<349::aid-rsa9>3.0.co;2-vopenalex-snapshot
The number of Boolean functions computed by formulas of a given size
inferredcites →https://doi.org/10.1007/3-540-60246-1_130openalex-snapshot
Some typical properties of large AND/OR Boolean formulas
inferredcites →https://doi.org/10.1016/j.entcs.2005.06.022openalex-snapshot
Asymptotic Density for Equivalence
inferredcites →https://doi.org/10.1016/j.entcs.2005.08.003openalex-snapshot
Constructing Induction Rules for Deductive Synthesis Proofs
inferredcites →https://doi.org/10.1016/s0168-0072(94)90011-6openalex-snapshot
A natural prior probability distribution derived from the propositional calculus
inferredcites →https://doi.org/10.1016/s1571-0661(04)80856-9openalex-snapshot
Statistics of implicational logic
inferredcites →https://doi.org/10.1017/s0960129599002959openalex-snapshot
Statistical properties of simple types
inferredcites →https://doi.org/10.1023/b:stud.0000032101.88511.93openalex-snapshot
Statistics of Intuitionistic versus Classical Logics
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.200810053openalex-snapshot
Tautologies over implication with negative literals
inferred← citeshttps://doi.org/10.1007/978-3-319-17142-5_7openalex-snapshot
Asymptotic Properties of Combinatory Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-68103-8_7openalex-snapshot
Intuitionistic vs. Classical Tautologies, Quantitative Comparison
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_16openalex-snapshot
Classical and Intuitionistic Logic Are Asymptotically Identical
inferred← citeshttps://doi.org/10.1080/11663081.2023.2269645openalex-snapshot
Fuzzy logics – quantitatively
inferred← citeshttps://doi.org/10.1093/logcom/exp034openalex-snapshot
On the Density of Truth of Locally Finite Logics
inferred← citeshttps://doi.org/10.1093/logcom/exs017openalex-snapshot
How big is BCI fragment of BCK logic
inferred← citeshttps://doi.org/10.1109/fuzz48607.2020.9177858openalex-snapshot
Quantitative Study of Fuzzy Logics
inferred← citeshttps://doi.org/10.1109/tit.2014.2370638openalex-snapshot
On Reliable Computation by Noisy Random Boolean Formulas
inferred← citeshttps://doi.org/10.1137/1.9781611972962.10openalex-snapshot
Exploring the Average Values of Boolean Functions via Asymptotics and Experimentation
inferred← citeshttps://doi.org/10.37394/23206.2025.24.61openalex-snapshot
Implicational Tautologies with One Variable and Its Negation in Fuzzy Logics
inferred← citeshttps://doi.org/10.46298/dmtcs.3582openalex-snapshot
Subcritical pattern languages for and/or trees
inferred← citeshttps://doi.org/10.46298/dmtcs.3583openalex-snapshot
On density of truth of the intuitionistic logic in one variable
inferred← citeshttps://doi.org/10.48550/arxiv.1709.07849openalex-snapshot
Pemantle's min-plus binary tree
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.