Independence results in computer science? (Q1158957): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050457879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On “provable” analogs of and / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Simplicity of Busy Beaver Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Retraceable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Provable Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The forcing companions of number theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classes of provable recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetical hierarchy and complexity of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3256322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing, arithmetic, division rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4153600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic properties of number theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3858182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some independence results for Peano arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3870874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear orderings under one-one reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a Theory of Enumerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization Among Provably Equivalent Programs / rank
 
Normal rank

Latest revision as of 14:28, 13 June 2024

scientific article
Language Label Description Also known as
English
Independence results in computer science?
scientific article

    Statements

    Independence results in computer science? (English)
    0 references
    0 references
    1981
    0 references
    0 references
    0 references
    0 references
    0 references
    weak theories of arithmetic
    0 references
    0 references