S. C. Kleene

6.7k total citations
27 papers, 968 citations indexed

About

S. C. Kleene is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, S. C. Kleene has authored 27 papers receiving a total of 968 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computational Theory and Mathematics, 10 papers in Artificial Intelligence and 1 paper in Computer Networks and Communications. Recurrent topics in S. C. Kleene's work include Computability, Logic, AI Algorithms (12 papers), Logic, programming, and type systems (8 papers) and semigroups and automata theory (6 papers). S. C. Kleene is often cited by papers focused on Computability, Logic, AI Algorithms (12 papers), Logic, programming, and type systems (8 papers) and semigroups and automata theory (6 papers). S. C. Kleene collaborates with scholars based in United States. S. C. Kleene's co-authors include Emil L. Post, R. E. Vesley, Henry E. Kyburg, William Craig, Robert L. Vaught, J. W. Addison, Martin Davis, Wilhelm Ackermann, Charles A. Baylis and Paul Bernays and has published in prestigious journals such as Annals of Mathematics, Transactions of the American Mathematical Society and American Mathematical Monthly.

In The Last Decade

S. C. Kleene

23 papers receiving 670 citations

Peers

Countries citing papers authored by S. C. Kleene

Since Specialization

Citations

This map shows the geographic impact of S. C. Kleene's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by S. C. Kleene with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites S. C. Kleene more than expected).

Fields of papers citing papers by S. C. Kleene

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by S. C. Kleene. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by S. C. Kleene. The network helps show where S. C. Kleene may publish in the future.

Co-authorship network of co-authors of S. C. Kleene

This figure shows the co-authorship network connecting the top 25 collaborators of S. C. Kleene. A scholar is included among the top collaborators of S. C. Kleene based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with S. C. Kleene. S. C. Kleene is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Turing’s Analysis of Computability, and Major Applications of It 1995 ·S. C. Kleene	0
2	Recursive functionals and quantifiers of finite types revisited. V 1991 ·Transactions of the American Mathematical Society ·S. C. Kleene	6
3	Finite Axiomatizability of Theories in the Predicate Calculus Using Additional Predicate Symbols 1971 ·S. C. Kleene, William Craig, Robert L. Vaught	25
4	Formalized recursive functionals and formalized realizability 1969 ·Memoirs of the American Mathematical Society ·S. C. Kleene	35
5	The Foundations of Intuitionistic Mathematics. 1967 ·American Mathematical Monthly ·Henry E. Kyburg, S. C. Kleene, R. E. Vesley	77
6	Recursive functionals and quantifiers of finite types. II 1963 ·Transactions of the American Mathematical Society ·S. C. Kleene	17
7	Turing-Machine Computable Functionals of Finite Types II^† 1962 ·Proceedings of the London Mathematical Society ·S. C. Kleene	13
8	Lambda-definable functionals of finite types 1962 ·Fundamenta Mathematicae ·S. C. Kleene	7
9	Quantification of number-theoretic functions 1960 ·Compositio Mathematica ·S. C. Kleene	37
10	Recursive Functionals and Quantifiers of Finite Types I 1959 ·Transactions of the American Mathematical Society ·S. C. Kleene	30
11	Extension of an effectively generated class of functions by enumeration 1958 ·Colloquium Mathematicum ·S. C. Kleene	45
12	Review: E. W. Beth, Semantic Construction of Intuitionistic Logic 1957 ·Project Euclid (Cornell University) ·S. C. Kleene	1
13	E. W. Beth. Semantic construction of intuitionistic logic. Mededelingen der Koninklijke Nederlandse Akademie van Wetenschappen, Afd. Letterkunde, n.s. vol. 19 no. 11 (1956), pp. 357–388. 1957 ·Journal of Symbolic Logic ·S. C. Kleene	26
14	A note on function quantification 1957 ·Proceedings of the American Mathematical Society ·J. W. Addison, S. C. Kleene	14
15	JSL volume 21 issue 3 Cover and Front matter and Errata 1956 ·Journal of Symbolic Logic ·(unknown), S. C. Kleene, (unknown), (unknown), Wilhelm Ackermann, Charles A. Baylis, Paul Bernays, (unknown), Martin Davis, (unknown), (unknown), (unknown), (unknown), (unknown), (unknown), (unknown), (unknown), (unknown), (unknown), (unknown), (unknown), (unknown)	1
16	A Note on Computable Functionals 1956 ·Indagationes Mathematicae (Proceedings) ·S. C. Kleene	4
17	Arithmetical predicates and function quantifiers 1955 ·Transactions of the American Mathematical Society ·S. C. Kleene	91
18	Arithmetical Predicates and Function Quantifiers 1955 ·Transactions of the American Mathematical Society ·S. C. Kleene	36
19	The Upper Semi-Lattice of Degrees of Recursive Unsolvability 1954 ·Annals of Mathematics ·S. C. Kleene, Emil L. Post	148
20	Finite axiomatizability of theories in the predicate calculus using additional predicate symbols. Two papers on the predicate calculus 1952 ·Memoirs of the American Mathematical Society ·S. C. Kleene	11

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact