The never-ending recursion
type: Item
instance of: scholarly article
title: The never-ending recursion
zbMATH Open document ID: 1439.03076
published in: Journal of Applied Logic
publication date: 2018-01-11T00:00:00Z
Mathematics Subject Classification ID: 03D20
Mathematics Subject Classification ID: 03D25
Mathematics Subject Classification ID: 03A05
zbMATH DE Number: 6824750
zbMATH Keywords: recursion
zbMATH Keywords: iteration
zbMATH Keywords: cognitive science
zbMATH Keywords: self-involvement
author: Sérgio Mota
MaRDI profile type: Publication
full work available at URL: j.jal.2017.03.003
OpenAlex ID: W2599382074
cites work: Q4398769
cites work: Q4717366
cites work: Using Structural Recursion for Corecursion
cites work: Computability and Logic
cites work: On certain formal properties of grammars
cites work: Q4840204
cites work: Q3893911
cites work: A mathematical introduction to logic.
cites work: Sequential abstract-state machines capture sequential algorithms
cites work: Q4256417
cites work: On notation for ordinal numbers
cites work: Recursive Predicates and Quantifiers
cites work: Q5812175
cites work: Q4692751
cites work: Q5384970
cites work: Q4247024
cites work: Q2762147
cites work: Recursive functions: an archeological look
cites work: Formal Reductions of the General Combinatorial Decision Problem
cites work: Q5573961
cites work: Wittgenstein versus Turing on the nature of Church's thesis
cites work: Fifty years of self-reference in arithmetic
cites work: Computability and Recursion
cites work: Turing oracle machines, online computing, and three displacements in computability theory
cites work: Formalism and intuition in computability
cites work: Syntactic structures and recursive devices: a legacy of imprecision
cites work: On Computable Numbers, with an Application to the Entscheidungsproblem
cites work: Q3773302
DOI: 10.1016/J.JAL.2017.03.003
description: scientific article; zbMATH DE number 6824750