On the public citation graph

Proof theoretic equivalences between classical and constructive theories for analysis

https://doi.org/10.1007/bfb0091896
0 signed · 33 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/malq.19840300102openalex-snapshot
A VERSION OF KRIPKE‐PLATEK SET THEORY WHICH IS CONSERVATIVE OVER PEANO ARITHMETIC
inferred← citeshttps://doi.org/10.1002/malq.19870330407openalex-snapshot
Reflection Principles in Fragments of Peano Arithmetic
inferred← citeshttps://doi.org/10.1002/malq.200310054openalex-snapshot
On the regular extension axiom and its variants
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_5openalex-snapshot
Logics for Termination and Correctness of Functional Programs
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-030-49424-7_9openalex-snapshot
Having a Look Again at Some Theories ofProof-Theoretic Strengths around $$ \varGamma_{0} $$
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3openalex-snapshot
Feferman on Foundations - Logic, Mathematics, Philosophy
inferred← citeshttps://doi.org/10.1007/978-94-017-2109-7_6openalex-snapshot
On Applicative Theories
inferred← citeshttps://doi.org/10.1007/bf01278464openalex-snapshot
The strength of some Martin-L�f type theories
inferred← citeshttps://doi.org/10.1007/bfb0022549openalex-snapshot
Gödel's Dialectica interpretation and its two-way stretch
inferred← citeshttps://doi.org/10.1007/s001530050105openalex-snapshot
The $\mu$ quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals
inferred← citeshttps://doi.org/10.1016/0168-0072(85)90030-2openalex-snapshot
Fragments of arithmetic
inferred← citeshttps://doi.org/10.1016/0168-0072(89)90019-5openalex-snapshot
Monotone inductive definitions in a constructive theory of functions and classes
inferred← citeshttps://doi.org/10.1016/0168-0072(94)00058-bopenalex-snapshot
Understanding uniformity in Feferman's explicit mathematics
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90074-4openalex-snapshot
Proof theory of reflection
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80041-8openalex-snapshot
Admissible proof theory and beyond
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71364-8openalex-snapshot
Iterated Inductive Fixed-Point Theories: Application to Hancock's Conjecture
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70124-7openalex-snapshot
Monotone Inductive Definitions
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70158-2openalex-snapshot
Friedman's Research on Subsystems of Second Order Arithmetic
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80020-7openalex-snapshot
Gödel’s Functional (“Dialectica”) Interpretation
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00030-1openalex-snapshot
Saturated models of universal theories
inferred← citeshttps://doi.org/10.1016/s0168-0072(96)00005-xopenalex-snapshot
Systems of explicit mathematics with non-constructive μ-operator and join
inferred← citeshttps://doi.org/10.1016/s0168-0072(96)00040-1openalex-snapshot
On the proof-theoretic strength of monotone induction in explicit mathematics
inferred← citeshttps://doi.org/10.1017/9781316755983.016openalex-snapshot
Explicit mathematics with monotone inductive definitions: A survey
inferred← citeshttps://doi.org/10.1017/s0022481200028310openalex-snapshot
Hilbert's program relativized; Proof-theoretical and foundational reductions
inferred← citeshttps://doi.org/10.1023/a:1026287119565openalex-snapshot
Hilbert's Program Revisited
inferred← citeshttps://doi.org/10.1090/conm/106/1057815openalex-snapshot
A note on polynomial time computable arithmetic
inferred← citeshttps://doi.org/10.1093/oso/9780190641221.003.0014openalex-snapshot
Methodological Frames: Paul Bernays, Mathematical Structuralism, and Proof Theory
inferred← citeshttps://doi.org/10.2307/2273321openalex-snapshot
Choice principles, the bar rule and autonomously iterated comprehension schemes in analysis
inferred← citeshttps://doi.org/10.2307/2274260openalex-snapshot
The strength of nonstandard methods in arithmetic
inferred← citeshttps://doi.org/10.2307/2274902openalex-snapshot
Reflecting on incompleteness
inferred← citeshttps://doi.org/10.2307/2275671openalex-snapshot
On power set in explicit mathematics
inferred← citeshttps://doi.org/10.48550/arxiv.2010.07368openalex-snapshot
The consistency of arithmetic from a point of view of constructive tableau method with strong negation, Part I: the system without complete induction
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.