Wellfoundedness proofs by means of non-monotonic inductive definitions II: first order operators

Annals of Pure and Applied Logic 162 (2):107-143 (2010)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2010.08.002

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Wellfoundedness proofs by means of non-monotonic inductive definitions I: Π₂⁰-operators.Toshiyasu Arai - 2004 - Journal of Symbolic Logic 69 (3):830-850.
Consistency proof via pointwise induction.Toshiyasu Arai - 1998 - Archive for Mathematical Logic 37 (3):149-165.
Type-theoretic interpretation of iterated, strictly positive inductive definitions.Erik Palmgren - 1992 - Archive for Mathematical Logic 32 (2):75-99.
Induction and Inductive Definitions in Fragments of Second Order Arithmetic.Klaus Aehlig - 2005 - Journal of Symbolic Logic 70 (4):1087 - 1107.
Modal Property Comprehension.Ulrich Meyer - 2013 - Synthese 190 (4):693-707.
Epsilon Substitution Method for $\Pi _{2}^{0}$ -FIX.Toshiyasu Arai - 2006 - Journal of Symbolic Logic 71 (4):1155 - 1188.
Connection-driven inductive theorem proving.Christoph Kreitz & Brigitte Pientka - 2001 - Studia Logica 69 (2):293-326.
Epsilon Substitution Method for [image] -FIX.Toshiyasu Arai - 2006 - Journal of Symbolic Logic 71 (4):1155 - 1188.
Non-Monotonic Set Theory as a Pragmatic Foundation of Mathematics.Peter Verdée - 2013 - Foundations of Science 18 (4):655-680.
Fixed point logics.Anuj Dawar & Yuri Gurevich - 2002 - Bulletin of Symbolic Logic 8 (1):65-88.
A note on theories for quasi-inductive definitions.Riccardo Bruni - 2009 - Review of Symbolic Logic 2 (4):684-699.
Eliminating definitions and Skolem functions in first-order logic.Jeremy Avigad - manuscript
Comparing inductive and circular definitions: Parameters, complexity and games.Kai-Uwe Küdhnberger, Benedikt Löwe, Michael Möllerfeld & Philip Welch - 2005 - Studia Logica 81 (1):79 - 98.
Some closure properties of finite definitions.Maricarmen Martinez - 2001 - Studia Logica 68 (1):43-68.

Analytics

Added to PP
2013-12-18

Downloads
51 (#305,341)

6 months
7 (#411,886)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A Simplified Ordinal Analysis of First-Order Reflection.Toshiyasu Arai - 2020 - Journal of Symbolic Logic 85 (3):1163-1185.
Conservations of first-order reflections.Toshiyasu Arai - 2014 - Journal of Symbolic Logic 79 (3):814-825.
Reading Gentzen's Three Consistency Proofs Uniformly.Ryota Akiyoshi & Yuta Takahashi - 2013 - Journal of the Japan Association for Philosophy of Science 41 (1):1-22.
A Sneak Preview of Proof Theory of Ordinals.Toshiyasu Arai - 2012 - Annals of the Japan Association for Philosophy of Science 20:29-47.
Wellfoundedness proof with the maximal distinguished set.Toshiyasu Arai - 2023 - Archive for Mathematical Logic 62 (3):333-357.

View all 6 citations / Add more citations

References found in this work

Proof theory for theories of ordinals—I: recursively Mahlo ordinals.Toshiyasu Arai - 2003 - Annals of Pure and Applied Logic 122 (1-3):1-85.
Proof theory for theories of ordinals II: Π3-reflection.Toshiyasu Arai - 2004 - Annals of Pure and Applied Logic 129 (1-3):39-92.
Well-ordering proofs for Martin-Löf type theory.Anton Setzer - 1998 - Annals of Pure and Applied Logic 92 (2):113-159.
Ordinal diagrams for recursively Mahlo universes.Toshiyasu Arai - 2000 - Archive for Mathematical Logic 39 (5):353-391.

View all 8 references / Add more references