scientific article; zbMATH DE number 3556031

Cited in

(88)

Full operational set theory with unbounded existential quantification and power set
Realizability and recursive set theory
Monotone inductive definitions in a constructive theory of functions and classes
What does logic have to tell us about mathematical proofs?
Between constructive mathematics and PROLOG
A theory for program and data type specification
A note on complexity measures for inductive classes in constructive type theory
Well-ordering proofs for Martin-Löf type theory
Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
Realizability interpretation of generalized inductive definitions
The strength of some Martin-Löf type theories
Formalizing non-termination of recursive programs
On the proof-theoretic strength of monotone induction in explicit mathematics
A first order logic of effects
Theories with self-application and computational complexity.
The non-constructive operator, fixed point theories with ordinals, and the bar rule
Arithmetical conservation results
Towards a computation system based on set theory
Realization of constructive set theory into explicit mathematics: A lower bound for impredicative Mahlo universe
Universes over Frege structures
Totality in applicative theories
Understanding uniformity in Feferman's explicit mathematics
Systems of explicit mathematics with non-constructive -operator. II
Predicativity and constructive mathematics
On the compatibility between the minimalist foundation and constructive set theory
The effects of effects on constructivism
Partial combinatory algebra and generalized numberings
Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
Fixed point theorems for precomplete numberings
A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\)
Applicative theories for logarithmic complexity classes
Metamathematical properties of a constructive multi-typed theory
On Feferman's operational set theory \textsf{OST}
Systems of explicit mathematics with non-constructive -operator and join
Reflections on reflections in explicit mathematics
Replacement versus collection and related topics in constructive Zermelo-Fraenkel set theory
A feasible theory of truth over combinatory algebra
Extending constructive operational set theory by impredicative principles
The Operational Perspective: Three Routes
Elementary explicit types and polynomial time operations
Semantic types and approximation for Featherweight Java
IN MEMORIAM: SOLOMON FEFERMAN (1928–2016)
The axiom of choice and combinatory logic
Truncation and semi-decidability notions in applicative theories
A well-ordering proof for Feferman's theoryT 0
A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP
Pure Proof Theory Aims, Methods and Results: Extended Version of Talks Given at Oberwolfach and Haifa
Computability in partial combinatory algebras
On the Strength of the Uniform Fixed Point Principle in Intuitionistic Explicit Mathematics
Aspects of categorical recursion theory
Ordinal analysis of partial combinatory algebras
scientific article; zbMATH DE number 7561488 (Why is no real title available?)
Adding proof objects and inductive definition mechanisms to Frege structures
Feferman on computability
Unfolding schematic systems
The operational penumbra: some ontological aspects
Feferman's forays into the foundations of category theory
Proof theory of constructive systems: inductive types and univalence
Relativizing operational set theory
scientific article; zbMATH DE number 7056232 (Why is no real title available?)
Why Sets?
Explicit mathematics: power types and overloading
A type reduction from proof-conditional to dynamic semantics
Universes in explicit mathematics
Extending the system T\(_0\) of explicit mathematics: The limit and Mahlo axioms
On uniform weak König's lemma
Expressing computational complexity in constructive type theory
EXTENSIONAL REALIZABILITY AND CHOICE FOR DEPENDENT TYPES IN INTUITIONISTIC SET THEORY
Choice and independence of premise rules in intuitionistic set theory
Embeddings between partial combinatory algebras
Admissible closures of polynomial time computable arithmetic
The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories
The provably terminating operations of the subsystem PETJ of explicit mathematics
Theories of Frege structure equivalent to Feferman's system \(\mathsf{T}_0\)
The complexity of completions in partial combinatory algebra
Categorifying computable reducibilities
Fixed point theorems in computability theory
Computable structure theory of partial combinatory algebras
A proof-theoretic characterization of the basic feasible functionals
What set theory could not be about
A topos for extended Weihrauch degrees
Operational set theory and small large cardinals
Extended bar induction in applicative theories
Intensionality in mathematics
Realizability and intuitionistic logic
Generalizing classical and effective model theory in theories of operations and classes
Proof-theoretical analysis: Weak systems of functions and classes
Primitive recursive selection functions for existential assertions over abstract algebras

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4128540)