The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Peter Koepke" ( http://dblp.L3S.de/Authors/Peter_Koepke )

  Author page on DBLP  Author page in RDF  Community of Peter Koepke in ASPL-2

Publication years (Num. hits)
1984-2008 (16) 2009-2011 (9)
Publication types (Num. hits)
article(17) inproceedings(8)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 8 occurrences of 4 keywords

Results
Found 25 publication records. Showing 25 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Peter Koepke, Philip D. Welch Global square and mutual stationarity at the alephn. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Marcos Cramer, Peter Koepke, Bernhard Schröder Parsing and Disambiguation of Symbolic Mathematics in the Naproche System. Search on Bibsonomy Calculemus/MKM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Peter Koepke, Philip D. Welch A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0. Search on Bibsonomy CiE The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Arthur W. Apter, Peter Koepke The consistency strength of choiceless failures of SCH. Search on Bibsonomy J. Symb. Log. The full citation details ... 2010 DBLP  BibTeX  RDF
1Merlin Carl, Tim Fischbach, Peter Koepke, Russell Miller, Miriam Nasfi, Gregor Weckbecker The basic theory of infinite time register machines. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Marcos Cramer, Peter Koepke, Daniel Kühlwein, Bernhard Schröder Premise Selection in the Naproche System. Search on Bibsonomy IJCAR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Peter Koepke, Benjamin Seyfferth Ordinal machines and admissible recursion theory. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Marcos Cramer, Bernhard Fisseni, Peter Koepke, Daniel Kühlwein, Bernhard Schröder, Jip Veldman The Naproche Project Controlled Natural Language Proof Checking of Mathematical Texts. Search on Bibsonomy CNL The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Peter Koepke Ordinal Computability. Search on Bibsonomy CiE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Ordinal machines, Infinite Time Register Machines, Constructible sets
1Peter Koepke, Ryan Siders Minimality considerations for ordinal computers modeling constructibility. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Arthur W. Apter, Peter Koepke Making all cardinals almost Ramsey. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 03E02, 03E25, 03E55, 03E35, 03E45
1Peter Koepke, Ryan Siders Register computations on ordinals. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 03D60, 03E45
1Peter Koepke, Russell Miller An Enhanced Theory of Infinite Time Register Machines. Search on Bibsonomy CiE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF ordinal computability, hypercomputation, infinitary computation, register machine
1Peter Koepke, Martin Koerwien Ordinal computations. Search on Bibsonomy Mathematical Structures in Computer Science The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Sy-David Friedman, Peter Koepke, Boris Piwinger Hyperfine structure theory and gap 1 morasses. Search on Bibsonomy J. Symb. Log. The full citation details ... 2006 DBLP  BibTeX  RDF
1Arthur W. Apter, Peter Koepke The Consistency Strength of Àw and Àw1 Being Rowbottom Cardinals Without the Axiom of Choice. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 03E02, 03E25, 03E55, 03E35, 03E45
1Peter Koepke, Ralf Schindler Homogeneously Souslin sets in small inner models. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Peter Koepke Infinite Time Register Machines. Search on Bibsonomy CiE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Peter Koepke Turing computations on ordinals. Search on Bibsonomy Bulletin of Symbolic Logic The full citation details ... 2005 DBLP  BibTeX  RDF
1Peter Koepke Computing a Model of Set Theory. Search on Bibsonomy CiE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Peter Koepke, Bernhard Schröder ProofML - eine Annotationssprache für natürliche Beweise. Search on Bibsonomy LDV Forum The full citation details ... 2003 DBLP  BibTeX  RDF
1Peter Koepke Extenders, Embedding Normal Forms, and the Martin-Steel-Theorem. Search on Bibsonomy J. Symb. Log. The full citation details ... 1998 DBLP  BibTeX  RDF
1Sy D. Friedman, Peter Koepke An elementary approach to the fine structure of L. Search on Bibsonomy Bulletin of Symbolic Logic The full citation details ... 1997 DBLP  BibTeX  RDF
1Peter Koepke, Juan Carlos Martínez Superatomic Boolean Algebras Constructed from Morasses. Search on Bibsonomy J. Symb. Log. The full citation details ... 1995 DBLP  BibTeX  RDF
1Peter Koepke The Consistency Strength of the Free-Subset Property for omegaomega. Search on Bibsonomy J. Symb. Log. The full citation details ... 1984 DBLP  BibTeX  RDF
Displaying result #1 - #25 of 25 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.