Representing Model Theory in a Type-Theoretical Logical Framework (original) (raw)
2009, Electronic Notes in Theoretical Computer Science
We give a comprehensive formal representation of first-order logic using the recently developed module system for the Twelf implementation of the Edinburgh Logical Framework LF. The module system places strong emphasis on signature morphisms as the main primitive concept, which makes it particularly useful to reason about structural translations, which occur frequently in proof and model theory. Syntax and proof theory are encoded in the usual way using LF's higher order abstract syntax and judgments-as-types paradigm, but using the module system to treat all connectives and quantifiers independently. The difficulty is to reason about the model theory, for which the mathematical foundation in which the models are expressed must be encoded itself. We choose a variant of Martin-Löf's type theory as this foundation and use it to axiomatize first-order model theoretic semantics. Then we can encode the soundness proof as a signature morphism from the proof theory to the model theory. We extend our results to models given in terms of set theory using an encoding of Zermelo-Fraenkel set theory in LF and giving a signature morphism from Martin-Löf type theory into it. These encodings can be checked mechanically by Twelf. Our results demonstrate the feasibility of comprehensively formalizing large scale representation theorems and thus promise significant future applications.
Sign up for access to the world's latest research.
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Related papers
A Type-Theoretic Framework for Formal Reasoning with Different Logical Foundations
Lecture Notes in Computer Science, 2007
A type-theoretic framework for formal reasoning with different logical foundations is introduced and studied. With logic-enriched type theories formulated in a logical framework, it allows various logical systems such as classical logic as well as intuitionistic logic to be used effectively alongside inductive data types and type universes. This provides an adequate basis for wider applications of type theory based theorem proving technology. Two notions of set are introduced in the framework and used in two case studies of classical reasoning: a predicative one in the formalisation of Weyl's predicative mathematics and an impredicative one in the verification of security protocols.
Encoding modal logics in logical frameworks
Studia Logica, 1998
We present and discuss various formalizations of Modal Logics in Logical Frameworks based on Type Theories. We consider both Hilbert-and Natural Deduction-style proof systems for representing both truth (local) and validity (global) consequence relations for various Modal Logics. We introduce several techniques for encoding the structural peculiarities of necessitation rules, in the typed?-calculus metalanguage of the Logical Frameworks. These formalizations yield readily proof-editors for Modal Logics when ...
MTT-Semantics Is Model-Theoretic As Well As Proof-Theoretic∗
2020
In this paper, we argue that formal semantics based on modern type theories (MTT-semantics) is both model-theoretic and proof-theoretic, and hence has unique advantages as a semantic framework. Being model-theoretic, it provides a wide coverage of various linguistic features partly because the rich type structure in MTTs can be used effectively to represent various collections, playing a role as sets do in Montague’s model-theoretic semantics. Being proof-theoretic, its foundational languages have a proof-theoretic meaning theory and provide a solid foundation for natural language reasoning using proof assistants. After presenting the basic arguments, we shall then focus on further development of the first, and arguably less understood, aspect: MTTsemantics is model-theoretic. We shall develop a notion of signature to allow new forms of subtyping and definitional entries and show that such formal contextual tools support useful ways of representing incomplete possible worlds in sema...
Formal Semantics in Modern Type Theories: Is It Model-Theoretic, Proof-Theoretic, or Both?
Lecture Notes in Computer Science, 2014
In this talk, we contend that, for NLs, the divide between model-theoretic semantics and proof-theoretic semantics has not been well-understood. In particular, the formal semantics based on modern type theories (MTTs) may be seen as both model-theoretic and prooftheoretic. To be more precise, it may be seen both ways in the sense that the NL semantics can first be represented in an MTT in a modeltheoretic way and then the semantic representations can be understood inferentially in a proof-theoretic way. Considered in this way, MTTs arguably have unique advantages when employed for formal semantics. ⋆ This paper is associated with the invited talk of mine in Logical Aspects of Computational Linguistics 2014. Its published version in LACL proceedings (LNCS 8535) contains some typos which have been corrected here. ⋆⋆ This work is partially supported by the research grant F/07-537/AJ of the Leverhulme Trust in U.K. 1 In philosophy, different kinds of philosophical semantics have been proposed, including the conceptual role semantics such as semantic inferentialism that has been advocated by Brandom [4,5] and others. Note that such philosophical semantic studies have rather different assumptions and more ambitious objectives as compared to formal semantics, although they have interesting influences on the latter.
Bottom-up abstract interpretation of logic programs
Theoretical Computer Science, 1994
λ-Prolog is a logic programming language that extends Prolog by incorporating notions of higher-order functions, λ-terms, higher-order unification, polymorphic types, and mechanisms for building modules and secure abstract data types. These new features are provided in a principled fashion by extending the classical first-order theory of Horn clauses to the intuitionistic higher-order theory of hereditary Harrop formulas. The justification for considering this extension a satisfactory logic programming language is provided through the proof-theoretic notion of a uniform proof. The correspondence between each extension to Prolog and the new features in the stronger logical theory is discussed. Also discussed are various aspects of an experimental implementation of λ-Prolog.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.