Switch to: References

Add citations

You must login to add citations.
  1. Weaker variants of infinite time Turing machines.Matteo Bianchetti - 2020 - Archive for Mathematical Logic 59 (3-4):335-365.
    Infinite time Turing machines represent a model of computability that extends the operations of Turing machines to transfinite ordinal time by defining the content of each cell at limit steps to be the lim sup of the sequences of previous contents of that cell. In this paper, we study a computational model obtained by replacing the lim sup rule with an ‘eventually constant’ rule: at each limit step, the value of each cell is defined if and only if the content (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Operationalism: An Interpretation of the Philosophy of Ancient Greek Geometry.Viktor Blåsjö - 2022 - Foundations of Science 27 (2):587-708.
    I present a systematic interpretation of the foundational purpose of constructions in ancient Greek geometry. I argue that Greek geometers were committed to an operationalist foundational program, according to which all of mathematics—including its entire ontology and epistemology—is based entirely on concrete physical constructions. On this reading, key foundational aspects of Greek geometry are analogous to core tenets of 20th-century operationalist/positivist/constructivist/intuitionist philosophy of science and mathematics. Operationalism provides coherent answers to a range of traditional philosophical problems regarding classical mathematics, such (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A constructive version of Tarski's geometry.Michael Beeson - 2015 - Annals of Pure and Applied Logic 166 (11):1199-1273.
    Download  
     
    Export citation  
     
    Bookmark   2 citations