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

All content on this site: Copyright © 2026 Sage Publications. All rights reserved. This website is technically supported and operated by China National Publications Import and Export (Group) Co., Ltd. 京ICP备09090397号-11

Search results

Search results page

Articles (3)

Journals (0)

1-3 of 3 results for admissible recursion theory

Sort by:

Relevance

Select all

Select all

Sort by:

Relevance

Select article: Cantor–Bendixson ranks of effectively closed sets in admissible recursion theory

Available access

Research article

First published May 13, 2020

Cantor–Bendixson ranks of effectively closed sets in admissible recursion theory

Reese Johnston

Computability

Select article: How much partiality is needed for a theory of computability?

Available access

Research article

First published December 21, 2023

How much partiality is needed for a theory of computability?

Dieter Spreen

Computability

Select article: A Schema for Generating Relevant Logic Programming Semantics and its Applications in Argumentation Theory

Available access

Research article

First published January, 2011

A Schema for Generating Relevant Logic Programming Semantics and its Applications in Argumentation Theory

Juan Carlos Nieves, Mauricio Osorio, Claudia Zepeda

Fundamenta Informaticae

1
10 / page

Filter Results

Article type

Publication date

Subjects

Access