Kripke Semantics for a Logical Framework
نویسنده
چکیده
We present a semantics (using Kripke lambda models) for a logical framework (minimal implicational predicate logic with quantiication over all higher types). We apply the semantics to obtain straightforward adequacy proofs for encodings of logics in the framework.
منابع مشابه
Logical aspects of logical frameworks
This thesis provides a model–theoretic semantic analysis of aspects of the LF logical framework. The LF logical framework is the λΠ-calculus together with the judgements-as-types representation mechanism. A denotational semantics is provided for the λΠ-calculus in terms of Kripke λΠ-models. These are a generalization of the Kripke lambda models of Mitchell and Moggi to dependent types and are b...
متن کاملKripke Open Bisimulation - A Marriage of Game Semantics and Operational Techniques
Proving that two programs are contextually equivalent is notoriously hard, particularly for functional languages with references (i.e., local states). Many operational techniques have been designed to prove such equivalences, and fully abstract denotational model, using game semantics, have been built for such languages. In this work, we marry ideas coming from trace semantics, an operational v...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملNatural Deduction for Non-Classical Logics
We present a framework for machine implementation of families of non-classical logics with Kripke-style semantics. We decompose a logic into two interacting parts, each a natural deduction system: a base logic of labelled formulae, and a theory of labels characterizing the properties of the Kripke models. By appropriate combinations we capture both partial and complete fragments of large famili...
متن کاملOn Constructive Connectives and Systems
Canonical inference rules and canonical systems are defined in the framework of non-strict single-conclusion sequent systems, in which the succeedents of sequents can be empty. Important properties of this framework are investigated, and a general nondeterministic Kripke-style semantics is provided. This general semantics is then used to provide a constructive (and very natural), sufficient and...
متن کامل