Fragments of bounded arithmetic and the lengths of proofs (Q5502825): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Bounds for proof-search and speed-up in the predicate calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4208265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded arithmetic and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified propositional calculi and fragments of bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Herbrandizing search problems in Bounded Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On induction-free provability / rank
 
Normal rank

Revision as of 23:35, 28 June 2024

scientific article; zbMATH DE number 5488489
Language Label Description Also known as
English
Fragments of bounded arithmetic and the lengths of proofs
scientific article; zbMATH DE number 5488489

    Statements

    Identifiers