On the public citation graph

Intuitionistic formal systems

https://doi.org/10.1007/bfb0066740
0 signed · 17 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.200810046openalex-snapshot
Unavoidable sequences in constructive analysis
inferred← citeshttps://doi.org/10.1007/3-540-10009-1_4openalex-snapshot
Proofs as descriptions of computation
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_46openalex-snapshot
Two semantics and logics based on the Gödel interpretation
inferred← citeshttps://doi.org/10.1007/978-3-030-80049-9_33openalex-snapshot
Minimum Classical Extensions of Constructive Theories
inferred← citeshttps://doi.org/10.1007/bf00157539openalex-snapshot
A free IPC is a natural logic: Strong completeness for some intuitionistic free logics
inferred← citeshttps://doi.org/10.1007/bf01084980openalex-snapshot
Theory of proofs (arithmetic and analysis)
inferred← citeshttps://doi.org/10.1007/bf01247653openalex-snapshot
On arithmetic complexity of certain constructive logics
inferred← citeshttps://doi.org/10.1007/s00153-012-0273-zopenalex-snapshot
Some axioms for constructive analysis
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/0165-0114(92)90186-8openalex-snapshot
Formal frameworks for approximate reasoning
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90002-uopenalex-snapshot
The intuitionistic alternative set theory
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00061-6openalex-snapshot
Arithmetic complexity of the predicate logics of certain complete arithmetic theories
inferred← citeshttps://doi.org/10.1023/a:1005207512630openalex-snapshot
A Negationless Interpretation of Intuitionistic Theories. II
inferred← citeshttps://doi.org/10.1090/s0002-9939-1979-0512067-xopenalex-snapshot
𝐶𝑇₀ is stronger than 𝐶𝑇₀!
inferred← citeshttps://doi.org/10.1090/s0002-9939-1979-0545601-4openalex-snapshot
An Intuitionistic Definition of Classical Natural Numbers
inferred← citeshttps://doi.org/10.1215/00294527-2007-005openalex-snapshot
Reflexive Intermediate First-Order Logics
inferred← citeshttps://doi.org/10.1215/00294527-2021-0034openalex-snapshot
Solovay’s Relative Consistency Proof for FIM and BI
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.