#### Filter Results:

#### Publication Year

1983

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Peter Koepke
- Bulletin of Symbolic Logic
- 2005

We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite set of ordinal parameters if and only if it is an element of Gödel's constructible universe L. This characterization can be… (More)

The Naproche project 1 (NAtural language PROof CHEcking) studies the semi-formal language of mathematics (SFLM) as used in journals and textbooks from the perspectives of linguistics, logic and mathematics. A central goal of Naproche is to develop and implement a controlled natural language (CNL) for mathematical texts which can be transformed automatically… (More)

- Peter Koepke
- J. Symb. Log.
- 1984

- Peter Koepke
- Ann. Pure Appl. Logic
- 1988

- Peter Koepke, Ryan Siders
- 2012

- Peter Koepke, Benjamin Seyfferth
- Ann. Pure Appl. Logic
- 2009

We generalize standard Turing machines working in time ω on a tape of length ω to abstract machines with time α and tape length α, for α some limit ordinal. This model of computation determines an associated computability theory: α-computability theory. We compare the new theory to α-recursion theory, which was developed by G. Sacks and his school. For α an… (More)

- Peter Koepke, Ryan Siders
- Arch. Math. Log.
- 2008

We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounded truth predicate on the ordinals. The class of sets of ordinals which can be read off the truth predicate satisfies a natural theory SO. SO is the theory of the sets of ordinals… (More)

- Hans-Dieter Donder, Peter Koepke
- Ann. Pure Appl. Logic
- 1983

Using the core model K we determine better lower bounds for the consistency strength of some combinatorial principles: I. Assume that A is a Jonsson cardinal which is 'accessible' in the sense that at least one of (l)-(4) holds: (1) A is a successor cardinal; (2) A = oE and 6 <A ; (3) A is singular of uncountable cofinality; (4) A is a regular but not… (More)

- Peter Koepke
- CiE
- 2006

Infinite time register machines (ITRMs) are register machines which act on natural numbers and which may run for arbitrarily many ordinal steps. Successor steps are determined by standard register machine commands, at limits the register contents are defined as lim inf's of the previous register contents. We prove that a real number is computable by an ITRM… (More)

- Peter Koepke, Russell Miller
- CiE
- 2008

Infinite time register machines (ITRMs) are register machines which act on natural numbers and which are allowed to run for arbitrarily many ordinal steps. Successor steps are determined by standard register machine commands. At limit times a register content is defined as a lim inf of previous register contents, if that limit is finite; otherwise the… (More)