Conservativity of Transitive Closure over weak operational set theory

In Ulrich Berger, Hannes Diener, Peter Schuster & Monika Seisenberger (eds.), Logic, Construction, Computation. De Gruyter (2012)
  Copy   BIBTEX

Abstract

Constructive set theory a' la Myhill-Aczel has been extended in (Cantini and Crosilla 2008, Cantini and Crosilla 2010) to incorporate a notion of (partial, non--extensional) operation. Constructive operational set theory is a constructive and predicative analogue of Beeson's Inuitionistic set theory with rules and of Feferman's Operational set theory (Beeson 1988, Feferman 2006, Jaeger 2007, Jaeger 2009, Jaeger 1009b). This paper is concerned with an extension of constructive operational set theory (Cantini and Crosilla 2010) by a uniform operation of Transitive Closure, \tau. Given a set a, \tau produces its transitive closure \tau a. We show that the theory ESTE of (Cantini and Crosilla 2010) augmented by \tau is still conservative over Peano Arithmetic.

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Elementary Constructive Operational Set Theory.Andrea Cantini & Laura Crosilla - 2010 - In Ralf Schindler (ed.), Ways of Proof Theory. De Gruyter. pp. 199-240.
Operational closure and stability.Gerhard Jäger - 2013 - Annals of Pure and Applied Logic 164 (7-8):813-821.
The dimension of the negation of transitive closure.Gregory L. McColm - 1995 - Journal of Symbolic Logic 60 (2):392-414.
Antifoundation and Transitive Closure in the System of Zermelo.Olivier Esser & Roland Hinnion - 1999 - Notre Dame Journal of Formal Logic 40 (2):197-205.
On modal μ-calculus and non-well-founded set theory.Luca Alberucci & Vincenzo Salipante - 2004 - Journal of Philosophical Logic 33 (4):343-360.
The middle ground-ancestral logic.Liron Cohen & Arnon Avron - 2019 - Synthese 196 (7):2671-2693.
A double arity hierarchy theorem for transitive closure logic.Martin Grohe & Lauri Hella - 1996 - Archive for Mathematical Logic 35 (3):157-171.

Analytics

Added to PP
2018-09-20

Downloads
16 (#798,846)

6 months
2 (#785,137)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Andrea Cantini
Università degli Studi di Firenze
Laura Crosilla
University of Oslo

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references