A new model construction by making a detour via intuitionistic theories III: Ultrafinitistic proofs of conservations of Σ 1 1 collection [Book Review]

Annals of Pure and Applied Logic 174 (3):103207 (2023)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2022.103207

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

A new model construction by making a detour via intuitionistic theories I: Operational set theory without choice is Π 1 -equivalent to KP.Kentaro Sato & Rico Zumbrunnen - 2015 - Annals of Pure and Applied Logic 166 (2):121-186.
A new model construction by making a detour via intuitionistic theories II: Interpretability lower bound of Feferman's explicit mathematics T 0.Kentaro Sato - 2015 - Annals of Pure and Applied Logic 166 (7-8):800-835.
Proof-theoretic conservations of weak weak intuitionistic constructive set theories.Lev Gordeev - 2013 - Annals of Pure and Applied Logic 164 (12):1274-1292.
Logical rules and the determinacy of meaning.Charles McCarty - 2018 - Studies in Logic, Grammar and Rhetoric 54 (1):89-98.
Bi-Simulating in Bi-Intuitionistic Logic.Guillermo Badia - 2016 - Studia Logica 104 (5):1037-1050.
Imperative programs as proofs via game semantics.Martin Churchill, Jim Laird & Guy McCusker - 2013 - Annals of Pure and Applied Logic 164 (11):1038-1078.
Preservation theorems for bounded formulas.Morteza Moniri - 2007 - Archive for Mathematical Logic 46 (1):9-14.
On the computational content of intuitionistic propositional proofs.Samuel R. Buss & Pavel Pudlák - 2001 - Annals of Pure and Applied Logic 109 (1-2):49-64.
Quantifier Elimination for a Class of Intuitionistic Theories.Ben Ellison, Jonathan Fleischmann, Dan McGinn & Wim Ruitenburg - 2008 - Notre Dame Journal of Formal Logic 49 (3):281-293.
Proofs and Models in Philosophical Logic.Greg Restall - 2022 - Cambridge University Press.
Linearizing intuitionistic implication.Patrick Lincoln, Andre Scedrov & Natarajan Shankar - 1993 - Annals of Pure and Applied Logic 60 (2):151-177.
Intuitionistic Completeness for First Order Classical Logic.Stefano Berardi - 1999 - Journal of Symbolic Logic 64 (1):304-312.
Full intuitionistic linear logic.Martin Hyland & Valeria de Paiva - 1993 - Annals of Pure and Applied Logic 64 (3):273-291.
Glueing of Analysis Models in an Intuitionistic Setting.D. van Dalen - 1986 - Studia Logica 45 (2):181-186.
Intuitionistic completeness for first order classical logic.Stefano Berardi - 1999 - Journal of Symbolic Logic 64 (1):304-312.

Analytics

Added to PP
2022-10-30

Downloads
21 (#715,461)

6 months
10 (#257,583)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

A well-ordering proof for Feferman's theoryT 0.Gerhard Jäger - 1983 - Archive for Mathematical Logic 23 (1):65-77.
Formalizing forcing arguments in subsystems of second-order arithmetic.Jeremy Avigad - 1996 - Annals of Pure and Applied Logic 82 (2):165-191.
Interpreting classical theories in constructive ones.Jeremy Avigad - 2000 - Journal of Symbolic Logic 65 (4):1785-1812.

View all 21 references / Add more references