On the public citation graph
A language and axioms for explicit mathematics
0 signed · 287 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.1007/bf01707942openalex-snapshot
Leçons sur la théorie des fonctions
inferredcites →https://doi.org/10.1007/bfb0059537openalex-snapshot
Π 1 1 models and Π 1 1 -categoricity
inferredcites →https://doi.org/10.1007/bfb0060620openalex-snapshot
Symposium on Automatic Demonstration
inferredcites →https://doi.org/10.1007/bfb0066739openalex-snapshot
Metamathematical Investigation of Intuitionistic Arithmetic and Analysis
inferredcites →https://doi.org/10.1007/bfb0066745openalex-snapshot
Iterated inductive definitions, trees and ordinals
inferredcites →https://doi.org/10.1007/bfb0073961openalex-snapshot
Toposes, Algebraic Geometry and Logic
inferredcites →https://doi.org/10.1007/bfb0073966openalex-snapshot
The formalization of Bishop's constructive mathematics
inferredcites →https://doi.org/10.1016/0003-4843(70)90001-xopenalex-snapshot
Formal systems for some branches of intuitionistic analysis
inferredcites →https://doi.org/10.1016/s0049-237x(08)70740-7openalex-snapshot
Mathematics as a Numerical Language
inferredcites →https://doi.org/10.1016/s0049-237x(08)70843-7openalex-snapshot
Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des Types
inferredcites →https://doi.org/10.1016/s0049-237x(08)71190-xopenalex-snapshot
Autonomous Transfinite Progressions and the Extent of Predicative Mathematics
inferredcites →https://doi.org/10.1016/s0049-237x(08)71229-1openalex-snapshot
Axiomatic Recursive Function Theory
inferredcites →https://doi.org/10.1016/s0049-237x(08)71230-8openalex-snapshot
Some Reasons for Generalizing Recursion Theory
inferredcites →https://doi.org/10.1016/s0049-237x(08)71689-6openalex-snapshot
Infinitely Long Terms of Transfinite Type
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7028-4openalex-snapshot
The Metamathematics of Algebraic Systems - Collected Papers: 1936–1967
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7058-2openalex-snapshot
Logic, Methodology and Philosophy of Science III
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7067-3openalex-snapshot
Constructive Order Types
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7073-9openalex-snapshot
Intuitionism An Introduction
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7085-5openalex-snapshot
Formal Systems and Recursive Functions
inferredcites →https://doi.org/10.1090/s0002-9947-1959-0102480-9openalex-snapshot
Recursive functionals and quantifiers of finite types. I
inferredcites →https://doi.org/10.1090/s0002-9947-1960-0113807-4openalex-snapshot
Computable Algebra, General Theory and Theory of Computable Fields
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0244045-0openalex-snapshot
Abstract first order computability. I, II
inferredcites →https://doi.org/10.1111/j.1746-8361.1958.tb01464.xopenalex-snapshot
Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes
inferredcites →https://doi.org/10.2307/2270669openalex-snapshot
Daniel Lacombe. Quelques procédés de définition en topologie récursive. Constructivity in mathematics, Proceedings of the colloquium held at Amsterdam, 1957, edited by A. Heyting, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1959, pp. 129–158.
inferredcites →https://doi.org/10.2307/2272979openalex-snapshot
A system of abstract constructive ordinals
inferredcites →https://doi.org/10.2307/2314383openalex-snapshot
Foundations of Constructive Analysis.
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.200510029openalex-snapshot
On the proof theory of type two functionals based on primitive recursive operations
inferred← citeshttps://doi.org/10.1002/malq.200810004openalex-snapshot
Elementary explicit types and polynomial time operations
inferred← citeshttps://doi.org/10.1002/malq.201020064openalex-snapshot
Realisability in weak systems of explicit mathematics
inferred← citeshttps://doi.org/10.1006/inco.1998.9999openalex-snapshot
A Note on Complexity Measures for Inductive Classes in Constructive Type Theory
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-45504-3_13openalex-snapshot
Constructive Foundations for Featherweight Java
inferred← citeshttps://doi.org/10.1007/3-540-45884-0_5openalex-snapshot
Theory of Judgments and Derivations
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_89openalex-snapshot
A constructive set theory for program development
inferred← citeshttps://doi.org/10.1007/3-540-52531-9_128openalex-snapshot
A theory for program and data type specification
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_143openalex-snapshot
Provably recursive programs and program extraction
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_41openalex-snapshot
Adding proof objects and inductive definition mechanisms to frege structures
inferred← citeshttps://doi.org/10.1007/3-540-56320-2_55openalex-snapshot
Formal theories and software systems: Fundamental connections between Computer Science and Logic
inferred← citeshttps://doi.org/10.1007/3-540-56883-2_9openalex-snapshot
Reasoning about functional programs in Nuprl
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_18openalex-snapshot
A theory of classes for a functional language with effects
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_20openalex-snapshot
Universes in the theories of types and names
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_89openalex-snapshot
An operational approach to combining classical set theory and functional programming languages
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_82openalex-snapshot
Expressing computational complexity in constructive type theory
inferred← citeshttps://doi.org/10.1007/3-540-63172-0_54openalex-snapshot
Call-by-Value, call-by-name and the logic of values
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_13openalex-snapshot
Metamathematical Properties of Intuitionistic Set Theories with Choice Principles
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-1-4612-2822-6_13openalex-snapshot
Constructive Kripke Semantics and Realizability
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-4613-0609-2_4openalex-snapshot
Constructive Mathematics and Computer-Assisted Reasoning Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-49424-7_19openalex-snapshot
On the Strength of the Uniform Fixed Point Principle in Intuitionistic Explicit Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-030-66545-6_7openalex-snapshot
Aspects of Categorical Recursion Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-08740-0_15openalex-snapshot
On the Compatibility Between the Minimalist Foundation and Constructive Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-61716-4_14openalex-snapshot
Fixed Point Theorems in Computability Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-64309-5_21openalex-snapshot
Computable Structure Theory of Partial Combinatory Algebras
inferred← citeshttps://doi.org/10.1007/978-3-0348-8968-1_17openalex-snapshot
Du Pourquoi au Comment: la Théorie de la Démonstration de 1950 à nos Jours
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-29198-7_7openalex-snapshot
The Operational Perspective: Three Routes
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-3-319-63334-3_10openalex-snapshot
The Operational Penumbra: Some Ontological Aspects
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_12openalex-snapshot
Feferman’s Forays into the Foundations of Category Theory
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-319-63334-3_2openalex-snapshot
Feferman on Computability
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_8openalex-snapshot
Unfolding Schematic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-24933-4_1openalex-snapshot
Two PhD Students for the Price of One
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_6openalex-snapshot
Formalizing Decidability Theorems About Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_4openalex-snapshot
The Structure of Nuprl’s Type 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-2582-9openalex-snapshot
Analysis and interpretation in the exact sciences : essays in honour of William Demopoulos
inferred← citeshttps://doi.org/10.1007/978-94-007-2582-9_9openalex-snapshot
The Axiom of Choice in an Elementary Theory of Operations and Sets
inferred← citeshttps://doi.org/10.1007/978-94-009-1171-0_10openalex-snapshot
Semantics and the Liar Paradox
inferred← citeshttps://doi.org/10.1007/978-94-009-9825-4_8openalex-snapshot
Generalizing Set-Theoretical Model Theory and an Analogue Theory on Admissible Sets
inferred← citeshttps://doi.org/10.1007/978-94-010-1138-9_9openalex-snapshot
Categorical Foundations and Foundations of Category Theory
inferred← citeshttps://doi.org/10.1007/978-94-011-2496-6_5openalex-snapshot
Working Foundations - ’ 91
inferred← citeshttps://doi.org/10.1007/978-94-017-0466-3_3openalex-snapshot
Semantics and the Liar Paradox
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-2109-7_3openalex-snapshot
Carnap’s Remarks on Impredicative Definitions and the Genericity Theorem
inferred← citeshttps://doi.org/10.1007/978-94-017-2796-9_10openalex-snapshot
Relationships between Constructive, Predicative and Classical Systems of Analysis
inferred← citeshttps://doi.org/10.1007/978-94-017-9673-6_6openalex-snapshot
Sets, Truth, and Recursion
inferred← citeshttps://doi.org/10.1007/978-94-017-9673-6_7openalex-snapshot
Unfolding Feasible Arithmetic andWeak Truth
inferred← citeshttps://doi.org/10.1007/bf00485463openalex-snapshot
Realizability and intuitionistic logic
inferred← citeshttps://doi.org/10.1007/bf01269876openalex-snapshot
A theory of rules for enumerated classes of functions
inferred← citeshttps://doi.org/10.1007/bf01278464openalex-snapshot
The strength of some Martin-L�f type theories
inferred← citeshttps://doi.org/10.1007/bf03024381openalex-snapshot
What does logic have to tell us about mathematical proofs?
inferred← citeshttps://doi.org/10.1007/bfb0021080openalex-snapshot
Kripke semantics for dependent type theory and realizability interpretations
inferred← citeshttps://doi.org/10.1007/bfb0021081openalex-snapshot
Reflective semantics of constructive type theory
inferred← citeshttps://doi.org/10.1007/bfb0021090openalex-snapshot
Implementing constructive real analysis (preliminary report)
inferred← citeshttps://doi.org/10.1007/bfb0023760openalex-snapshot
A primitive recursive set theory and AFA: On the logical complexity of the largest bisimulation
inferred← citeshttps://doi.org/10.1007/bfb0032403openalex-snapshot
Program transformation via contextual assertions
inferred← citeshttps://doi.org/10.1007/bfb0038693openalex-snapshot
Some applications of Gentzen's proof theory in automated deduction
inferred← citeshttps://doi.org/10.1007/bfb0079548openalex-snapshot
Non-extensional type-free theories of partial operations and classifications, I
inferred← citeshttps://doi.org/10.1007/bfb0083667openalex-snapshot
Consistency of Beeson's formal system RPS and some related results
inferred← citeshttps://doi.org/10.1007/bfb0090733openalex-snapshot
Formalizing constructive mathematics: Why and how?
inferred← citeshttps://doi.org/10.1007/bfb0099484openalex-snapshot
Between constructive and classical mathematics
inferred← citeshttps://doi.org/10.1007/s00153-011-0238-7openalex-snapshot
Admissible closures of polynomial time computable arithmetic
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.1007/s11225-016-9701-0openalex-snapshot
Metamathematical Properties of a Constructive Multi-typed Theory
inferred← citeshttps://doi.org/10.1016/0003-4843(82)90003-1openalex-snapshot
Recursive models for constructive set theories
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(88)90055-3openalex-snapshot
Proof-theoretical analysis: weak systems of functions and classes
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(90)90047-6openalex-snapshot
Extended bar induction in applicative theories
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90032-hopenalex-snapshot
Generalizing classical and effective model theory in theories of operations and classes
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90013-4openalex-snapshot
Systems of explicit mathematics with non-constructive μ-operator. Part I
inferred← citeshttps://doi.org/10.1016/0168-0072(94)00037-4openalex-snapshot
Totality in applicative theories
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/0304-3975(88)90115-6openalex-snapshot
Towards a computation system based on set theory
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90169-gopenalex-snapshot
A theory for program and data type specification
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90092-2openalex-snapshot
Realizability interpretation of generalized inductive definitions
inferred← citeshttps://doi.org/10.1016/j.apal.2004.12.002openalex-snapshot
Explicit mathematics: power types and overloading
inferred← citeshttps://doi.org/10.1016/j.apal.2005.05.008openalex-snapshot
Reflections on reflections in explicit mathematics
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.2009.01.010openalex-snapshot
Full operational set theory with unbounded existential quantification and power set
inferred← citeshttps://doi.org/10.1016/j.apal.2011.01.009openalex-snapshot
The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories
inferred← citeshttps://doi.org/10.1016/j.apal.2011.04.004openalex-snapshot
The provably terminating operations of the subsystem PETJ of explicit mathematics
inferred← citeshttps://doi.org/10.1016/j.apal.2012.05.006openalex-snapshot
Applicative theories for the polynomial hierarchy of time and its levels
inferred← citeshttps://doi.org/10.1016/j.apal.2013.06.012openalex-snapshot
Proof-theoretic conservations of weak weak intuitionistic constructive set theories
inferred← citeshttps://doi.org/10.1016/j.apal.2013.12.002openalex-snapshot
A feasible theory of truth over combinatory algebra
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.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/j.apal.2019.04.013openalex-snapshot
Fixed point theorems for precomplete numberings
inferred← citeshttps://doi.org/10.1016/j.apal.2026.103781openalex-snapshot
A topos for extended Weihrauch degrees
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.05.019openalex-snapshot
Actors and Logical Analysis of Interactive Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.09.006openalex-snapshot
The Effects of Effects on Constructivism
inferred← citeshttps://doi.org/10.1016/j.ic.2008.04.007openalex-snapshot
Operational set theory and small large cardinals
inferred← citeshttps://doi.org/10.1016/j.indag.2017.07.009openalex-snapshot
Arithmetical conservation results
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.02.002openalex-snapshot
Primitive recursive selection functions for existential assertions over abstract algebras
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.08.009openalex-snapshot
A proof-theoretic characterization of the basic feasible functionals
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.08.017openalex-snapshot
Semantic Types and Approximation for Featherweight Java
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.007openalex-snapshot
Applicative theories for logarithmic complexity classes
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.054openalex-snapshot
Partial combinatory algebra and generalized numberings
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)70127-7openalex-snapshot
Type Theory and Explicit Mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70131-9openalex-snapshot
Some Aspects of Impredicativity
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70927-3openalex-snapshot
Recursion theory and set theory, a marriage of convenience
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71252-7openalex-snapshot
Frege Structures and the Notions of Proposition, Truth and Set
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71256-4openalex-snapshot
A Strong Conservative Extension of Peano Arithmetic*
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(08)71619-7openalex-snapshot
Continuity in Intuitionistic Set Theories
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71625-2openalex-snapshot
Constructive Theories of Functions and Classes
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71880-9openalex-snapshot
Iterating Admissibility in Proof Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70127-2openalex-snapshot
Constructive Hovels for Set Theory with Extensionalitv
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70502-6openalex-snapshot
Problematic Principles in Constructive Mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70506-3openalex-snapshot
Inductively Presented Systems and the Formalization of Meta-Mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70684-6openalex-snapshot
Proving Programs and Programming Proofs
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(00)00016-6openalex-snapshot
The non-constructive μ operator, fixed point theories with ordinals, and the bar rule
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00057-9openalex-snapshot
Universes in explicit mathematics
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)00077-xopenalex-snapshot
On uniform weak König's lemma
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00040-4openalex-snapshot
Universes over Frege structures
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)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.1016/s0168-0072(97)00078-xopenalex-snapshot
Well-ordering proofs for Martin-Löf type theory
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00047-9openalex-snapshot
A first order logic of effects
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00086-5openalex-snapshot
Theories with self-application and computational complexity
inferred← citeshttps://doi.org/10.1016/s1567-8326(01)00006-6openalex-snapshot
Formalizing non-termination of recursive programs
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00106-9openalex-snapshot
History and Developments
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.1016/s1874-5857(09)70020-2openalex-snapshot
Paradoxes, Self-Reference and Truth in the 20th Century
inferred← citeshttps://doi.org/10.1017/9781009039888.004openalex-snapshot
Bishop’s Mathematics: A Philosophical Perspective
inferred← citeshttps://doi.org/10.1017/9781316755785.015openalex-snapshot
Realizability for constructive Zermelo-Fraenkel set theory
inferred← citeshttps://doi.org/10.1017/9781316755860.005openalex-snapshot
Choice and uniformity in weak applicative theories
inferred← citeshttps://doi.org/10.1017/9781316755884.004openalex-snapshot
Notions of computability at higher types I
inferred← citeshttps://doi.org/10.1017/9781316755884.011openalex-snapshot
Metapredicative and explicit Mahlo: a proof-theoretic perspective
inferred← citeshttps://doi.org/10.1017/9781316755983.005openalex-snapshot
Foundational and mathematical uses of higher types
inferred← citeshttps://doi.org/10.1017/9781316755983.009openalex-snapshot
Computational complexity and induction for partial computable functions in type theory
inferred← citeshttps://doi.org/10.1017/9781316755983.011openalex-snapshot
Three processes in natural language interpretation
inferred← citeshttps://doi.org/10.1017/9781316755983.013openalex-snapshot
On extensionality, uniformity and comprehension in the theories of operations and classes
inferred← citeshttps://doi.org/10.1017/9781316755983.014openalex-snapshot
The proof-theoretic analysis of the Suslin operator in applicative theories
inferred← citeshttps://doi.org/10.1017/9781316755983.016openalex-snapshot
Explicit mathematics with monotone inductive definitions: A survey
inferred← citeshttps://doi.org/10.1017/9781316756140.031openalex-snapshot
Autonomous Fixed Point Progressions and Fixed Point Transfinite Recursion
inferred← citeshttps://doi.org/10.1017/bsl.2014.21openalex-snapshot
EXPLICIT MATHEMATICS AND OPERATIONAL SET THEORY: SOME ONTOLOGICAL COMPARISONS
inferred← citeshttps://doi.org/10.1017/bsl.2016.11openalex-snapshot
RELATIVIZING OPERATIONAL SET THEORY
inferred← citeshttps://doi.org/10.1017/bsl.2020.46openalex-snapshot
COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS
inferred← citeshttps://doi.org/10.1017/cbo9780511546464.016openalex-snapshot
Monotone inductive definitions and consistency of New Foundations
inferred← citeshttps://doi.org/10.1017/cbo9780511605321.008openalex-snapshot
The inevitability of logical strength: Strict reverse mathematics
inferred← citeshttps://doi.org/10.1017/cbo9780511721151.005openalex-snapshot
Constructive set theory with operations
inferred← citeshttps://doi.org/10.1017/cbo9780511910616.009openalex-snapshot
History of constructivism in the 20th century
inferred← citeshttps://doi.org/10.1017/cbo9781107325944.016openalex-snapshot
First Steps into Metapredicativity in Explicit Mathematics
inferred← citeshttps://doi.org/10.1017/jsl.2018.34openalex-snapshot
TRUNCATION AND SEMI-DECIDABILITY NOTIONS IN APPLICATIVE THEORIES
inferred← citeshttps://doi.org/10.1017/jsl.2021.50openalex-snapshot
ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS
inferred← citeshttps://doi.org/10.1017/jsl.2022.56openalex-snapshot
EXTENSIONAL REALIZABILITY AND CHOICE FOR DEPENDENT TYPES IN INTUITIONISTIC SET THEORY
inferred← citeshttps://doi.org/10.1017/s0956796898002974openalex-snapshot
Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages
inferred← citeshttps://doi.org/10.1017/s0960129502003626openalex-snapshot
Realizability: a historical essay
inferred← citeshttps://doi.org/10.1017/s0960129512000990openalex-snapshot
Regular functors and relative realisability categories
inferred← citeshttps://doi.org/10.1017/s0960129513000182openalex-snapshot
Computability structures, simulations and realizability
inferred← citeshttps://doi.org/10.1017/s0960129524000252openalex-snapshot
The complexity of completions in partial combinatory algebra
inferred← citeshttps://doi.org/10.1017/s1755020310000183openalex-snapshot
UNFOLDING FINITIST ARITHMETIC
inferred← citeshttps://doi.org/10.1017/s1755020310000407openalex-snapshot
THE UNIVERSAL SET AND DIAGONALIZATION IN FREGE STRUCTURES
inferred← citeshttps://doi.org/10.1017/s1755020312000111openalex-snapshot
FOUNDATIONS OF UNLIMITED CATEGORY THEORY: WHAT REMAINS TO BE DONE
inferred← citeshttps://doi.org/10.1023/a:1005622403850openalex-snapshot
Does Reductive Proof Theory Have A Viable Rationale?
inferred← citeshttps://doi.org/10.1023/a:1011954206722openalex-snapshot
Truth in Applicative Theories
inferred← citeshttps://doi.org/10.1023/a:1017541301458openalex-snapshot
A Type Reduction from Proof-conditional to Dynamic Semantics
inferred← citeshttps://doi.org/10.1023/a:1020892011851openalex-snapshot
Mathematical Proof Theory in the Light of Ordinal Analysis
inferred← citeshttps://doi.org/10.1023/a:1026403603439openalex-snapshot
Theories of Types and Names with Positive Stratified Comprehension
inferred← citeshttps://doi.org/10.1080/0020174x.2013.855657openalex-snapshot
The Groundedness Approach to Class Theory
inferred← citeshttps://doi.org/10.1093/9780197784402.003.0013openalex-snapshot
Recent Developments on Predicative Foundations
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566519.003.0002openalex-snapshot
GENERALIZED INDUCTIVE DEFINITIONS IN CONSTRUCTIVE SET THEORY
inferred← citeshttps://doi.org/10.1093/jigpal/jzz002openalex-snapshot
Preservation of choice principles under realizability
inferred← citeshttps://doi.org/10.1093/logcom/11.4.527openalex-snapshot
A Semantics for : a Calculus with Overloading and Late-binding
inferred← citeshttps://doi.org/10.1093/logcom/6.1.55openalex-snapshot
Partial Applicative Theories and Explicit Substitutions
inferred← citeshttps://doi.org/10.1093/logcom/6.1.57openalex-snapshot
Partial applicative theories and explicit substitutions
inferred← citeshttps://doi.org/10.1093/logcom/exaa087openalex-snapshot
Extensional realizability for intuitionistic set theory
inferred← citeshttps://doi.org/10.1093/logcom/exad022openalex-snapshot
The extended predicative Mahlo universe in Martin-Löf type theory
inferred← citeshttps://doi.org/10.1109/lics.1991.151641openalex-snapshot
On computational open-endedness in Martin-Lof's type theory
inferred← citeshttps://doi.org/10.1109/lics.1992.185532openalex-snapshot
References, local variables and operational reasoning
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.1997.614966openalex-snapshot
Ramified higher-order unification
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470514openalex-snapshot
Evidenced Frames: A Unifying Framework Broadening Realizability Models
inferred← citeshttps://doi.org/10.1142/s0129054101000400openalex-snapshot
MARTIN-LÖF'S TYPE THEORY AS AN OPEN-ENDED FRAMEWORK
inferred← citeshttps://doi.org/10.1145/3704253openalex-snapshot
Proceedings of the 2025 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation
showing the first 200 of 253 · page through all 253
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.