Program self-reference in constructive Scott subdomains
DOI10.1007/S00224-011-9372-1zbMATH Open1285.03053OpenAlexW1974197627MaRDI QIDQ693046FDOQ693046
Authors: John Case, Samuel E. III Moelius 
Publication date: 7 December 2012
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-011-9372-1
Recommendations
- Program self-reference in constructive Scott subdomains
- Characterizing programming systems allowing program self-reference
- Characterizing Programming Systems Allowing Program Self-reference
- Properties Complementary to Program Self-reference
- Properties complementary to program self-reference
- Self-reference and incompleteness in a non-monotonic setting
- scientific article; zbMATH DE number 1512607
- Fundamentals of Computation Theory
- Scoping constructs in logic programming: Implementation problems and their solution
- Program inversion in the refinement calculus
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of numerations, effectively presented structures (03D45) Continuous lattices and posets, applications (06B35) Semantics in the theory of computing (68Q55) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Title not available (Why is that?)
- Periodicity in generations of automata
- Infinitary self-reference in learning theory
- On effective topological spaces
- A connotational theory of program structure
- Gödel numberings of partial recursive functions
- Computable one-to-one enumerations of effective domains
- Independence Results for n-Ary Recursion Theorems
- Program self-reference in constructive Scott subdomains
- Index sets and universal numberings
- Simple Gödel Numberings, Isomorphisms, and Programming Properties
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Note on Degrees of Self-Describing Turing Machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- The essence of translation
Cited In (7)
- Characterizing Programming Systems Allowing Program Self-reference
- Program self-reference in constructive Scott subdomains
- Characterizing programming systems allowing program self-reference
- Effectivity questions for Kleene's recursion theorem
- Properties complementary to program self-reference
- Independence Results for n-Ary Recursion Theorems
- Properties Complementary to Program Self-reference
This page was built for publication: Program self-reference in constructive Scott subdomains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693046)
