Short note: Least fixed points versus least closed points

Archive for Mathematical Logic 60 (7):831-835 (2021)
  Copy   BIBTEX

Abstract

This short note is on the question whether the intersection of all fixed points of a positive arithmetic operator and the intersection of all its closed points can proved to be equivalent in a weak fragment of second order arithmetic.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,553

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

Tanaka’s theorem revisited.Saeideh Bahrami - 2020 - Archive for Mathematical Logic 59 (7-8):865-877.
Fixed points in Peano arithmetic with ordinals.Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 60 (2):119-132.
Diagonal fixed points in algebraic recursion theory.Jordan Zashev - 2005 - Archive for Mathematical Logic 44 (8):973-994.
An intensional fixed point theory over first order arithmetic.Gerhard Jäger - 2004 - Annals of Pure and Applied Logic 128 (1-3):197-213.
Update Procedures and the 1-Consistency of Arithmetic.Jeremy Avigad - 2002 - Mathematical Logic Quarterly 48 (1):3-13.

Analytics

Added to PP
2021-02-08

Downloads
20 (#1,052,675)

6 months
8 (#622,456)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Searching problems above arithmetical transfinite recursion.Yudai Suzuki & Keita Yokoyama - 2024 - Annals of Pure and Applied Logic 175 (10):103488.

Add more citations

References found in this work

Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.

Add more references