On the public citation graph

Subcritical pattern languages for and/or trees

0 signed · 28 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(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.1007/978-3-540-68103-8_7openalex-snapshot
Intuitionistic vs. Classical Tautologies, Quantitative Comparison
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.1017/cbo9780511801655openalex-snapshot
Analytic Combinatorics
inferredcites →https://doi.org/10.1017/s0963548304006273openalex-snapshot
And/Or Trees Revisited
inferredcites →https://doi.org/10.1063/1.4822863openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science
inferredcites →https://doi.org/10.1201/b19267-16openalex-snapshot
- Analytic combinatorics
inferredcites →https://doi.org/10.2307/2324448openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science.
inferredcites →https://doi.org/10.46298/dmtcs.3355openalex-snapshot
And/or tree probabilities of Boolean functions
inferredcites →https://doi.org/10.46298/dmtcs.3475openalex-snapshot
Random Boolean expressions

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.1002/rsa.20379openalex-snapshot
The fraction of large random trees representing a given Boolean function in implicational logic
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-17142-5_7openalex-snapshot
Asymptotic Properties of Combinatory Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_28openalex-snapshot
Complexity and Limiting Ratio of Boolean Functions over Implication
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/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.apal.2011.09.011openalex-snapshot
In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid
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.1093/logcom/exs017openalex-snapshot
How big is BCI fragment of BCK logic
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.46298/dmtcs.2784openalex-snapshot
No Shannon effect on probability distributions on Boolean functions induced by random expressions
inferred← citeshttps://doi.org/10.46298/dmtcs.3584openalex-snapshot
On the density and the structure of the Peirce-like formulae
inferred← citeshttps://doi.org/10.48550/arxiv.1112.0643openalex-snapshot
How big is BCI fragment of BCK logic
inferred← citeshttps://doi.org/10.48550/arxiv.1304.5615openalex-snapshot
Catalan satisfiability problem
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.