On the public citation graph
Classically and intuitionistically provably recursive functions
0 signed · 177 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.2307/2272068openalex-snapshot
The consistency of classical set theory relative to a set theory with intu1tionistic logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.0253/tuprints-00002851openalex-snapshot
Proof interpretations: theoretical and practical aspects
inferred← citeshttps://doi.org/10.1002/malq.19950410304openalex-snapshot
The Friedman‐Translation for Martin‐Löf's Type Theory
inferred← citeshttps://doi.org/10.1002/malq.200310074openalex-snapshot
A generalization of a conservativity theorem for classical versus intuitionistic arithmetic
inferred← citeshttps://doi.org/10.1002/malq.200710045openalex-snapshot
Dialectica interpretation of well‐founded induction
inferred← citeshttps://doi.org/10.1006/inco.1996.0025openalex-snapshot
A Symmetric Lambda Calculus for Classical Program Extraction
inferred← citeshttps://doi.org/10.1007/11753728_27openalex-snapshot
Unwinding a Non-effective Cut Elimination Proof
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_1openalex-snapshot
A constructive valuation interpretation for classical logic and its use in witness extraction
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_112openalex-snapshot
A symmetric lambda calculus for “classical” program extraction
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_80openalex-snapshot
Program extraction from classical proofs
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_84openalex-snapshot
Intrinsic theories and computational complexity
inferred← citeshttps://doi.org/10.1007/3-540-61780-9_60openalex-snapshot
The greatest common divisor: A case study for program extraction from classical proofs
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_41openalex-snapshot
Markov's rule is admissible in the set theory with intuitionistic logic
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_14openalex-snapshot
New Developments in Proofs and Computations
inferred← citeshttps://doi.org/10.1007/978-1-4899-0548-2_9openalex-snapshot
Reductions of Theories for Analysis
inferred← citeshttps://doi.org/10.1007/978-3-031-08740-0_3openalex-snapshot
Maximal Ideals in Countable Rings, Constructively
inferred← citeshttps://doi.org/10.1007/978-3-031-47921-2_2openalex-snapshot
Lewisian Fixed Points I: Two Incomparable Constructions
inferred← citeshttps://doi.org/10.1007/978-3-319-00966-7_1openalex-snapshot
Foundations of Mathematics from the Perspective of Computer Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-08918-8_7openalex-snapshot
Ramsey Theorem as an Intuitionistic Property of Well Founded Relations
inferred← citeshttps://doi.org/10.1007/978-3-319-10103-3_18openalex-snapshot
A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-20762-9_9openalex-snapshot
Verificationism and Classical Realizability
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_34openalex-snapshot
Axioms for Delimited Continuations in the CPS Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-540-36351-4_2openalex-snapshot
Kolmogorov’s contribution to intuitionistic logic
inferred← citeshttps://doi.org/10.1007/978-3-540-78969-7_16openalex-snapshot
A New Translation for Semi-classical Theories — Backtracking without CPS
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_17openalex-snapshot
A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_15openalex-snapshot
Relating Classical Realizability and Negative Translation for Existential Witness Extraction
inferred← citeshttps://doi.org/10.1007/978-3-642-12251-4_16openalex-snapshot
Internal Normalization, Compilation and Decompilation for System ${\mathcal F}_{\beta\eta}$
inferred← citeshttps://doi.org/10.1007/978-3-642-13962-8_17openalex-snapshot
The Peirce Translation and the Double Negation Shift
inferred← citeshttps://doi.org/10.1007/978-3-642-21691-6_1openalex-snapshot
A Survey of Classical Realizability
inferred← citeshttps://doi.org/10.1007/978-3-642-21691-6_4openalex-snapshot
Combining Proofs and Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_28openalex-snapshot
Semantic A-translations and Super-Consistency Entail Classical Cut Elimination
inferred← citeshttps://doi.org/10.1007/978-3-642-58041-3_2openalex-snapshot
Lectures on:Classical Proofs as Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-79361-5_1openalex-snapshot
Program Development by Proof Transformation
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_29openalex-snapshot
A Classical Sequent Calculus with Dependent Types
inferred← citeshttps://doi.org/10.1007/978-3-662-54458-7_28openalex-snapshot
Automated Constructivization of Proofs
inferred← citeshttps://doi.org/10.1007/978-94-011-5690-5_11openalex-snapshot
Aspects of Mathematical Experience
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_2openalex-snapshot
Proof Theory at Work: Program Development in the Minlog System
inferred← citeshttps://doi.org/10.1007/978-981-15-6459-8_3openalex-snapshot
Cut-Elimination with Depths
inferred← citeshttps://doi.org/10.1007/bf02671615openalex-snapshot
Transfer theorems and the algebra of modal operators
inferred← citeshttps://doi.org/10.1007/bfb0021084openalex-snapshot
Classical proofs as programs: How, what and why
inferred← citeshttps://doi.org/10.1007/bfb0023872openalex-snapshot
A constructive proof that tree are well-quasi-ordered under minors (detailed abstract)
inferred← citeshttps://doi.org/10.1007/bfb0037097openalex-snapshot
Extracting constructive content from classical logic via control-like reductions
inferred← citeshttps://doi.org/10.1007/s00153-004-0233-3openalex-snapshot
A realizability interpretation for classical analysis
inferred← citeshttps://doi.org/10.1007/s00153-010-0209-4openalex-snapshot
Intermediate Logics and the de Jongh property
inferred← citeshttps://doi.org/10.1007/s00153-024-00959-wopenalex-snapshot
Herbrand schemes for first-order logic
inferred← citeshttps://doi.org/10.1007/s001530000057openalex-snapshot
Typed lambda-calculus in classical Zermelo-Frænkel set theory
inferred← citeshttps://doi.org/10.1007/s10817-022-09647-xopenalex-snapshot
Synthetic Undecidability and Incompleteness of First-Order Axiom Systems in Coq
inferred← citeshttps://doi.org/10.1007/s10990-007-9009-xopenalex-snapshot
Axioms for control operators in the CPS hierarchy
inferred← citeshttps://doi.org/10.1007/s11225-011-9367-6openalex-snapshot
Negative Translations Not Intuitionistically Equivalent to the Usual Ones
inferred← citeshttps://doi.org/10.1007/s11225-015-9639-7openalex-snapshot
A Semantic Approach to Conservativity
inferred← citeshttps://doi.org/10.1007/s11225-019-09877-yopenalex-snapshot
Satisfiability is False Intuitionistically: A Question from Dana Scott
inferred← citeshttps://doi.org/10.1007/s11225-023-10037-6openalex-snapshot
A First-Order Expansion of Artemov and Protopopescu’s Intuitionistic Epistemic Logic
inferred← citeshttps://doi.org/10.1007/s11229-004-6294-3openalex-snapshot
Notes on Constructive Negation
inferred← citeshttps://doi.org/10.1007/s11229-022-03960-zopenalex-snapshot
Putnam’s model-theoretic argument (meta)reconstructed
inferred← citeshttps://doi.org/10.1016/0001-8708(85)90103-3openalex-snapshot
The lack of definable witnesses and provably recursive functions in intuitionistic set theories
inferred← citeshttps://doi.org/10.1016/0003-4843(82)90024-9openalex-snapshot
On the completenes principle: A study of provability in heyting's arithmetic and extensions
inferred← citeshttps://doi.org/10.1016/0168-0072(84)90033-2openalex-snapshot
Large sets in intuitionistic set theory
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90004-7openalex-snapshot
Intuitionistically provable recursive well-orderings
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90043-6openalex-snapshot
Epistemic and intuitionistic formal systems
inferred← citeshttps://doi.org/10.1016/0168-0072(88)90040-1openalex-snapshot
A transfer theorem in constructive real algebra
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90022-eopenalex-snapshot
What's so special about Kruskal's theorem and the ordinal Γo? A survey of some results in proof theory
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90091-qopenalex-snapshot
Intuitionistic validity in T-normal Kripke structures
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00004-zopenalex-snapshot
A strong normalization result for classical logic
inferred← citeshttps://doi.org/10.1016/j.apal.2004.10.011openalex-snapshot
Control structures in programs and computational complexity
inferred← citeshttps://doi.org/10.1016/j.apal.2008.01.004openalex-snapshot
Programs from proofs using classical dependent choice
inferred← citeshttps://doi.org/10.1016/j.apal.2014.10.001openalex-snapshot
A new model construction by making a detour via intuitionistic theories I: Operational set theory without choice is Π 1 -equivalent to KP
inferred← citeshttps://doi.org/10.1016/j.apal.2015.08.002openalex-snapshot
An intuitionistic version of Ramsey's Theorem and its use in Program Termination
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102843openalex-snapshot
The FAN principle and weak König's lemma in herbrandized second-order arithmetic
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.071openalex-snapshot
Practical Program Extraction from Classical Proofs
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.09.034openalex-snapshot
Classical Realizability in the CPS Target Language
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.01.004openalex-snapshot
Deriving a Floyd–Hoare logic for non-local jumps from a formulæ-as-types notion of control
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.12.019openalex-snapshot
A complexity analysis of functional interpretations
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.02.022openalex-snapshot
Internal models of system F for decompilation
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70122-3openalex-snapshot
Formulas of One Propositional Variable in Intuitionistic Arithmetic
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70144-2openalex-snapshot
Nonstandard Models and Constructivity
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70160-0openalex-snapshot
Nonstandard Models and Related Developments
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70161-2openalex-snapshot
Intuitionistic formal systems
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70162-4openalex-snapshot
Intuitionistic Set Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80018-9openalex-snapshot
Hierarchies of Provably Recursive Functions
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80025-6openalex-snapshot
Types in Logic, Mathematics and Programming
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00073-2openalex-snapshot
Refined program extraction from classical proofs
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00081-1openalex-snapshot
Substitutions of Σ10-sentences: explorations between intuitionistic propositional logic and intuitionistic arithmetic
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70018-4openalex-snapshot
Lambda-Calculus and Combinators in the 20th Century
inferred← citeshttps://doi.org/10.1017/9781316756140.007openalex-snapshot
A Realizability Interpretation for Classical Arithmetic
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.002openalex-snapshot
Computability and analysis: the legacy of Alan Turing
inferred← citeshttps://doi.org/10.1017/jsl.2021.47openalex-snapshot
PRENEX NORMAL FORM THEOREMS IN SEMI-CLASSICAL ARITHMETIC
inferred← citeshttps://doi.org/10.1017/jsl.2022.25openalex-snapshot
CONSERVATION THEOREMS ON SEMI-CLASSICAL ARITHMETIC
inferred← citeshttps://doi.org/10.1017/jsl.2022.38openalex-snapshot
AN ESCAPE FROM VARDANYAN’S THEOREM
inferred← citeshttps://doi.org/10.1017/s0956796800000952openalex-snapshot
A-translation and looping combinators in pure type systems
inferred← citeshttps://doi.org/10.1017/s0960129501003309openalex-snapshot
The Russell–Prawitz modality
inferred← citeshttps://doi.org/10.1017/s0960129511000156openalex-snapshot
A pluralist approach to the formalisation of mathematics
inferred← citeshttps://doi.org/10.1017/s0960129513000455openalex-snapshot
Interactive Realizability for second-order Heyting arithmetic with EM1 and SK1
inferred← citeshttps://doi.org/10.1017/s0960129514000450openalex-snapshot
Specifying Peirce's law in classical realizability
inferred← citeshttps://doi.org/10.1017/s0960129515000468openalex-snapshot
Constructive forcing, CPS translations and witness extraction in Interactive realizability
inferred← citeshttps://doi.org/10.1017/s0960129515000559openalex-snapshot
Classical realizability and arithmetical formulæ
inferred← citeshttps://doi.org/10.1017/s0960129516000050openalex-snapshot
Realizability algebras III: some examples
inferred← citeshttps://doi.org/10.1017/s1471068424000176openalex-snapshot
Property-Based Testing by Elaborating Proof Outlines
inferred← citeshttps://doi.org/10.1017/s175502032510097xopenalex-snapshot
CONSTRUCTIVE ARITHMETICAL IMPOSSIBILITIES AND THEIR RELATION TO PARADOXES
inferred← citeshttps://doi.org/10.1023/a:1005033725849openalex-snapshot
Simplicity and Incompleteness
inferred← citeshttps://doi.org/10.1023/a:1026748613865openalex-snapshot
The Warshall Algorithm and Dickson's Lemma: Two Examples of Realistic Program Extraction
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566519.003.0008openalex-snapshot
APPLICATIONS OF INDUCTIVE DEFINITIONS AND CHOICE PRINCIPLES TO PROGRAM SYNTHESIS
inferred← citeshttps://doi.org/10.1093/logcom/exn001openalex-snapshot
Pedagogical Second-order Propositional Calculi
inferred← citeshttps://doi.org/10.1093/logcom/exq011openalex-snapshot
Exploring the Computational Content of the Infinite Pigeonhole Principle
inferred← citeshttps://doi.org/10.1093/logcom/exu049openalex-snapshot
Pedagogical lambda-cube: the 2 case
inferred← citeshttps://doi.org/10.1093/philmat/nkac024openalex-snapshot
Maria Hämeen-Anttila and Jan von Plato, eds,Kurt Gödel: The Princeton Lectures on Intuitionism
inferred← citeshttps://doi.org/10.1109/lics.1991.151634openalex-snapshot
An evaluation semantics for classical proofs
inferred← citeshttps://doi.org/10.1109/lics.1992.185523openalex-snapshot
A computational analysis of Girard's translation and LC
inferred← citeshttps://doi.org/10.1109/lics.1995.523262openalex-snapshot
Experience using type theory as a foundation for computer science
inferred← citeshttps://doi.org/10.1109/lics.1995.523280openalex-snapshot
Games semantics for full propositional linear logic
inferred← citeshttps://doi.org/10.1109/lics.2000.855779openalex-snapshot
The curry-howard correspondence in set theory
inferred← citeshttps://doi.org/10.1109/lics.2004.1319627openalex-snapshot
A computational interpretation of open induction
inferred← citeshttps://doi.org/10.1109/lics.2004.2openalex-snapshot
A computational interpretation of open induction
inferred← citeshttps://doi.org/10.1109/lics.2010.23openalex-snapshot
Polarity and the Logic of Delimited Continuations
inferred← citeshttps://doi.org/10.1109/lics.2010.49openalex-snapshot
An Intuitionistic Logic that Proves Markov's Principle
inferred← citeshttps://doi.org/10.1109/lics.2012.47openalex-snapshot
A Constructive Proof of Dependent Choice, Compatible with Classical Logic
inferred← citeshttps://doi.org/10.1109/lics.2017.8005113openalex-snapshot
An effectful way to eliminate addiction to dependence
inferred← citeshttps://doi.org/10.1111/j.1746-8361.2008.01141.xopenalex-snapshot
Gödel's Functional Interpretation and its Use in Current Mathematics
inferred← citeshttps://doi.org/10.1134/s0001434611050038openalex-snapshot
Effectivity properties of intuitionistic set theory with collection scheme
inferred← citeshttps://doi.org/10.1145/2603088.2603156openalex-snapshot
Formulae-as-types for an involutive negation
inferred← citeshttps://doi.org/10.1145/3230625openalex-snapshot
A Classical Sequent Calculus with Dependent Types
inferred← citeshttps://doi.org/10.1145/3293880.3294091openalex-snapshot
On synthetic undecidability in Coq, with an application to the Entscheidungsproblem
inferred← citeshttps://doi.org/10.1145/3373718.3394740openalex-snapshot
Russian Constructivism in a Prefascist Theory
inferred← citeshttps://doi.org/10.1145/3661814.3662070openalex-snapshot
“Upon This Quote I Will Build My Church Thesis”
inferred← citeshttps://doi.org/10.1184/r1/6491222.v1openalex-snapshot
Computability and analysis: the legacy of Alan Turing
inferred← citeshttps://doi.org/10.1184/r1/6587498openalex-snapshot
A judgmental analysis of linear logic
inferred← citeshttps://doi.org/10.1215/00294527-1716811openalex-snapshot
The Computational Content of Arithmetical Proofs
inferred← citeshttps://doi.org/10.1215/00294527-2021-0004openalex-snapshot
Induction, Constructivity, and Grounding
inferred← citeshttps://doi.org/10.1305/ndjfl/1039293063openalex-snapshot
Intuitionistic Open Induction and Least Number Principle and the Buss Operator
inferred← citeshttps://doi.org/10.1305/ndjfl/1039886522openalex-snapshot
A Constructive Valuation Semantics for Classical Logic
inferred← citeshttps://doi.org/10.1305/ndjfl/1040609297openalex-snapshot
On Theorems of Gödel and Kreisel: Completeness and Markov's Principle
inferred← citeshttps://doi.org/10.1305/ndjfl/1093636765openalex-snapshot
Finite Kripke models of ${\rm HA}$ are locally ${\rm PA}$.
inferred← citeshttps://doi.org/10.1515/9783110324921.227openalex-snapshot
On the Relation Between Various Negative Translations
inferred← citeshttps://doi.org/10.2168/lmcs-7(2:2)2011openalex-snapshot
Existential witness extraction in classical realizability and via a negative translation
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:10)2012openalex-snapshot
Realizability algebras II : new models of ZF + DC
inferred← citeshttps://doi.org/10.2178/jsl/1045861513openalex-snapshot
Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories
inferred← citeshttps://doi.org/10.2178/jsl/1082418535openalex-snapshot
A partial analysis of modified realizability
inferred← citeshttps://doi.org/10.2178/jsl/1230396921openalex-snapshot
Completeness and incompleteness for intuitionistic logic
inferred← citeshttps://doi.org/10.2178/jsl/1254748682openalex-snapshot
Functional interpretation and inductive definitions
inferred← citeshttps://doi.org/10.2307/2274322openalex-snapshot
Syntactic translations and provably recursive functions
inferred← citeshttps://doi.org/10.2307/2695075openalex-snapshot
Interpreting classical theories in constructive ones
inferred← citeshttps://doi.org/10.23638/lmcs-13(3:30)2017openalex-snapshot
A bound for Dickson's lemma
inferred← citeshttps://doi.org/10.23889/suthesis.57831openalex-snapshot
Enhanced Realizability Interpretation for Program Extraction
inferred← citeshttps://doi.org/10.29007/b294openalex-snapshot
Embedding Intuitionistic into Classical Logic
inferred← citeshttps://doi.org/10.29007/vbs5openalex-snapshot
A Lightweight Double-negation Translation
inferred← citeshttps://doi.org/10.2969/msjmemoirs/00201c050openalex-snapshot
Constructivization via Approximations and Examples
inferred← citeshttps://doi.org/10.3217/jucs-019-06-0729openalex-snapshot
Investigations on a Pedagogical Calculus of Constructions
inferred← citeshttps://doi.org/10.3233/com-230454openalex-snapshot
Reifying dynamical algebra: Maximal ideals in countable rings, constructively
inferred← citeshttps://doi.org/10.4204/eptcs.113.4openalex-snapshot
A survey of classical realizability
inferred← citeshttps://doi.org/10.4204/eptcs.351.4openalex-snapshot
A General Glivenko–Gödel Theorem for Nuclei
inferred← citeshttps://doi.org/10.4204/eptcs.47.8openalex-snapshot
Dialectica Interpretation with Marked Counterexamples
inferred← citeshttps://doi.org/10.4204/eptcs.97.1openalex-snapshot
Interactive Realizability and the elimination of Skolem functions in Peano Arithmetic
inferred← citeshttps://doi.org/10.4213/mzm8547openalex-snapshot
Свойства эффективности интуиционистской теории множеств со схемой collection
inferred← citeshttps://doi.org/10.4230/lipics.csl.2015.343openalex-snapshot
Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness
inferred← citeshttps://doi.org/10.4230/lipics.fscd.2021.20openalex-snapshot
Semantic A-translation and Super-consistency entail Classical Cut Elimination
inferred← citeshttps://doi.org/10.48550/arxiv.1005.2907openalex-snapshot
Interactive Realizers and Monads
inferred← citeshttps://doi.org/10.48550/arxiv.1112.1554openalex-snapshot
A program logic for higher-order procedural variables and non-local jumps
inferred← citeshttps://doi.org/10.48550/arxiv.1903.07616openalex-snapshot
A constructive proof of dependent choice in classical arithmetic via memoization
inferred← citeshttps://doi.org/10.48550/arxiv.2006.11910openalex-snapshot
Not all Kripke models of $\sf HA$ are locally $\sf PA$
inferred← citeshttps://doi.org/10.5282/edoc.13505openalex-snapshot
Refinement of Classical Proofs for Program Extraction
inferred← citeshttps://doi.org/10.5282/edoc.14030openalex-snapshot
Analysis of methods for extraction of programs from non-constructive proofs
inferred← citeshttps://doi.org/10.5555/1788446.1788469openalex-snapshot
A new translation for semi-classical theories: backtracking without CPS
inferred← citeshttps://doi.org/10.70675/2c4422f8z1cafz4e76z85e9z4ba8ed705623openalex-snapshot
Game semantics and realizability for classical logic
inferred← citeshttps://doi.org/10.70675/ebffbe00z3617z41e5z91bfzd4ec1aa303afopenalex-snapshot
Le statut dynamique des axiomes : des preuves aux modèles
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.