Realisability for infinitary intuitionistic set theory
From MaRDI portal
Publication:2700803
DOI10.1016/j.apal.2023.103259OpenAlexW3088074722MaRDI QIDQ2700803
Robert Paßmann, Lorenzo Galeotti, Merlin Carl
Publication date: 27 April 2023
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.12172
Nonclassical and second-order set theories (03E70) Other constructive mathematics (03F65) Metamathematics of constructive systems (03F50) Subsystems of classical logic (including intuitionistic logic) (03B20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intermediate logics and Visser's rules
- Ordinal machines and admissible recursion theory
- Equivalents of the axiom of choice. 2nd ed
- Realizability and recursive set theory
- Admissibility of logical inference rules
- Taming Koepke's zoo
- Ordinal computability. An introduction to infinitary machines
- Koepke machines and satisfiability for infinitary propositional languages
- Logics of intuitionistic Kripke-Platek set theory
- The computational strengths of \(\alpha\)-tape infinite time Turing machines
- On the admissible rules of intuitionistic propositional logic
- Turing Computations On Ordinals
- A Survey of Propositional Realizability Logic
- One hundred and two problems in mathematical logic
- On the Effectivity of Some Field Constructions
- IKP and friends
- Effectivity and reducibility with ordinal Turing machines
- The disjunction and related properties for constructive Zermelo-Fraenkel set theory
- Propositional Calculus and Realizability
- On the interpretation of intuitionistic number theory
- Realizability: a historical essay
- Rules and arithmetics
This page was built for publication: Realisability for infinitary intuitionistic set theory
