Finite combinatory processes—formulation

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Abstract

The present formulation should prove significant in the development of symbolic logic along the lines of Gödel's theorem on the incompleteness of symbolic logics and Church's results concerning absolutely unsolvable problems.

Related collections

Most cited references 1

Record: found
Abstract: not found
Article: not found

An Unsolvable Problem of Elementary Number Theory

Alonzo Church (1936)

0 comments Cited 160 times – based on 0 reviews      Review now

Bookmark

All references

Author and article information

Journal

Journal ID (publisher-id): applab

Title: The Journal of Symbolic Logic

Abbreviated Title: J. symb. log.

Publisher: JSTOR

ISSN (Print): 0022-4812

ISSN (Electronic): 1943-5886

Publication date Created: September 1936

Publication date (Print): March 2014

Volume: 1

Issue: 03

Pages: 103-105

Article

DOI: 10.2307/2269031

SO-VID: 25a66732-051d-4872-ab7a-04781178a2d8

History

Data availability:

Comments

Comment on this article

scite_

Smart Citations

Citing PublicationsSupportingMentioningContrasting

View Citations

See how this article has been cited at scite.ai

scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.