On the public citation graph

The strength of some Martin-L�f type theories

0 signed · 87 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.1007/978-3-642-68952-9openalex-snapshot
Foundations of Constructive Mathematics
inferredcites →https://doi.org/10.1007/978-3-662-11035-5openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.1007/bf01269951openalex-snapshot
Type-theoretic interpretation of iterated, strictly positive inductive definitions
inferredcites →https://doi.org/10.1007/bf01621475openalex-snapshot
Proof-theoretic analysis of KPM
inferredcites →https://doi.org/10.1007/bf02023014openalex-snapshot
A well-ordering proof for Feferman's theoryT 0
inferredcites →https://doi.org/10.1007/bf02297652openalex-snapshot
Zur Beweistheorie Der Kripke-Platek-Mengenlehre Über Den Natürlichen Zahlen
inferredcites →https://doi.org/10.1007/bfb0062852openalex-snapshot
A language and axioms for explicit mathematics
inferredcites →https://doi.org/10.1007/bfb0091896openalex-snapshot
Proof theoretic equivalences between classical and constructive theories for analysis
inferredcites →https://doi.org/10.1016/0003-4843(82)90003-1openalex-snapshot
Recursive models for constructive set theories
inferredcites →https://doi.org/10.1016/s0049-237x(08)71625-2openalex-snapshot
Constructive Theories of Functions and Classes
inferredcites →https://doi.org/10.1016/s0049-237x(08)71989-xopenalex-snapshot
The Type Theoretic Interpretation of Constructive Set Theory
inferredcites →https://doi.org/10.1016/s0049-237x(09)70683-4openalex-snapshot
The Type Theoretic Interpretation of Constructive Set Theory: Inductive Definitions
inferredcites →https://doi.org/10.1016/s0049-237x(09)x7019-9openalex-snapshot
Constructivism in Mathematics - An Introduction
inferredcites →https://doi.org/10.1017/9781316717196openalex-snapshot
Admissible Sets and Structures
inferredcites →https://doi.org/10.2307/2272159openalex-snapshot
Constructive set theory

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.19990450410openalex-snapshot
Can You Add Power‐Sets to Martin‐Lof's Intuitionistic Set Theory?
inferred← citeshttps://doi.org/10.1002/malq.200310054openalex-snapshot
On the regular extension axiom and its variants
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_24openalex-snapshot
A Theory of Explicit Mathematics Equivalent to ID 1
inferred← citeshttps://doi.org/10.1007/3-540-45842-5_1openalex-snapshot
Collection Principles in Dependent Type Theory
inferred← citeshttps://doi.org/10.1007/3-540-48167-2_1openalex-snapshot
On Relating Type Theories and Set Theories
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_11openalex-snapshot
A Finite Axiomatization of Inductive-Recursive Definitions
inferred← citeshttps://doi.org/10.1007/978-1-4020-8926-8_17openalex-snapshot
The Constructive Hilbert Program and the Limits of Martin-Löf Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-15655-8_11openalex-snapshot
A New Foundational Crisis in Mathematics, Is It Really Happening?
inferred← citeshttps://doi.org/10.1007/978-3-030-49424-7_16openalex-snapshot
An Upper Bound for the Proof-Theoretic Strength of Martin-Löf Type Theory with W-type and One Universe
inferred← citeshttps://doi.org/10.1007/978-3-319-10103-3_3openalex-snapshot
The Use of Trustworthy Principles in a Revised Hilbert’s Program
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_14openalex-snapshot
Proof Theory of Constructive Systems: Inductive Types and Univalence
inferred← citeshttps://doi.org/10.1007/978-3-540-24849-1_14openalex-snapshot
Wellfounded Trees and Dependent Polynomial Functors
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_25openalex-snapshot
On the Constructive Dedekind Reals: Extended Abstract
inferred← citeshttps://doi.org/10.1007/978-3-662-22108-2_16openalex-snapshot
The Higher Infinite in Proof Theory
inferred← citeshttps://doi.org/10.1007/978-3-7643-8653-5_16openalex-snapshot
Proof theory and Martin-Löf Type Theory
inferred← citeshttps://doi.org/10.1007/978-94-007-4435-6_15openalex-snapshot
Constructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of Constructions
inferred← citeshttps://doi.org/10.1007/s00153-012-0309-4openalex-snapshot
Non-deterministic inductive definitions
inferred← citeshttps://doi.org/10.1007/s001530000051openalex-snapshot
The strength of Martin-Löf type theory with a superuniverse. Part II
inferred← citeshttps://doi.org/10.1007/s001530050003openalex-snapshot
Intuitionistic choice and classical logic
inferred← citeshttps://doi.org/10.1007/s001530050062openalex-snapshot
Hereditarily effective typestreams
inferred← citeshttps://doi.org/10.1016/j.apal.2005.05.010openalex-snapshot
Replacement versus collection and related topics in constructive Zermelo–Fraenkel set theory
inferred← citeshttps://doi.org/10.1016/j.apal.2005.05.021openalex-snapshot
Heyting-valued interpretations for Constructive Set Theory
inferred← citeshttps://doi.org/10.1016/j.apal.2005.07.002openalex-snapshot
CZF and Second Order Arithmetic
inferred← citeshttps://doi.org/10.1016/j.apal.2005.11.005openalex-snapshot
Quotient topologies in constructive set theory and type theory
inferred← citeshttps://doi.org/10.1016/j.apal.2005.12.008openalex-snapshot
Characterizing the interpretation of set theory in Martin-Löf type theory
inferred← citeshttps://doi.org/10.1016/j.apal.2013.08.001openalex-snapshot
Constructive Zermelo–Fraenkel set theory and the limited principle of omniscience
inferred← citeshttps://doi.org/10.1016/j.apal.2015.04.002openalex-snapshot
A new model construction by making a detour via intuitionistic theories II: Interpretability lower bound of Feferman's explicit mathematics T0
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(00)00007-5openalex-snapshot
Functional interpretation of Aczel's constructive set theory
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00076-8openalex-snapshot
Extending the system T0 of explicit mathematics: the limit and Mahlo axioms
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00083-5openalex-snapshot
Inaccessible set axioms may have little consistency strength
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00065-9openalex-snapshot
Realization of constructive set theory into explicit mathematics: a lower bound for impredicative Mahlo universe
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.1016/s0168-0072(97)00072-9openalex-snapshot
Inaccessibility in constructive set theory and type theory
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00078-xopenalex-snapshot
Well-ordering proofs for Martin-Löf type theory
inferred← citeshttps://doi.org/10.1017/9781316716830.019openalex-snapshot
The Higher Infinite in Proof Theory
inferred← citeshttps://doi.org/10.1017/9781316755723.014openalex-snapshot
Choice principles in constructive and classical set theories
inferred← citeshttps://doi.org/10.1017/9781316755785.015openalex-snapshot
Realizability for constructive Zermelo-Fraenkel set theory
inferred← citeshttps://doi.org/10.1017/9781316756140.027openalex-snapshot
The Superjump in Martin-Löf Type Theory
inferred← citeshttps://doi.org/10.1017/cbo9780511721151.009openalex-snapshot
Universes in type theory part I—Inaccessibles and Mahlo
inferred← citeshttps://doi.org/10.1017/s1079898600003383openalex-snapshot
2004 Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.1023/a:1020844128690openalex-snapshot
Concepts and aims of functional interpretations: towards a functional interpretation of constructive set theory
inferred← citeshttps://doi.org/10.1023/a:1020892011851openalex-snapshot
Mathematical Proof Theory in the Light of Ordinal Analysis
inferred← citeshttps://doi.org/10.1090/proc/12569openalex-snapshot
On Tarski’s fixed point theorem
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566519.003.0004openalex-snapshot
PRESHEAF MODELS FOR CONSTRUCTIVE SET THEORIES
inferred← citeshttps://doi.org/10.1093/oso/9780198501275.003.0012openalex-snapshot
On universes in type theory
inferred← citeshttps://doi.org/10.1109/lics.2012.21openalex-snapshot
Inductive Types in Homotopy Type Theory
inferred← citeshttps://doi.org/10.1112/jlms.12532openalex-snapshot
Towards a constructive simplicial model of Univalent Foundations
inferred← citeshttps://doi.org/10.1215/00294527-2025-0008openalex-snapshot
The Proof-Theoretic Strength of Constructive Second-Order Set Theories
inferred← citeshttps://doi.org/10.1515/9783110324907.315openalex-snapshot
An Extended Predicative Definition of the Mahlo Universe
inferred← citeshttps://doi.org/10.1515/9783110324921.123openalex-snapshot
Formal Baire Space in Constructive Set Theory
inferred← citeshttps://doi.org/10.2178/bsl/1146620064openalex-snapshot
2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05
inferred← citeshttps://doi.org/10.2178/jsl/1129642124openalex-snapshot
The disjunction and related properties for constructive Zermelo-Fraenkel set theory
inferred← citeshttps://doi.org/10.2178/jsl/1140641163openalex-snapshot
The generalised type-theoretic interpretation of constructive set theory
inferred← citeshttps://doi.org/10.2178/jsl/1286198140openalex-snapshot
On the existence of Stone-Čech compactification
inferred← citeshttps://doi.org/10.2307/2275601openalex-snapshot
Monotone inductive definitions in explicit mathematics
inferred← citeshttps://doi.org/10.2307/2275671openalex-snapshot
On power set in explicit mathematics
inferred← citeshttps://doi.org/10.2307/2586554openalex-snapshot
A general formulation of simultaneous inductive-recursive definitions in type theory
inferred← citeshttps://doi.org/10.2307/2694980openalex-snapshot
Realization of analysis into Explicit Mathematics
inferred← citeshttps://doi.org/10.2307/2695075openalex-snapshot
Interpreting classical theories in constructive ones
inferred← citeshttps://doi.org/10.2307/420965openalex-snapshot
Does Mathematics Need New Axioms?
inferred← citeshttps://doi.org/10.2307/421015openalex-snapshot
1996 European Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2307/421084openalex-snapshot
1999 European Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2307/421132openalex-snapshot
Recent Advances in Ordinal Analysis: Π12— CA and Related Systems
inferred← citeshttps://doi.org/10.2307/421198openalex-snapshot
1995 European Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2307/797967openalex-snapshot
The Superjump in Martin-Lof Type Theory
inferred← citeshttps://doi.org/10.23638/lmcs-17(2:21)2021openalex-snapshot
A realizability semantics for inductive formal topologies, Church's Thesis and Axiom of Choice
inferred← citeshttps://doi.org/10.3217/jucs-011-12-2008openalex-snapshot
Constructive Set Theory and Brouwerian Principles
inferred← citeshttps://doi.org/10.4000/msh.2959openalex-snapshot
Proof Theory of Martin-Löf Type Theory. An overview
inferred← citeshttps://doi.org/10.46298/lmcs-18(4:5)2022openalex-snapshot
Inductive and Coinductive Topological Generation with Church's thesis and the Axiom of Choice
inferred← citeshttps://doi.org/10.48550/arxiv.1301.2793openalex-snapshot
On Tarski's fixed point theorem
inferred← citeshttps://doi.org/10.48550/arxiv.2011.00272openalex-snapshot
Partial Functions and Recursion in Univalent Type Theory
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.