You are on the new improved site. You can view the old site in view-only mode here until June 27, 2026

Filter Results

Search all journals

Enter search terms…

Advanced search

/

About

About Sage
About Sage Journals
Privacy Policy
Terms of Use
Contact Us
Help

Information for

Authors
Editors
Librarians
Researchers
Reviewers
Frequently asked questions

Copyright © 2026 by Sage Publications.京ICP备09090397号-11

Search results

Search results page

Articles (9)

Journals (0)

1-9 of 9 results for Kleene computability theory

Sort by:

Relevance

Select all

Select all

Sort by:

Relevance

Select article: Exploring the abyss in Kleene’s computability theory

Retricted access

Research article

First published 2024-6-13

Exploring the abyss in Kleene’s computability theory

Sam Sanders

Computability

Select article: On the computational properties of the Baire category theorem

Retricted access

Research article

First published 2025-11

On the computational properties of the Baire category theorem

Sam Sanders

Computability

Select article: Domains as Models for Semantic Information

Retricted access

Research article

First published 2015-6

Domains as Models for Semantic Information

Alexei Y. Muravitsky

Fundamenta Informaticae

Select article: Properties Complementary to Program Self-Reference

Retricted access

Research article

First published 2011-8

Properties Complementary to Program Self-Reference

John Case, Samuel E. Moelius III

Fundamenta Informaticae

Select article: Notions of semicomputability in topological algebras over the reals

Retricted access

Research article

First published 2018-12-19

Notions of semicomputability in topological algebras over the reals

Mark Armstrong, Jeffery Zucker

Computability

Select article: Effective operations of type 2 in PCAs

Retricted access

Research article

First published 2016-5-17

Effective operations of type 2 in PCAs

Eric Faber, Jaap van Oosten

Computability

Select article: Computability and non-monotone induction

Retricted access

Research article

First published 2024-6-13

Computability and non-monotone induction

Dag Normann

Computability

Select article: Towards a New Algebraic Foundation of Flowchart Scheme Theory

Retricted access

Research article

First published 1990

Towards a New Algebraic Foundation of Flowchart Scheme Theory

Virgil Emil Căzănescu, Gheorghe Ştefănescu

Fundamenta Informaticae

Select article: Bar recursion is not computable via iteration

Retricted access

Research article

First published 2019-6-17

Bar recursion is not computable via iteration

John Longley

Computability

1
10 / page

Article type

Publication date

Subjects

Access