The following pages link to (Q4128540):
Displaying 50 items.
- Semantic types and approximation for Featherweight Java (Q387991) (← links)
- A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP (Q476116) (← links)
- Explicit mathematics: power types and overloading (Q556826) (← links)
- Admissible closures of polynomial time computable arithmetic (Q634777) (← links)
- The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories (Q639666) (← links)
- The provably terminating operations of the subsystem PETJ of explicit mathematics (Q639690) (← links)
- A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
- Operational set theory and small large cardinals (Q731889) (← links)
- Extended bar induction in applicative theories (Q753810) (← links)
- Intensionality in mathematics (Q762052) (← links)
- Realizability and intuitionistic logic (Q792319) (← links)
- Generalizing classical and effective model theory in theories of operations and classes (Q810008) (← links)
- Proof-theoretical analysis: Weak systems of functions and classes (Q911585) (← links)
- Primitive recursive selection functions for existential assertions over abstract algebras (Q941429) (← links)
- Full operational set theory with unbounded existential quantification and power set (Q1024551) (← links)
- Realizability and recursive set theory (Q1094418) (← links)
- Monotone inductive definitions in a constructive theory of functions and classes (Q1115865) (← links)
- What does logic have to tell us about mathematical proofs? (Q1135835) (← links)
- Between constructive mathematics and PROLOG (Q1173742) (← links)
- A theory for program and data type specification (Q1199933) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- Well-ordering proofs for Martin-Löf type theory (Q1295372) (← links)
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I (Q1314542) (← links)
- Realizability interpretation of generalized inductive definitions (Q1331920) (← links)
- The strength of some Martin-Löf type theories (Q1344548) (← links)
- Formalizing non-termination of recursive programs (Q1349246) (← links)
- On the proof-theoretic strength of monotone induction in explicit mathematics (Q1356976) (← links)
- A first order logic of effects (Q1390955) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- The non-constructive \(\mu\) operator, fixed point theories with ordinals, and the bar rule (Q1577487) (← links)
- Arithmetical conservation results (Q1688961) (← links)
- Towards a computation system based on set theory (Q1825191) (← links)
- Realization of constructive set theory into explicit mathematics: A lower bound for impredicative Mahlo universe (Q1861330) (← links)
- Universes over Frege structures (Q1861539) (← links)
- Totality in applicative theories (Q1896484) (← links)
- Understanding uniformity in Feferman's explicit mathematics (Q1899146) (← links)
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. II (Q1919537) (← links)
- Predicativity and constructive mathematics (Q2080590) (← links)
- On the compatibility between the minimalist foundation and constructive set theory (Q2104267) (← links)
- The effects of effects on constructivism (Q2133168) (← links)
- Partial combinatory algebra and generalized numberings (Q2148902) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) (Q2232317) (← links)
- Fixed point theorems for precomplete numberings (Q2311209) (← links)
- A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\) (Q2344720) (← links)
- Applicative theories for logarithmic complexity classes (Q2346995) (← links)
- Metamathematical properties of a constructive multi-typed theory (Q2363505) (← links)
- On Feferman's operational set theory \textsf{OST} (Q2463480) (← links)
- Systems of explicit mathematics with non-constructive \(\mu\)-operator and join (Q2563984) (← links)
- Reflections on reflections in explicit mathematics (Q2566068) (← links)
- Replacement versus collection and related topics in constructive Zermelo-Fraenkel set theory (Q2566070) (← links)
