Switch to: References

Add citations

You must login to add citations.
  1. Constructibility in higher order arithmetics.A. Sochor - 1993 - Archive for Mathematical Logic 32 (6):381-389.
    We define and investigate constructibility in higher order arithmetics. In particular we get an interpretation ofn-order arithmetic inn-order arithmetic without the scheme of choice such that ∈ and the property “to be a well-ordering” are absolute in it and such that this interpretation is minimal among such interpretations.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Choices of Convenient Sets.Antonín Sochor - 1994 - Mathematical Logic Quarterly 40 (1):51-60.
    Proceeding in the theory with extensionality, comprehension for classes, existence of the empty set and the assumption the addition of one element to a set makes again a set we show a week assumption which guarantees existence of a saturated elementary extension of the system of hereditarily finite sets.
    Download  
     
    Export citation  
     
    Bookmark   1 citation