Switch to: References

Add citations

You must login to add citations.
  1. Is Classical Mathematics Appropriate for Theory of Computation?Farzad Didehvar - manuscript
    Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On definability of types and relative stability.Viktor Verbovskiy - 2019 - Mathematical Logic Quarterly 65 (3):332-346.
    In this paper, we consider the question of definability of types in non‐stable theories. In order to do this we introduce a notion of a relatively stable theory: a theory is stable up to Δ if any Δ‐type over a model has few extensions up to complete types. We prove that an n‐type over a model of a theory that is stable up to Δ is definable if and only if its Δ‐part is definable.
    Download  
     
    Export citation  
     
    Bookmark