On the public citation graph
How big is BCI fragment of BCK logic
0 signed · 36 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(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(199701/03)10:1/2<103::aid-rsa5>3.3.co;2-0openalex-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/rsa.10074openalex-snapshot
The Wiener Index of simply generated random trees
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-92687-0_19openalex-snapshot
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System
inferredcites →https://doi.org/10.1016/j.entcs.2005.06.022openalex-snapshot
Asymptotic Density for Equivalence
inferredcites →https://doi.org/10.1016/j.tcs.2006.01.002openalex-snapshot
Probability distribution for simple tautologies
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
inferredcites →https://doi.org/10.1214/aop/1176989012openalex-snapshot
Finite Range Random Walk on Free Groups and Homogeneous Trees
inferredcites →https://doi.org/10.46298/dmtcs.3355openalex-snapshot
And/or tree probabilities of Boolean functions
inferredcites →https://doi.org/10.46298/dmtcs.3582openalex-snapshot
Subcritical pattern languages for and/or trees
inferredcites →https://doi.org/10.46298/dmtcs.3584openalex-snapshot
On the density and the structure of the Peirce-like formulae
inferredcites →https://doi.org/10.5380/rsa.v10i4.14727openalex-snapshot
OCORRÊNCIA DE DOENÇAS EM “PAK CHOI” EM CULTIVOS COM COBERTURAS DO SOLO E DA PLANTA COM POLIPROPILENO
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-19686-2_9openalex-snapshot
On Logic Programming Representations of Lambda Terms: de Bruijn Indices, Compression, Type Inference, Combinatorial Generation, Normalization
inferred← citeshttps://doi.org/10.1007/978-3-319-28228-2_7openalex-snapshot
A Size-Proportionate Bijective Encoding of Lambda Terms as Catalan Objects Endowed with Arithmetic Operations
inferred← citeshttps://doi.org/10.1016/j.bspc.2023.105293openalex-snapshot
MI brain-computer interfaces: A concise overview
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.1109/synasc.2015.33openalex-snapshot
On Synergies between Type Inference, Generation and Normalization of SK-Combinator Trees
inferred← citeshttps://doi.org/10.1137/1.9781611973204.3openalex-snapshot
On the asymptotic number of BCK(2)-terms
inferred← citeshttps://doi.org/10.1145/2790449.2790526openalex-snapshot
On a uniform representation of combinators, arithmetic, lambda terms and types
inferred← citeshttps://doi.org/10.1145/3173547openalex-snapshot
Quantitative Aspects of Linear and Affine Closed Lambda Terms
inferred← citeshttps://doi.org/10.2168/lmcs-11(3:22)2015openalex-snapshot
A correspondence between rooted planar maps and normal planar lambda terms
inferred← citeshttps://doi.org/10.37236/3051openalex-snapshot
Enumeration of Generalized $BCI$ Lambda-terms
inferred← citeshttps://doi.org/10.37236/8579openalex-snapshot
Distribution of Variables in Lambda-Terms with Restrictions on De Bruijn Indices and De Bruijn Levels
inferred← citeshttps://doi.org/10.46298/dmtcs.5836openalex-snapshot
Unary profile of lambda terms with restricted De Bruijn indices
inferred← citeshttps://doi.org/10.48550/arxiv.1507.06944openalex-snapshot
A Logic Programming Playground for Lambda Terms, Combinators, Types and Tree-based Arithmetic Computations
inferred← citeshttps://doi.org/10.48550/arxiv.1702.03085openalex-snapshot
Quantitative aspects of linear and affine closed lambda terms
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.