Peter Koepke
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Peter Koepke has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Arthur W. Apter
Department of Mathematics, Baruch College of CUNY New York, New York, USA
5 shared publications - Adrian De Lon
University of Bonn
2 shared publications - Adrian Marti
University of Bonn
2 shared publications - Anne Fernengel2 shared publications
- Anton Lorenzen
University of Edinburgh, Edinburgh, United Kingdom
2 shared publications - Marcel Schütz
FAU Erlangen-Nürnberg
2 shared publications
Latest Publications
- 1 January 2026
- Published by Springer Nature
- p. 357-370
Formalizing the Solow Model in $\mathbb {N}$aproche- 1 January 2026
- Published by Springer Nature
- p. 357-370
Formalizing the Solow Model in $\mathbb {N}$aproche- Open Access
- 5 July 2021
- Published by Springer Nature
- p. 614-624
The Isabelle/Naproche Natural Language Proof Assistant
"Image missing" is an emerging natural proof assistant that accepts input in the controlled natural language ForTheL. "Image missing" is included in the current version of the Isabelle/PIDE which allows comfortable editing and asynchronous proof-checking of ForTheL texts. The dialect of ForTheL can be typeset by "Image missing" into documents that approximate the language and appearance of ordinary mathematical texts.
- 5 July 2021
- Published by Springer Nature
- p. 614-624
Open AccessThe Isabelle/Naproche Natural Language Proof Assistant
"Image missing" is an emerging natural proof assistant that accepts input in the controlled natural language ForTheL. "Image missing" is included in the current version of the Isabelle/PIDE which allows comfortable editing and asynchronous proof-checking of ForTheL texts. The dialect of ForTheL can be typeset by "Image missing" into documents that approximate the language and appearance of ordinary mathematical texts.
- Open Access
An Easton-like Theorem for Zermelo-Fraenkel Set Theory with the Axiom of Dependent Choice
We show that in the theory ZF + DC + for every cardinal {\lambda}, the set of infinite subsets of {\lambda} is well-ordered (i.e., Shelah's AX4), the {\theta}-function measuring the surjective size of the powersets P({\kappa}) can take almost arbitrary values on any set of uncountable cardinals. This complements our results from [FK16], where we prove that in ZF (without DC), any possible behavior of the {\theta}-function can be realized; and answers a question of Shelah in [She16], where he emphasizes that ZF + DC + AX4 is a reasonable theory, where much of set theory and combinatorics is possible.Open AccessAn Easton-like Theorem for Zermelo-Fraenkel Set Theory with the Axiom of Dependent Choice
We show that in the theory ZF + DC + for every cardinal {\lambda}, the set of infinite subsets of {\lambda} is well-ordered (i.e., Shelah's AX4), the {\theta}-function measuring the surjective size of the powersets P({\kappa}) can take almost arbitrary values on any set of uncountable cardinals. This complements our results from [FK16], where we prove that in ZF (without DC), any possible behavior of the {\theta}-function can be realized; and answers a question of Shelah in [She16], where he emphasizes that ZF + DC + AX4 is a reasonable theory, where much of set theory and combinatorics is possible. - Open Access
- 6 November 2017
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 146 (2) , 773-783
Singularizing successor cardinals by forcing
We exhibit models of set theory, using large cardinals and forcing, in which successor cardinals can be made singular by some ``Namba-like'' further set forcing, in most cases without collapsing cardinals below that successor cardinal. For successors of regular cardinals, we work from consistency-wise optimal assumptions in the ground model. Successors of singular cardinals require stronger hypotheses. Our partial orderings are different from Woodin's stationary tower forcing, which requires much stronger hypotheses when singularizing successors of regular cardinals, and collapses cardinals above the cardinal whose cofinality is changed when singularizing successors of singular cardinals.
- 6 November 2017
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 146 (2) , 773-783
Open AccessSingularizing successor cardinals by forcing
We exhibit models of set theory, using large cardinals and forcing, in which successor cardinals can be made singular by some ``Namba-like'' further set forcing, in most cases without collapsing cardinals below that successor cardinal. For successors of regular cardinals, we work from consistency-wise optimal assumptions in the ground model. Successors of singular cardinals require stronger hypotheses. Our partial orderings are different from Woodin's stationary tower forcing, which requires much stronger hypotheses when singularizing successors of regular cardinals, and collapses cardinals above the cardinal whose cofinality is changed when singularizing successors of singular cardinals.
- 1 March 2017
- Published by Springer Nature in Algebra and Logic
- Vol. 56 (1) , 37-62
The Computational Power of Infinite Time Blum–Shub–Smale Machines
- 1 March 2017
- Published by Springer Nature in Algebra and Logic
- Vol. 56 (1) , 37-62
The Computational Power of Infinite Time Blum–Shub–Smale Machines
- Open Access
An Easton-like theorem for Zermelo-Fraenkel Set Theory without Choice
We show that in Zermelo-Fraenkel Set Theory without the Axiom of Choice a surjectively modified continuum function $\theta(\kappa)$ can take almost arbitrary values for all infinite cardinals. This choiceless version of Easton's Theorem is in sharp contrast to the situation in ZFC, where for singular cardinals $\kappa$, the value of $2^\kappa$ is strongly influenced by the behaviour of the continuum function below. Our construction can roughly be described as follows: In a ground model $V \models ZFC + GCH$ with a "reasonable" function $F: Card \rightarrow Card$ on the infinite cardinals, a class forcing ${\mathbb P}$ is introduced, which blows up the power sets of all cardinals according to $F$ . The eventual model $N \models ZF$ is a symmetric extension by ${\mathbb P}$ such that $\theta^N(\kappa) = F(\kappa)$ holds for all $\kappa$.Open AccessAn Easton-like theorem for Zermelo-Fraenkel Set Theory without Choice
We show that in Zermelo-Fraenkel Set Theory without the Axiom of Choice a surjectively modified continuum function $\theta(\kappa)$ can take almost arbitrary values for all infinite cardinals. This choiceless version of Easton's Theorem is in sharp contrast to the situation in ZFC, where for singular cardinals $\kappa$, the value of $2^\kappa$ is strongly influenced by the behaviour of the continuum function below. Our construction can roughly be described as follows: In a ground model $V \models ZFC + GCH$ with a "reasonable" function $F: Card \rightarrow Card$ on the infinite cardinals, a class forcing ${\mathbb P}$ is introduced, which blows up the power sets of all cardinals according to $F$ . The eventual model $N \models ZF$ is a symmetric extension by ${\mathbb P}$ such that $\theta^N(\kappa) = F(\kappa)$ holds for all $\kappa$. - 21 April 2016
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 62 (3) , 225-231
All uncountable cardinals in the Gitik model are almost Ramsey and carry Rowbottom filters
Using the analysis developed in our earlier paper , we show that every uncountable cardinal in Gitik's model of in which all uncountable cardinals are singular is almost Ramsey and is also a Rowbottom cardinal carrying a Rowbottom filter. We assume that the model of is constructed from a proper class of strongly compact cardinals, each of which is a limit of measurable cardinals. Our work consequently reduces the best previously known upper bound in consistency strength for the theory + “All uncountable cardinals are singular” + “Every uncountable cardinal is both almost Ramsey and a Rowbottom cardinal carrying a Rowbottom filter”.
- 21 April 2016
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 62 (3) , 225-231
All uncountable cardinals in the Gitik model are almost Ramsey and carry Rowbottom filters
Using the analysis developed in our earlier paper , we show that every uncountable cardinal in Gitik's model of in which all uncountable cardinals are singular is almost Ramsey and is also a Rowbottom cardinal carrying a Rowbottom filter. We assume that the model of is constructed from a proper class of strongly compact cardinals, each of which is a limit of measurable cardinals. Our work consequently reduces the best previously known upper bound in consistency strength for the theory + “All uncountable cardinals are singular” + “Every uncountable cardinal is both almost Ramsey and a Rowbottom cardinal carrying a Rowbottom filter”.
- 12 March 2013
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 78 (1) , 85-100
A minimal Prikry-type forcing for singularizing a measurable cardinal
Recently, Gitik, Kanovei and the first author proved that for a classical Prikry forcing extension the family of the intermediate models can be parametrized by /finite. By modifying the standard Prikry tree forcing we define a Prikry-type forcing which also singularizes a measurable cardinal but which is minimal, i.e., there are no intermediate models properly between the ground model and the generic extension. The proof relies on combining the rigidity of the tree structure with indiscernibility arguments resulting from the normality of the associated measures.
- 12 March 2013
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 78 (1) , 85-100
A minimal Prikry-type forcing for singularizing a measurable cardinal
Recently, Gitik, Kanovei and the first author proved that for a classical Prikry forcing extension the family of the intermediate models can be parametrized by /finite. By modifying the standard Prikry tree forcing we define a Prikry-type forcing which also singularizes a measurable cardinal but which is minimal, i.e., there are no intermediate models properly between the ground model and the generic extension. The proof relies on combining the rigidity of the tree structure with indiscernibility arguments resulting from the normality of the associated measures.