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
36
views
18
references
Top references
cited by
5
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,610
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Cyclic Arithmetic Is Equivalent to Peano Arithmetic
other
Author(s):
Alex Simpson
Publication date
(Online):
March 16 2017
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
ScienceOpen Research
Most cited references
18
Record
: found
Abstract
: not found
Book
: not found
Subsystems of Second Order Arithmetic
Stephen Simpson
(2009)
0
comments
Cited
32
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Sequent calculi for induction and infinite descent
A. Simpson
,
J. Brotherston
(2011)
0
comments
Cited
23
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Cyclic Proofs for First-Order Logic with Inductive Definitions
James Brotherston
(2005)
0
comments
Cited
20
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2017
Publication date (Online):
March 16 2017
Pages
: 283-300
DOI:
10.1007/978-3-662-54458-7_17
SO-VID:
7afedc6e-9eb9-4994-9d97-7f46cf69036b
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Coherence Spaces and Uniform Continuity
pp. 20
The Free Exponential Modality of Probabilistic Coherence Spaces
pp. 36
From Qualitative to Quantitative Semantics
pp. 53
Almost Every Simply Typed $$\lambda $$ -Term Has a Long $$\beta $$ -Reduction Sequence
pp. 71
Algebra, Coalgebra, and Minimization in Polynomial Differential Equations
pp. 88
Equational Theories of Abnormal Termination Based on Kleene Algebra
pp. 106
Companions, Codensity and Causality
pp. 124
Nominal Automata with Name Binding
pp. 145
On the Existence of Weak Subgame Perfect Equilibria
pp. 162
Optimal Reachability in Divergent Weighted Timed Games
pp. 179
Bounding Average-Energy Games
pp. 196
Logics of Repeating Values on Data Trees and Branching Counter Systems
pp. 215
Degree of Sequentiality of Weighted Automata
pp. 231
Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata
pp. 248
Partial Derivatives for Context-Free Languages
pp. 265
Dynamic Complexity of the Dyck Reachability
pp. 283
Cyclic Arithmetic Is Equivalent to Peano Arithmetic
pp. 301
Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System
pp. 321
On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context
pp. 338
Computing Continuous-Time Markov Chains as Transformers of Unbounded Observables
pp. 355
Pointless Learning
pp. 370
On Higher-Order Probabilistic Subrecursion
pp. 389
A Truly Concurrent Game Model of the Asynchronous $$\pi $$ -Calculus
pp. 407
Local Model Checking in a Logic for True Concurrency
pp. 424
The Paths to Choreography Extraction
pp. 441
On the Undecidability of Asynchronous Session Subtyping
pp. 461
A Lambda-Free Higher-Order Recursive Path Order
pp. 480
Automated Constructivization of Proofs
pp. 499
A Light Modality for Recursion
pp. 517
Unifying Guarded and Unguarded Iteration
pp. 534
Partiality, Revisited
pp. 550
On the Semantics of Intensionality
Similar content
2,610
Fundamental groups of Peano continua
Authors:
,
On-line monitoring of instrument channel performance in nuclear power plant using PEANO
Authors:
P.F. Fantoni
,
M.I. Hoffmann
,
R. SHANKAR
…
Navier-Stokes and Lattice-Boltzmann on octree-like grids in the Peano framework
Authors:
M. Mehl
,
T. Neckel
,
Ph. Neumann
See all similar
Cited by
5
Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System
Authors:
Stefano Berardi
,
Makoto Tatsuta
On the logical complexity of cyclic arithmetic
Authors:
Anupam Das
Infinitary and Cyclic Proof Systems for Transitive Closure Logic
Authors:
Liron Cohen
,
Reuben N. S. Rowe
See all cited by