On feasible numbers

DOI10.1007/3-540-60178-3_78OpenAlexW1534102678WikidataQ56067750 ScholiaQ56067750MaRDI QIDQ6064275

Vladimir Yu. Sazonov

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60178-3_78

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Related Items (1)

STRICT FINITISM, FEASIBILITY, AND THE SORITES

Cites Work

• Functional interpretations of feasibly constructive arithmetic
• Constructivism in mathematics. An introduction. Volume II
• Bounds for proof-search and speed-up in the predicate calculus
• Lower Bounds on Herbrand's Theorem
• Existence and feasibility in arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On feasible numbers