| Publication | Date of Publication | Type |
|---|
A Natural Formalization of the Mutilated Checkerboard Problem in Naproche
| 2023-06-20 | Paper |
CICM'22 system entries
Lecture Notes in Computer Science | 2023-06-02 | Paper |
Beautiful formalizations in Isabelle/Naproche
| 2022-04-22 | Paper |
The Isabelle/Naproche natural language proof assistant
| 2021-12-01 | Paper |
Characterizations of ITBM-computability. II
Algebra and Logic | 2021-07-23 | Paper |
Characterizations of ITBM-computability. I
Algebra and Logic | 2021-05-20 | Paper |
Interpreting mathematical texts in Naproche-SAD
| 2021-01-20 | Paper |
An Easton-like Theorem for Zermelo-Fraenkel Set Theory with the Axiom of Dependent Choice
| 2018-12-03 | Paper |
Singularizing successor cardinals by forcing
Proceedings of the American Mathematical Society | 2017-12-08 | Paper |
The computational power of infinite time Blum-Shub-Smale machines
Algebra and Logic | 2017-09-04 | Paper |
scientific article; zbMATH DE number 6741939 (Why is no real title available?)
| 2017-07-11 | Paper |
An Easton-like theorem for Zermelo-Fraenkel Set Theory without Choice
| 2016-07-01 | Paper |
All uncountable cardinals in the Gitik model are almost Ramsey and carry Rowbottom filters
Mathematical Logic Quarterly (MLQ) | 2016-06-24 | Paper |
The first measurable cardinal can be the first uncountable regular cardinal at any successor height
Mathematical Logic Quarterly | 2014-12-05 | Paper |
Violating the singular cardinals hypothesis without large cardinals
Israel Journal of Mathematics | 2013-11-01 | Paper |
Transition of consistency and satisfiability under language extensions
Formalized Mathematics | 2013-10-08 | Paper |
The Gödel completeness theorem for uncountable languages
Formalized Mathematics | 2013-10-08 | Paper |
An Easton-like Theorem for Zermelo-Fraenkel Set Theory Without Choice (Preliminary Report)
| 2013-08-07 | Paper |
A minimal Prikry-type forcing for singularizing a measurable cardinal
Journal of Symbolic Logic | 2013-04-23 | Paper |
Towards a theory of infinite time Blum-Shub-Smale machines
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Global square and mutual stationarity at the \(\aleph_n\)
Annals of Pure and Applied Logic | 2011-09-22 | Paper |
A generalised dynamical system, infinite time register machines, and \(\Pi^1_1\)-\(\mathrm{CA}_{0}\)
Models of Computation in Context | 2011-09-09 | Paper |
Parsing and disambiguation of symbolic mathematics in the Naproche system
Lecture Notes in Computer Science | 2011-07-29 | Paper |
The consistency strength of choiceless failures of SCH
Journal of Symbolic Logic | 2010-10-04 | Paper |
Premise selection in the Naproche system
Automated Reasoning | 2010-09-14 | Paper |
Ordinal computability
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
The basic theory of infinite time register machines
Archive for Mathematical Logic | 2010-03-02 | Paper |
Ordinal machines and admissible recursion theory
Annals of Pure and Applied Logic | 2009-10-26 | Paper |
Making all cardinals almost Ramsey
Archive for Mathematical Logic | 2008-11-17 | Paper |
Register computations on ordinals
Archive for Mathematical Logic | 2008-09-12 | Paper |
An Enhanced Theory of Infinite Time Register Machines
Logic and Theory of Algorithms | 2008-06-19 | Paper |
Minimality considerations for ordinal computers modeling constructibility
Theoretical Computer Science | 2008-04-16 | Paper |
Ordinals, computations, and models of set theory
| 2007-05-09 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Forcing a mutual stationarity property in cofinality 𝜔₁
Proceedings of the American Mathematical Society | 2007-03-07 | Paper |
On the strength of mutual stationarity
| 2007-03-05 | Paper |
Ordinal computations
Mathematical Structures in Computer Science | 2007-02-09 | Paper |
The consistency strength of \(\aleph_\omega\) and \(\aleph_{\omega_1}\) being Rowbottom cardinals without the axiom of choice
Archive for Mathematical Logic | 2006-09-26 | Paper |
Hyperfine structure theory and gap 1 morasses
Journal of Symbolic Logic | 2006-08-03 | Paper |
Turing Computations On Ordinals
The Bulletin of Symbolic Logic | 2006-02-08 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Homogeneously Souslin sets in small inner models
Archive for Mathematical Logic | 2006-01-10 | Paper |
The Theory of Sets of Ordinals
| 2005-02-13 | Paper |
The category of inner models
Synthese | 2003-04-27 | Paper |
scientific article; zbMATH DE number 1390273 (Why is no real title available?)
| 2000-06-29 | Paper |
Extenders, embedding normal forms, and the Martin-Steel-theorem
Journal of Symbolic Logic | 1999-06-27 | Paper |
An Elementary Approach to the Fine Structure of L
The Bulletin of Symbolic Logic | 1998-10-01 | Paper |
scientific article; zbMATH DE number 956474 (Why is no real title available?)
| 1997-03-06 | Paper |
scientific article; zbMATH DE number 903646 (Why is no real title available?)
| 1996-09-03 | Paper |
Superatomic Boolean algebras constructed from morasses
Journal of Symbolic Logic | 1996-02-01 | Paper |
scientific article; zbMATH DE number 45214 (Why is no real title available?)
| 1992-09-17 | Paper |
On the elimination of Malitz quantifiers over Archimedian real closed fields
Archive for Mathematical Logic | 1989-01-01 | Paper |
On the free subset property at singular cardinals
Archive for Mathematical Logic | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4118361 (Why is no real title available?)
| 1989-01-01 | Paper |
Some Stationary Subsets of (λ)
Proceedings of the American Mathematical Society | 1988-01-01 | Paper |
Some applications of short core models
Annals of Pure and Applied Logic | 1988-01-01 | Paper |
The consistency strength of the free-subset property for ωω
Journal of Symbolic Logic | 1984-01-01 | Paper |
On the consistency strength of accessible Jonsson cardinals and of the weak Chang conjecture
Annals of Pure and Applied Logic | 1983-01-01 | Paper |
