Peter Koepke - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 47 from 47

2022

CICM'22 System EntriesPeter Koepke, Anton Lorenzen, Boris Shminke. mkm 2022: 344-348 [doi]

2021

2020

Interpreting Mathematical Texts in Naproche-SADAdrian De Lon, Peter Koepke, Anton Lorenzen. mkm 2020: 284-289 [doi]

2019

Textbook Mathematics in the Naproche-SAD SystemPeter Koepke. mkm 2020: [doi]

2018

Automatic Proof-Checking of Ordinary Mathematical TextsSteffen Frerix, Peter Koepke. mkm 2019: [doi]

2016

All uncountable cardinals in the Gitik model are almost Ramsey and carry Rowbottom filtersArthur W. Apter, Ioanna M. Dimitriou, Peter Koepke. mlq, 62(3):225-231, 2016. [doi]

2014

The first measurable cardinal can be the first uncountable regular cardinal at any successor heightArthur W. Apter, Ioanna M. Dimitriou, Peter Koepke. mlq, 60(6):471-486, 2014. [doi]

2013

A minimal Prikry-type forcing for singularizing a measurable cardinalPeter Koepke, Karen Räsch, Philipp Schlicht. JSYML, 78(1):85-100, 2013. [doi]

2012

Towards a Theory of Infinite Time Blum-Shub-Smale MachinesPeter Koepke, Benjamin Seyfferth. CiE 2012: 405-415 [doi]

The Gödel Completeness Theorem for Uncountable LanguagesJulian J. Schlöder, Peter Koepke. fm, 20(3):199-203, 2012. [doi]

Transition of Consistency and Satisfiability under Language ExtensionsJulian J. Schlöder, Peter Koepke. fm, 20(3):193-197, 2012. [doi]

2011

Parsing and Disambiguation of Symbolic Mathematics in the Naproche SystemMarcos Cramer, Peter Koepke, Bernhard Schröder. mkm 2011: 180-195 [doi]

Global square and mutual stationarity at the aleph::n::Peter Koepke, Philip D. Welch. APAL, 162(10):787-806, 2011. [doi]

A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0Peter Koepke, Philip D. Welch. CiE 2011: 152-159 [doi]

2010

2009

2008

Making all cardinals almost RamseyArthur W. Apter, Peter Koepke. AML, 47(7-8):769-783, 2008. [doi]

An Enhanced Theory of Infinite Time Register MachinesPeter Koepke, Russell Miller. cie 2008: 306-315 [doi]

Minimality considerations for ordinal computers modeling constructibilityPeter Koepke, Ryan Siders. TCS, 394(3):197-207, 2008. [doi]

Register computations on ordinalsPeter Koepke, Ryan Siders. AML, 47(6):529-548, 2008. [doi]

2006

The Consistency Strength of À::w:: and À::w::1:::: Being Rowbottom Cardinals Without the Axiom of ChoiceArthur W. Apter, Peter Koepke. AML, 45(6):721-737, 2006. [doi]

Hyperfine structure theory and gap 1 morassesSy-David Friedman, Peter Koepke, Boris Piwinger. JSYML, 71(2):480-490, 2006. [doi]

Infinite Time Register MachinesPeter Koepke. cie 2006: 257-266 [doi]

Homogeneously Souslin sets in small inner modelsPeter Koepke, Ralf Schindler. AML, 45(1):53-61, 2006. [doi]

Ordinal computationsPeter Koepke, Martin Koerwien. mscs, 16(5):867-884, 2006. [doi]

2005

Computing a Model of Set TheoryPeter Koepke. cie 2005: 223-232 [doi]

Turing computations on ordinalsPeter Koepke. bsl, 11(3):377-397, 2005. [doi]

2003

ProofML - eine Annotationssprache für natürliche BeweisePeter Koepke, Bernhard Schröder. ldvf, 18(1/2):428-441, 2003. [doi]

2002

The Category of Inner ModelsPeter Koepke. synthese, 133(1-2):275-303, 2002. [doi]

2001

A refinement of Jensen's constructible hierarchyPeter Koepke, Marc van Eijmeren. fotfs 2004: 159-169 [doi]

1998

Extenders, Embedding Normal Forms, and the Martin-Steel-TheoremPeter Koepke. JSYML, 63(3):1137-1176, 1998.

1997

An elementary approach to the fine structure of LSy D. Friedman, Peter Koepke. bsl, 3(4):453-468, 1997. [doi]

1995

Superatomic Boolean Algebras Constructed from MorassesPeter Koepke, Juan Carlos Martínez. JSYML, 60(3):940-951, 1995.

1989

On the free subset property at singular cardinalsPeter Koepke. AML, 28(1):43-55, 1989. [doi]

On the elimination of Malitz quantifiers over Archimedian real closed fieldsPeter Koepke. AML, 28(3):167-171, 1989. [doi]

1988

Some applications of short core modelsPeter Koepke. APAL, 37(2):179-204, 1988. [doi]

1984

The Consistency Strength of the Free-Subset Property for omega::omega::Peter Koepke. JSYML, 49(4):1198-1204, 1984.

1983

On the consistency strength of 'Accessible' Jonsson Cardinals and of the Weak Chang ConjectureHans-Dieter Donder, Peter Koepke. APAL, 25(3):233-261, 1983. [doi]

Sign in or sign up to see more results.

runs on WebDSL