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