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
38
views
9
references
Top references
cited by
7
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,412
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System
other
Author(s):
Stefano Berardi
,
Makoto Tatsuta
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
Network Medicine
Most cited references
9
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
Article
: not found
Accessible Independence Results for Peano Arithmetic
Laurie Kirby
,
Jeff Paris
(1982)
0
comments
Cited
21
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
: 301-317
DOI:
10.1007/978-3-662-54458-7_18
SO-VID:
eeebf751-c28f-42c2-98a7-77e24a851a28
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
1,412
Carleson type estimates for p -harmonic functions and the conformal Martin boundary of John domains in metric measure spaces
Authors:
Hiroaki Aikawa
,
Nageswari Shanmugalingam
Heidegger Martin, ¡Alma mía! Cartas a su mujer Elfride 1915-1970, selección y comentarios de Gertrud Heidegger, Buenos Aires, Manantial, 2008, 428 pp.
Authors:
Ignacio Soneira
New record of the rare Gonatopus mariae Martins, Lara, Perioto & Olmi, 2015 (Hymenoptera, Dryinidae) for the state of Espirito Santo, Brazil
Authors:
A.L. MARTINS
,
A.L. Martins
See all similar
Cited by
7
Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System
Authors:
Stefano Berardi
,
Makoto Tatsuta
Cyclic Arithmetic Is Equivalent to Peano Arithmetic
Authors:
Alex Simpson
Equivalence of Intuitionistic Inductive Definitions and Intuitionistic Cyclic Proofs under Arithmetic
Authors:
Makoto Tatsuta
,
Stefano Berardi
See all cited by