scientific article; zbMATH DE number 3687373
From MaRDI portal
Publication:3882452
Cited in
(73)- Realization of constructive set theory into explicit mathematics: A lower bound for impredicative Mahlo universe
- Realizability interpretation of generalized inductive definitions
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. II
- The Operational Perspective: Three Routes
- Remarks on applicative theories
- Direct spectra of Bishop spaces and their limits
- Choice and independence of premise rules in intuitionistic set theory
- Intensionality in mathematics
- Extracting Lisp programs from constructive proofs: A formal theory of constructive mathematics based on Lisp
- Explicit mathematics: power types and overloading
- Extending the system T\(_0\) of explicit mathematics: The limit and Mahlo axioms
- Monotone recursive definition of predicates and its realizability interpretation
- Universes over Frege structures
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
- scientific article; zbMATH DE number 7561488 (Why is no real title available?)
- Arithmetical conservation results
- Extended bar induction in applicative theories
- Theories with self-application and computational complexity.
- About Truth and Types
- scientific article; zbMATH DE number 7350773 (Why is no real title available?)
- A theory for program and data type specification
- A first order logic of effects
- A well-ordering proof for Feferman's theoryT 0
- Truth and the philosophy of mathematics
- The strength of some Martin-Löf type theories
- Totality in applicative theories
- Realizability and intuitionistic logic
- What is constructive mathematics?
- Constructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of Constructions
- Primitive recursive selection functions for existential assertions over abstract algebras
- Systems of explicit mathematics with non-constructive \(\mu\)-operator and join
- Extending constructive operational set theory by impredicative principles
- Why Sets?
- A proof-theoretic characterization of the basic feasible functionals
- On the collection of points of a formal space
- Cut-Elimination for SBL
- A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\)
- Generalizing classical and effective model theory in theories of operations and classes
- On the proof-theoretic strength of monotone induction in explicit mathematics
- Proofs and programs: A naïve approach to program extraction
- Proof-relevance in Bishop-style constructive mathematics
- Consistency of the intensional level of the minimalist foundation with Church's thesis and axiom of choice
- Proof theory of constructive systems: inductive types and univalence
- Elementary explicit types and polynomial time operations
- Formalizing non-termination of recursive programs
- Monotone inductive definitions in a constructive theory of functions and classes
- Constructive mathematics: a foundation for computable analysis
- Truncation and semi-decidability notions in applicative theories
- Replacement versus collection and related topics in constructive Zermelo-Fraenkel set theory
- The non-constructive \(\mu\) operator, fixed point theories with ordinals, and the bar rule
- Towards a computation system based on set theory
- Reflections on reflections in explicit mathematics
- Interpretation of constructive multi-typed theory in the theory of arithmetical truth
- Understanding uniformity in Feferman's explicit mathematics
- A flexible type system for the small Veblen ordinal
- Admissible closures of polynomial time computable arithmetic
- A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP
- The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories
- The provably terminating operations of the subsystem PETJ of explicit mathematics
- Intuitionistic fixed point logic
- On the Strength of the Uniform Fixed Point Principle in Intuitionistic Explicit Mathematics
- Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels
- Proof-theoretical analysis: Weak systems of functions and classes
- Sets completely separated by functions in Bishop set theory
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
- Objectivity and truth in mathematics: a sober non-Platonist perspective
- The operational penumbra: some ontological aspects
- EXTENSIONAL REALIZABILITY AND CHOICE FOR DEPENDENT TYPES IN INTUITIONISTIC SET THEORY
- Metamathematical properties of a constructive multi-typed theory
- A feasible theory of truth over combinatory algebra
- Reflection principles for synthetic theories of smooth manifolds
- A realizability interpretation of Church's simple theory of types
- Pre-measure spaces and pre-integration spaces in predicative Bishop-Cheng measure 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 Q3882452)
