On the public citation graph

The fraction of large random trees representing a given Boolean function in implicational logic

0 signed · 49 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.
Claim with ORCID
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.
See reference health

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(199701/03)10:1/2<103::aid-rsa5>3.0.co;2-zopenalex-snapshot
Systems of functional equations
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/malq.200810053openalex-snapshot
Tautologies over implication with negative literals
inferredcites →https://doi.org/10.1002/rsa.20095openalex-snapshot
The Boolean functions computed by random Boolean formulas or how to grow the right function
inferredcites →https://doi.org/10.1007/978-0-8176-4763-6openalex-snapshot
Logic for Computer Scientists
inferredcites →https://doi.org/10.1007/978-3-540-74915-8_16openalex-snapshot
Classical and Intuitionistic Logic Are Asymptotically Identical
inferredcites →https://doi.org/10.1007/978-3-540-85238-4_28openalex-snapshot
Complexity and Limiting Ratio of Boolean Functions over Implication
inferredcites →https://doi.org/10.1007/978-3-540-92687-0_19openalex-snapshot
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System
inferredcites →https://doi.org/10.1007/978-3-642-65371-1openalex-snapshot
Branching Processes
inferredcites →https://doi.org/10.1007/bf01202041openalex-snapshot
Using amplification to compute majority with small majority gates
inferredcites →https://doi.org/10.1016/0012-365x(90)90223-5openalex-snapshot
Random boolean formulas representing any boolean function with asymptotically equal probability
inferredcites →https://doi.org/10.1016/0196-6774(84)90016-6openalex-snapshot
Short monotone formulae for the majority function
inferredcites →https://doi.org/10.1016/0743-1066(84)90014-1openalex-snapshot
Linear-time algorithms for testing the satisfiability of propositional horn formulae
inferredcites →https://doi.org/10.1016/j.entcs.2005.06.022openalex-snapshot
Asymptotic Density for Equivalence
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/cbo9780511801655openalex-snapshot
Analytic Combinatorics
inferredcites →https://doi.org/10.1017/s0960129507006391openalex-snapshot
On asymptotic divergency in equivalential logics
inferredcites →https://doi.org/10.1017/s0960129599002959openalex-snapshot
Statistical properties of simple types
inferredcites →https://doi.org/10.1017/s0963548304006273openalex-snapshot
And/Or Trees Revisited
inferredcites →https://doi.org/10.1023/b:stud.0000032101.88511.93openalex-snapshot
Statistics of Intuitionistic versus Classical Logics
inferredcites →https://doi.org/10.1109/sfcs.1985.5openalex-snapshot
Amplification of probabilistic boolean formulas
inferredcites →https://doi.org/10.1137/1.9781611972993.8openalex-snapshot
Balanced And/Or trees and linear threshold functions
inferredcites →https://doi.org/10.1142/4731openalex-snapshot
The Mathematical Foundation of Informatics
inferredcites →https://doi.org/10.1142/9789812703118_0014openalex-snapshot
The Complexity of Problems Defined by Boolean Circuits
inferredcites →https://doi.org/10.1201/b19267-16openalex-snapshot
- Analytic combinatorics
inferredcites →https://doi.org/10.1214/aop/1176989012openalex-snapshot
Finite Range Random Walk on Free Groups and Homogeneous Trees
inferredcites →https://doi.org/10.2178/bsl/1154698744openalex-snapshot
2005 Annual Conference of the Australasian Association for Logic
inferredcites →https://doi.org/10.2307/2268661openalex-snapshot
On sentences which are true of direct unions of algebras
inferredcites →https://doi.org/10.3166/jancl.13.391-421openalex-snapshot
On the density of truth of implicational parts of intuitionistic and classical logics
inferredcites →https://doi.org/10.46298/dmtcs.3475openalex-snapshot
Random Boolean expressions
inferredcites →https://doi.org/10.46298/dmtcs.3500openalex-snapshot
Density of truth in modal logics
inferredcites →https://doi.org/10.46298/dmtcs.3582openalex-snapshot
Subcritical pattern languages for and/or trees
inferredcites →https://doi.org/10.46298/dmtcs.3585openalex-snapshot
Boltzmann Oracle for Combinatorial Systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rsa.20567openalex-snapshot
A sprouting tree model for random boolean functions
inferred← citeshttps://doi.org/10.1002/rsa.20758openalex-snapshot
And/or trees: A local limit point of view
inferred← citeshttps://doi.org/10.1007/978-3-319-93725-0openalex-snapshot
Arbres pour l’Algorithmique
inferred← citeshttps://doi.org/10.1007/978-3-319-93725-0_3openalex-snapshot
Arbres, algorithmes et données
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_41openalex-snapshot
Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/s00026-018-0371-7openalex-snapshot
On the Number of Unary-Binary Tree-Like Structures with Restrictions on the Unary Height
inferred← citeshttps://doi.org/10.1007/s00453-016-0113-3openalex-snapshot
Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability
inferred← citeshttps://doi.org/10.1007/s00453-016-0119-xopenalex-snapshot
2-Xor Revisited: Satisfiability and Probabilities of Functions
inferred← citeshttps://doi.org/10.1016/j.dam.2017.12.042openalex-snapshot
Enumerating lambda terms by weighted length of their De Bruijn representation
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.12.025openalex-snapshot
Associative and commutative tree representations for Boolean functions
inferred← citeshttps://doi.org/10.2298/aadm160715015dopenalex-snapshot
The relation between tree size complexity and probability for Boolean functions generated by uniform random trees
inferred← citeshttps://doi.org/10.37236/2402openalex-snapshot
Probabilities of Boolean Functions given by Random Implicational Formulas
inferred← citeshttps://doi.org/10.48550/arxiv.1304.5615openalex-snapshot
Catalan satisfiability problem
inferred← citeshttps://doi.org/10.48550/arxiv.1305.0651openalex-snapshot
Associative and commutative tree representations for Boolean functions
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.