KRIPKE SEMANTICS FOR DEPENDENT TYPE THEORY AND REALIZABILITY INTERPRETATIONS

被引:0
|
作者
LIPTON, J [1 ]
机构
[1] UNIV PENN,DEPT MATH,PHILADELPHIA,PA 19104
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Constructive reasoning has played an increasingly important role in the development of provably correct software. Both typed and type-free frameworks stemming from ideas of Heyting, Kleene, and Curry have been developed for extracting computations from constructive specifications. These include Realizability, and Theories based on the Curry-Howard isomorphism. Realizability - in its various typed and type-free formulations - brings out the algorithmic content of theories and proofs and supplies models of the ''recursive universe''. Formal systems based on the propositions-as-types paradigm, such as Martin-Lof's dependent type theories, incorporate term extraction into the logic itself. Another, major tradition in constructive semantics originated in the model theory developed by Godel, Herbrand and Tarski, resulting in the interpretations developed by Kripke and Beth, and in subsequent categorical generalizations. They provide a complete semantics for constructive logic. These models are a powerful tool for building counterexamples and establishing independence and conservativity results, but they are often less constructive and less computationally oriented. It is highly desirable to combine the power of these approaches to constructive semantics, and to elucidate some connections between them. We define modified Kripke and Beth models for syntactic Realizability and Dependent Type theory, in particular for the one-universe Intensional Martin-Lof Theory ML0i and prove a completeness theorem for the latter theory. These models provide a new framework for reasoning about computational evidence and the process of term-extraction. They are defined over a constructive type-free metatheory based on the Feferman-Beeson theories of abstract applicative structure. Our models have a feature which is shared by all. published constructive completeness theorems for intuitionistic logic, known in the literature as ''fallibility'': there may be worlds in which some sentences are both false and true, a phenomenon which corresponds to the presence of empty types in various type disciplines. We also identify a natural lattice of truth values associated with type theory and realizability: the degrees of inhabitation.
引用
收藏
页码:22 / 32
页数:11
相关论文
共 50 条
  • [31] Kripke Semantics for Intuitionistic Lukasiewicz Logic
    Lewis-Smith, A.
    Oliva, P.
    Robinson, E.
    STUDIA LOGICA, 2021, 109 (02) : 313 - 339
  • [32] Modelling uncertainty with Kripke's semantics
    Boeva, V
    Tsiporkova, E
    De Baets, B
    ARTIFICIAL INTELLIGENCE: METHODOLOGY SYSTEMS AND APPLICATIONS, 1998, 1480 : 129 - 140
  • [33] Kripke semantics for modal bilattice logic
    Jung, Achim
    Rivieccio, Umberto
    2013 28TH ANNUAL IEEE/ACM SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2013, : 438 - 447
  • [34] A note on Kripke semantics for residuated logic
    MacCaull, W
    FUZZY SETS AND SYSTEMS, 1996, 77 (02) : 229 - 234
  • [35] Kripke semantics for modal substructural logics
    Kamide N.
    Journal of Logic, Language and Information, 2002, 11 (4) : 453 - 470
  • [36] Kripke Semantics for Basic Sequent Systems
    Avron, Arnon
    Lahav, Ori
    AUTOMATED REASONING WITH ANALYTIC TABLEAUX AND RELATED METHODS, 2011, 6793 : 43 - 57
  • [37] Incompleteness results in Kripke bundle semantics
    Nagaoka, K
    Isoda, E
    MATHEMATICAL LOGIC QUARTERLY, 1997, 43 (04) : 485 - 498
  • [38] Metaphysical Semantics Meets Multiple Realizability
    Schaffer, Jonathan
    ANALYSIS, 2013, 73 (04) : 736 - 751
  • [39] KRIPKE INTERPRETATIONS OF WITTGENSTEIN PHILOSOPHY - AN ONTOLOGICAL EXPLANATION
    KNELL, S
    DEUTSCHE ZEITSCHRIFT FUR PHILOSOPHIE, 1996, 44 (01): : 101 - 116
  • [40] Stack Semantics of Type Theory
    Coquand, Thierry
    Mannaa, Bassel
    Ruch, Fabian
    2017 32ND ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2017,