Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
4
views
4
references
Top references
cited by
3
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,885
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Interactive Theorem Proving
Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω 1
other
Author(s):
Michael Norrish
,
Brian Huffman
Publication date
(Print):
2013
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
UCL: UN SDG 01 No Poverty
Most cited references
4
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving
Dmitry Traytel
,
Andrei Popescu
,
Jasmin C. Blanchette
(2012)
0
comments
Cited
6
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Ordinal Arithmetic: Algorithms and Mechanization
Panagiotis Manolios
,
Daron Vroon
(2005)
0
comments
Cited
4
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Proof Pearl: Wellfounded Induction on the Ordinals Up to ε 0
Matt Kaufmann
,
Konrad Slind
(2007)
0
comments
Cited
1
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2013
Pages
: 133-146
DOI:
10.1007/978-3-642-39634-2_12
SO-VID:
addad51d-bc4f-4ad4-9fdb-7a1d4eba6eb7
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 197
Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL
pp. 451
Communicating Formal Proofs: The Case of Flyspeck
pp. 35
MaSh: Machine Learning for Sledgehammer
pp. 51
Scalable LCF-Style Proof Translation
pp. 84
Automatic Data Refinement
pp. 100
Data Refinement in Isabelle/HOL
pp. 133
Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω 1
pp. 229
Mechanical Verification of SAT Refutations with Extended Resolution
pp. 279
Type Classes and Filters for Mathematical Analysis in Isabelle/HOL
Similar content
3,885
Transfinite Adams representability
Authors:
,
Transfinite Recursion
Authors:
Paul R. Halmos
Ranked structures and arithmetic transfinite recursion
Authors:
Noam Greenberg
,
Antonio Montalbán
See all similar
Cited by
3
Cardinals in Isabelle/HOL
Authors:
Jasmin Christian Blanchette
,
Andrei Popescu
,
Dmitriy Traytel
Unique Solutions of Contractions, CCS, and their HOL Formalisation
Authors:
Chun Tian
,
Davide Sangiorgi
Unique Solutions of Contractions, CCS, and their HOL Formalisation
Authors:
Davide Sangiorgi
,
Chun Tian
See all cited by