Switch to: Citations

Add references

You must login to add references.
  1. Intuitionistic validity in T-normal Kripke structures.Samuel R. Buss - 1993 - Annals of Pure and Applied Logic 59 (3):159-173.
    Let T be a first-order theory. A T-normal Kripke structure is one in which every world is a classical model of T. This paper gives a characterization of the intuitionistic theory T of sentences intuitionistically valid in all T-normal Kripke structures and proves the corresponding soundness and completeness theorems. For Peano arithmetic , the theory PA is a proper subtheory of Heyting arithmetic , so HA is complete but not sound for PA-normal Kripke structures.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Models of Peano Arithmetic.Richard Kaye - 1991 - Clarendon Press.
    An introduction to the developments of nonstandard models. Beginning with Godel's incompleteness theorem, it covers the prime models, cofinal extensions, and extensions, Gaifman's construction of a definable type, Tennenbaum's theorem and Friedman's theorem on indicators, ending with a chapter on recursive saturation and resplendency.
    Download  
     
    Export citation  
     
    Bookmark   95 citations  
  • A logic stronger than intuitionism.Sabine Görnemann - 1971 - Journal of Symbolic Logic 36 (2):249-261.
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Ein Henkin-Beweis für die Vollständigkeit eines Kalküls relativ zur Grzegorczyk-Semantik.Dieter Klemke - 1971 - Archive for Mathematical Logic 14 (3-4):148-161.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Classical and Intuitionistic Models of Arithmetic.Kai F. Wehmeier - 1996 - Notre Dame Journal of Formal Logic 37 (3):452-461.
    Given a classical theory T, a Kripke model K for the language L of T is called T-normal or locally PA just in case the classical L-structure attached to each node of K is a classical model of T. Van Dalen, Mulder, Krabbe, and Visser showed that Kripke models of Heyting Arithmetic (HA) over finite frames are locally PA, and that Kripke models of HA over frames ordered like the natural numbers contain infinitely many PA-nodes. We show that Kripke models (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations