scientific article; zbMATH DE number 3556031
From MaRDI portal
Publication:4128540
zbMATH Open0357.02029MaRDI QIDQ4128540FDOQ4128540
Authors: Solomon Feferman 
Publication date: 1975
Title of this publication is not available (Why is that?)
Cited In (83)
- IN MEMORIAM: SOLOMON FEFERMAN (1928–2016)
- On the compatibility between the minimalist foundation and constructive set theory
- A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
- The Operational Perspective: Three Routes
- A feasible theory of truth over combinatory algebra
- The effects of effects on constructivism
- Metamathematical properties of a constructive multi-typed theory
- Partial combinatory algebra and generalized numberings
- Theories of Frege structure equivalent to Feferman's system \(\mathsf{T}_0\)
- Title not available (Why is that?)
- The complexity of completions in partial combinatory algebra
- Unfolding Schematic Systems
- TRUNCATION AND SEMI-DECIDABILITY NOTIONS IN APPLICATIVE THEORIES
- EXTENSIONAL REALIZABILITY AND CHOICE FOR DEPENDENT TYPES IN INTUITIONISTIC SET THEORY
- RELATIVIZING OPERATIONAL SET THEORY
- Title not available (Why is that?)
- Feferman on Computability
- Feferman’s Forays into the Foundations of Category Theory
- The Operational Penumbra: Some Ontological Aspects
- Operational set theory and small large cardinals
- What does logic have to tell us about mathematical proofs?
- Universes over Frege structures
- Reflections on reflections in explicit mathematics
- Expressing computational complexity in constructive type theory
- Full operational set theory with unbounded existential quantification and power set
- Applicative theories for logarithmic complexity classes
- A first order logic of effects
- The strength of some Martin-Löf type theories
- Extending constructive operational set theory by impredicative principles
- A note on complexity measures for inductive classes in constructive type theory
- Explicit mathematics: power types and overloading
- Monotone inductive definitions in a constructive theory of functions and classes
- The non-constructive \(\mu\) operator, fixed point theories with ordinals, and the bar rule
- On uniform weak König's lemma
- Elementary explicit types and polynomial time operations
- 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
- On Feferman's operational set theory \textsf{OST}
- A well-ordering proof for Feferman's theoryT 0
- A theory for program and data type specification
- Fixed point theorems for precomplete numberings
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. II
- ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS
- Aspects of Categorical Recursion Theory
- COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS
- Extended bar induction in applicative theories
- Between constructive mathematics and PROLOG
- Towards a computation system based on set theory
- A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP
- Intensionality in mathematics
- A type reduction from proof-conditional to dynamic semantics
- Systems of explicit mathematics with non-constructive \(\mu\)-operator and join
- 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
- Universes in explicit mathematics
- Realizability interpretation of generalized inductive definitions
- Extending the system T\(_0\) of explicit mathematics: The limit and Mahlo axioms
- Replacement versus collection and related topics in constructive Zermelo-Fraenkel set theory
- On the Strength of the Uniform Fixed Point Principle in Intuitionistic Explicit Mathematics
- Proof-theoretical analysis: Weak systems of functions and classes
- The axiom of choice and combinatory logic
- Arithmetical conservation results
- Formalizing non-termination of recursive programs
- Adding proof objects and inductive definition mechanisms to frege structures
- Theories with self-application and computational complexity.
- Realizability and intuitionistic logic
- Well-ordering proofs for Martin-Löf type theory
- Predicativity and constructive mathematics
- Proof Theory of Constructive Systems: Inductive Types and Univalence
- Why Sets?
- 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
- Primitive recursive selection functions for existential assertions over abstract algebras
- Understanding uniformity in Feferman's explicit mathematics
- Choice and independence of premise rules in intuitionistic set theory
- Semantic types and approximation for Featherweight Java
- Embeddings between partial combinatory algebras
- Pure Proof Theory Aims, Methods and Results: Extended Version of Talks Given at Oberwolfach and Haifa
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)
