Weak and strong versions of Effective Transfinite Recursion

Annals of Pure and Applied Logic 174 (4):103232 (2023)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2022.103232

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,873

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

Eliminating the ordinals from proofs. An analysis of transfinite recursion.Edoardo Rivello - 2014 - In Proceedings of the conference "Philosophy, Mathematics, Linguistics. Aspects of Interaction", St. Petersburg, April 21-25, 2014. pp. 174-184.
Strong Normalization Theorem for a Constructive Arithmetic with Definition by Transfinite Recursion and Bar Induction.Osamu Takaki - 1997 - Notre Dame Journal of Formal Logic 38 (3):350-373.
Recursion theorems and effective domains.Akira Kanda - 1988 - Annals of Pure and Applied Logic 38 (3):289-300.
Transfinite recursion and computation in the iterative conception of set.Benjamin Rin - 2015 - Synthese 192 (8):2437-2462.
What is effective transfinite recursion in reverse mathematics?Anton Freund - 2020 - Mathematical Logic Quarterly 66 (4):479-483.
Did Searle attack strong strong or weak strong AI.Aaron Sloman - 1986 - In A. G. Cohn and & R. J. Thomas (eds.), Artificial Intelligence and its Applications. John Wiley and Sons.
Some new double induction and superinduction principles.Raymond M. Smullyan - 1990 - Studia Logica 49 (1):23 - 30.
Did Searle attack strong strong AI or weak strong AI?Aaron Sloman - 1986 - In Did Searle attack strong strong or weak strong AI. Chichester.
Nominalistic ordinals, recursion on higher types, and finitism.Maria Hämeen-Anttila - 2019 - Bulletin of Symbolic Logic 25 (1):101-124.
On the dangers of conflating strong and weak versions of a theory of consciousness.Matthias Michel & Hakwan Lau - 2020 - Philosophy and the Mind Sciences 1 (II).
Strengths and weaknesses of weak and strong supervenience.Mark Moyer - unknown
Relative predicativity and dependent recursion in second-order set theory and higher-order theories.Sato Kentaro - 2014 - Journal of Symbolic Logic 79 (3):712-732.
Rice and Rice-Shapiro Theorems for transfinite correction grammars.John Case & Sanjay Jain - 2011 - Mathematical Logic Quarterly 57 (5):504-516.
Strong Motivational Internalism.Matej Sušnik - 2015 - International Philosophical Quarterly 55 (2):165-177.
The Strong Version of Underdetermination of Theories by Empirical Data: Comments on Woleński's Analysis.Mostafa Taqavi & Mohammad Zarepour - 2008 - Forum Philosophicum: International Journal for Philosophy 13 (1):111-117.

Analytics

Added to PP
2023-01-05

Downloads
11 (#1,161,724)

6 months
2 (#1,250,447)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
Transfinite induction within Peano arithmetic.Richard Sommer - 1995 - Annals of Pure and Applied Logic 76 (3):231-289.
Reverse mathematics and ordinal exponentiation.Jeffry L. Hirst - 1994 - Annals of Pure and Applied Logic 66 (1):1-18.
Well ordering principles and -statements: A pilot study.Anton Freund - 2021 - Journal of Symbolic Logic 86 (2):709-745.
WKL 0 and induction principles in model theory.David R. Belanger - 2015 - Annals of Pure and Applied Logic 166 (7-8):767-799.

View all 8 references / Add more references