On the public citation graph

Cambridge Summer School in Mathematical Logic

https://doi.org/10.1007/bfb0066770
0 signed · 108 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.19940400307openalex-snapshot
Reflection of Long Game Formulas
inferred← citeshttps://doi.org/10.1007/1-4020-3521-7_3openalex-snapshot
Provability Logic
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_372openalex-snapshot
Information systems, continuity and realizability
inferred← citeshttps://doi.org/10.1007/3-540-44404-1_18openalex-snapshot
A New Model Construction for the Polymorphic Lambda Calculus
inferred← citeshttps://doi.org/10.1007/978-0-8176-4769-8_10openalex-snapshot
The Unintended Interpretations of Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-1-4020-5764-9_16openalex-snapshot
Successors of Singular Cardinals
inferred← citeshttps://doi.org/10.1007/978-1-4471-0717-0_7openalex-snapshot
Dini’s Theorem: A Constructive Case Study
inferred← citeshttps://doi.org/10.1007/978-1-4613-0897-3_5openalex-snapshot
A Constructive Morse Theory of Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-22686-6openalex-snapshot
Advances in Proof-Theoretic Semantics
inferred← citeshttps://doi.org/10.1007/978-3-476-98727-3_2openalex-snapshot
I
inferred← citeshttps://doi.org/10.1007/978-3-476-98727-3_6openalex-snapshot
M
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-45220-1_35openalex-snapshot
A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-92687-0_25openalex-snapshot
Unifying Sets and Programs via Dependent Types
inferred← citeshttps://doi.org/10.1007/978-3-642-36976-6_16openalex-snapshot
Coalgebraic Predicate Logic: Equipollence Results and Proof Theory
inferred← citeshttps://doi.org/10.1007/978-94-009-5203-4_4openalex-snapshot
Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-94-009-7066-3_6openalex-snapshot
Algorithms and Decision Problems: A Crash Course in Recursion Theory
inferred← citeshttps://doi.org/10.1007/978-94-009-8356-4_10openalex-snapshot
Philosophical aspects of proof theory
inferred← citeshttps://doi.org/10.1007/978-94-009-9056-2_12openalex-snapshot
The Interplay Between Logic and Mathematics: Intuitionism
inferred← citeshttps://doi.org/10.1007/978-94-010-1138-9_4openalex-snapshot
Axioms for Intuitionistic Mathematics Incompatible with Classical Logic
inferred← citeshttps://doi.org/10.1007/978-94-015-8988-8_4openalex-snapshot
Weak Forms of the Axiom of Choice and Partitions of Infinite Sets
inferred← citeshttps://doi.org/10.1007/978-94-017-0458-8_1openalex-snapshot
Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-1592-8_13openalex-snapshot
Realizability and Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-3327-4_11openalex-snapshot
Why Constructive Mathematics?
inferred← citeshttps://doi.org/10.1007/bf00485463openalex-snapshot
Realizability and intuitionistic logic
inferred← citeshttps://doi.org/10.1007/bf02986170openalex-snapshot
Improving the Fundamental Theorem of Algebra
inferred← citeshttps://doi.org/10.1007/bfb0079424openalex-snapshot
Set theory in infinitary languages
inferred← citeshttps://doi.org/10.1007/bfb0079563openalex-snapshot
Markov's principle and Markov's rule for theores of choice sequences
inferred← citeshttps://doi.org/10.1007/bfb0086123openalex-snapshot
Priority arguments using iterated trees of strategies
inferred← citeshttps://doi.org/10.1007/bfb0090172openalex-snapshot
Cofinal extension preserves recursive saturation
inferred← citeshttps://doi.org/10.1007/bfb0090738openalex-snapshot
A disjunctive decomposition theorem for classical theories
inferred← citeshttps://doi.org/10.1007/bfb0103104openalex-snapshot
The evolution of large cardinal axioms in set theory
inferred← citeshttps://doi.org/10.1007/s00153-019-00699-2openalex-snapshot
Rank-initial embeddings of non-standard models of set theory
inferred← citeshttps://doi.org/10.1007/s10516-022-09631-5openalex-snapshot
Canonical Truth
inferred← citeshttps://doi.org/10.1016/0003-4843(76)90008-5openalex-snapshot
Kripke models and the intuitionistic theory of species
inferred← citeshttps://doi.org/10.1016/0003-4843(76)90012-7openalex-snapshot
Ultrafilters over a measurable cardinal
inferred← citeshttps://doi.org/10.1016/0003-4843(77)90008-0openalex-snapshot
An “admissible” generalization of a theorem on countable ∑11 sets of reals with applications
inferred← citeshttps://doi.org/10.1016/0003-4843(77)90010-9openalex-snapshot
Countable approximations and Löwenheim-Skolem theorems
inferred← citeshttps://doi.org/10.1016/0003-4843(78)90029-3openalex-snapshot
An interpretation of intuitionistic analysis
inferred← citeshttps://doi.org/10.1016/0003-4843(78)90031-1openalex-snapshot
Strong axioms of infinity and elementary embeddings
inferred← citeshttps://doi.org/10.1016/0003-4843(80)90020-0openalex-snapshot
Saturated structures, unions of chains, and preservation theorems
inferred← citeshttps://doi.org/10.1016/0022-0396(83)90006-2openalex-snapshot
Solutions of algebraic differential equations
inferred← citeshttps://doi.org/10.1016/0022-4049(80)90102-4openalex-snapshot
Intuitionist type theory and the free topos
inferred← citeshttps://doi.org/10.1016/0022-4049(88)90098-9openalex-snapshot
Kleene computable functionals and the higher order existence property
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90042-4openalex-snapshot
Integrating classical and intuitionistic type theory
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90050-3openalex-snapshot
Realizability and recursive set theory
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90057-6openalex-snapshot
On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00053-4openalex-snapshot
Priority constructions
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90044-7openalex-snapshot
The system F of variable types, fifteen years later
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90109-xopenalex-snapshot
Typing and computational properties of lambda expressions
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90115-6openalex-snapshot
Towards a computation system based on set theory
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90062-mopenalex-snapshot
A modest model of records, inheritance, and bounded quantification
inferred← citeshttps://doi.org/10.1016/j.apal.2005.04.005openalex-snapshot
Structures interpretable in models of bounded arithmetic
inferred← citeshttps://doi.org/10.1016/j.apal.2007.02.002openalex-snapshot
Guessing and non-guessing of canonical functions
inferred← citeshttps://doi.org/10.1016/j.apal.2011.06.025openalex-snapshot
Generalizing realizability and Heyting models for constructive set theory
inferred← citeshttps://doi.org/10.1016/j.apal.2012.01.012openalex-snapshot
From the weak to the strong existence property
inferred← citeshttps://doi.org/10.1016/j.apal.2013.05.006openalex-snapshot
Axiomatizing first-order consequences in dependence logic
inferred← citeshttps://doi.org/10.1016/j.apal.2013.07.016openalex-snapshot
Relativized ordinal analysis: The case of Power Kripke–Platek set theory
inferred← citeshttps://doi.org/10.1016/j.apal.2014.01.004openalex-snapshot
CZF does not have the existence property
inferred← citeshttps://doi.org/10.1016/j.apal.2015.03.002openalex-snapshot
Models of intuitionistic set theory in subtoposes of nested realizability toposes
inferred← citeshttps://doi.org/10.1016/j.apal.2016.12.002openalex-snapshot
The countable admissible ordinal equivalence relation
inferred← citeshttps://doi.org/10.1016/j.apal.2016.12.003openalex-snapshot
Unifying the model theory of first-order and second-order arithmetic via WKL0⁎
inferred← citeshttps://doi.org/10.1016/j.apal.2023.103259openalex-snapshot
Realisability for infinitary intuitionistic set theory
inferred← citeshttps://doi.org/10.1016/j.apal.2023.103314openalex-snapshot
Choice and independence of premise rules in intuitionistic set theory
inferred← citeshttps://doi.org/10.1016/j.difgeo.2024.102176openalex-snapshot
Modal fracture of higher groups
inferred← citeshttps://doi.org/10.1016/j.indag.2019.01.004openalex-snapshot
The scope of Feferman’s semi-intuitionistic set theories and his second conjecture
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.09.004openalex-snapshot
Computational processes, observers and Turing incompleteness
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.019openalex-snapshot
Aspects of predicative algebraic set theory, II: Realizability
inferred← citeshttps://doi.org/10.1016/j.topol.2011.08.002openalex-snapshot
Kunen and set theory
inferred← citeshttps://doi.org/10.1016/s0003-4843(77)80003-xopenalex-snapshot
Principles of continuous choice and continuity of functions in formal systems for constructive mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70673-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71127-3openalex-snapshot
Aspects of Constructive Mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71259-xopenalex-snapshot
Kleene's Readability and “Divides” Notions for Formalized Intuitionistic Mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71265-5openalex-snapshot
Intuitionistic Analysis: The Search for Axiomatization and Understanding
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)80007-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70191-0openalex-snapshot
Residue Fields of Models of P
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70532-4openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80021-9openalex-snapshot
Realizability
inferred← citeshttps://doi.org/10.1016/s0166-8641(02)00112-8openalex-snapshot
Complexity of conjugacy classes of A(Q)
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00024-0openalex-snapshot
Topics in invariant descriptive set theory
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00079-3openalex-snapshot
Type theories, toposes and constructive set theory: predicative aspects of AST
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00080-xopenalex-snapshot
Analyzing realizability by Troelstra's methods
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00058-4openalex-snapshot
Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00013-xopenalex-snapshot
Computably enumerable sets and quasi-reducibility
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00172-2openalex-snapshot
From constructivism to computer science
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00285-0openalex-snapshot
Constructive mathematics: a foundation for computable analysis
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00106-9openalex-snapshot
History and Developments
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70007-xopenalex-snapshot
The Logic of Brouwer and Heyting
inferred← citeshttps://doi.org/10.1017/9781108674485openalex-snapshot
Mathematical Intuitionism
inferred← citeshttps://doi.org/10.1017/s0022481200031182openalex-snapshot
Finest partitions for ultrafilters
inferred← citeshttps://doi.org/10.1017/s0305004100063854openalex-snapshot
On the quantificational logic of intuitionistic set theory
inferred← citeshttps://doi.org/10.1017/s1755020316000411openalex-snapshot
THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC
inferred← citeshttps://doi.org/10.1023/a:1004881914911openalex-snapshot
Five Observations Concerning the Intended Meaning of the Intuitionistic Logical Constants
inferred← citeshttps://doi.org/10.1098/rsta.2011.0335openalex-snapshot
Formalism and intuition in computability
inferred← citeshttps://doi.org/10.1109/ismsit.2019.8932758openalex-snapshot
Syllogistic Yapıların Yönlü Graflar Üzerinde Matematiksel Modellenmesi
inferred← citeshttps://doi.org/10.1134/s0001434611050038openalex-snapshot
Effectivity properties of intuitionistic set theory with collection scheme
inferred← citeshttps://doi.org/10.1145/44501.45065openalex-snapshot
Abstract types have existential type
inferred← citeshttps://doi.org/10.2178/bsl/1182353873openalex-snapshot
A General Notion of Realizability
inferred← citeshttps://doi.org/10.2307/2271870openalex-snapshot
Ordinal spectra of first-order theories
inferred← citeshttps://doi.org/10.2307/2271875openalex-snapshot
On axiomatizing fragments
inferred← citeshttps://doi.org/10.2307/2273150openalex-snapshot
On the complexity of models of arithmetic
inferred← citeshttps://doi.org/10.2307/2273185openalex-snapshot
Constructible models of subsystems of ZF
inferred← citeshttps://doi.org/10.2307/2273620openalex-snapshot
Recursively saturated nonstandard models of arithmetic
inferred← citeshttps://doi.org/10.2307/2275476openalex-snapshot
Dual easy uniformization and model-theoretic descriptive set theory
inferred← citeshttps://doi.org/10.2307/2275855openalex-snapshot
Models of intuitionistic TT and NF
inferred← citeshttps://doi.org/10.2307/420945openalex-snapshot
The Mathematical Work of S.C.Kleene
inferred← citeshttps://doi.org/10.2307/421038openalex-snapshot
Hermann Weyl's Intuitionistic Mathematics
inferred← citeshttps://doi.org/10.2307/421040openalex-snapshot
A General Framework for Priority Arguments
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.