scientific article; zbMATH DE number 3556031

Cited in

(83)

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

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)